• No results found

verifiable secret

Efficient Verifiable Secret Sharing Scheme over Bilinear Groups

Efficient Verifiable Secret Sharing Scheme over Bilinear Groups

... A verifiable secret sharing (VSS) scheme is a secret sharing scheme with the special property that every player is able to verify whether the share distributed to him by a dealer is ...a ...

9

Linear threshold verifiable secret sharing in bilinear groups

Linear threshold verifiable secret sharing in bilinear groups

... the secret keys are elements of bilinear groups. For safeguarding such secret keys or decrypting or signing in a threshold manner, verifiable secret sharing in bilinear groups is ...random ...

7

Dealer-Leakage  Resilient  Verifiable  Secret  Sharing

Dealer-Leakage Resilient Verifiable Secret Sharing

... the secret and can simply send it over a secure communication channel placed outside the settings of the ...Resilience Verifiable Secret Sharing (DLR-VSS), a secret sharing that achieves both ...

10

Multiuser Message Authentication, Application to Verifiable Secret Sharing and Key Management Schemes

Multiuser Message Authentication, Application to Verifiable Secret Sharing and Key Management Schemes

... non-interactive verifiable secret sharing scheme for multiple dealers, in which shares reveal no information about the secret, and dealers cannot deal inconsistent ...

8

Verifiable Secret Sharing Authentication Scheme without Trusted Center for Mobile Ad Hoc Network

Verifiable Secret Sharing Authentication Scheme without Trusted Center for Mobile Ad Hoc Network

... Verifiable secret sharing authentication scheme [12] without trusted center is proposed in this paper with characters of ...a secret share factor that to create secret ...own secret ...

5

Efficient and Information-Theoretical Secure Verifiable Secret Sharing over Bilinear Groups

Efficient and Information-Theoretical Secure Verifiable Secret Sharing over Bilinear Groups

... Proof From Theorem 2, we learn that the adversary can not get any information about the secret polynomial f(x) given the public commitments. Nevertheless according to the algo- rithm of distribution, to acquire ...

5

Broadcast (and  Round)  Efficient  Verifiable  Secret  Sharing

Broadcast (and Round) Efficient Verifiable Secret Sharing

... Verifiable secret sharing (VSS) [CGMA85], where a dealer wishes to share a secret among a group of n parties, at most t of which (possibly including the dealer) may be actively malicious, is a funda- mental ...

19

Vol 7, No 7 (2017)

Vol 7, No 7 (2017)

... Abstract: Verifiable secret sharing schemes are important in cloud computing ...threshold secret sharing ...needed. Secret sharing has also been suggested for sensor networks where the links ...

6

One Time Password Scheme Via Secret Sharing Techniques

One Time Password Scheme Via Secret Sharing Techniques

... using secret shares strictly as an authentication mechanism nor a periodic/temporary authentication mechanism as is the case with one- time ...identify, secret sharing authentication provides no additional ...

50

Short  Double-   and  N-Times-Authentication-Preventing  Signatures  from  ECDSA   and  More

Short Double- and N-Times-Authentication-Preventing Signatures from ECDSA and More

... Shamir secret sharing with (linear) ElGamal encryption in a semi-black box ...the verifiable secret sharing scheme in the encrypted domain and to prove that the respective encrypted evaluation ...

33

Finding the secret river : mapping a composite narrative of the secret river and searching for the secret river

Finding the secret river : mapping a composite narrative of the secret river and searching for the secret river

... While a geographical longing might make for an engaging textual journey, nostalgia‟s temporal counterpart is more problematic and dangerous. The word nostalgia, denoting a longing which can refer either to spatial or ...

97

A  verifiable  shuffle  for  the  GSW  cryptosystem

A verifiable shuffle for the GSW cryptosystem

... The final issue is to take advantage of the quantum security of the lattice based encryption schemes, and then make the protocol future-proof. The secrecy requirements for verifiable shuffles is long-term, while ...

18

Generalizing  Efficient  Multiparty  Computation

Generalizing Efficient Multiparty Computation

... – Structure Preserving Oblivious Transfer (SPOT) and a generic composable constructions of Verifiable Oblivious Transfer: We introduce SPOT, which is basically a 1-out-of-2 OT compati- ble with GS-Proofs , i.e. ...

22

Verifiable  Delay  Functions

Verifiable Delay Functions

... Values of σ(t) Clearly any candidate construction trivially satisfies σ(t)-sequentiality for some σ (e.g. σ(t) = 0). Thus, security becomes more meaningful as σ(t) → t. No construction can obtain σ(t) = t because by ...

32

Geppetto:  Versatile  Verifiable  Computation

Geppetto: Versatile Verifiable Computation

... Geppetto introduces complementary techniques for reducing prover overhead and increasing prover flexibility. With Multi- QAPs, Geppetto reduces the cost of sharing state between com- putations (e.g., for MapReduce) or ...

22

Verifiable Classroom Voting in Practice

Verifiable Classroom Voting in Practice

... We also aimed to address the second limitation by leveraging the latest E2E verifiable voting techniques. This second limitation may not immediately seem like much of an issue for classroom voting. However, in ...

9

America's secret competitive advantage is a dirty secret

America's secret competitive advantage is a dirty secret

... Even during the presidential elections of 2008 when turnout was high by past standards, and which saw extraordinary efforts by the Obama campaign to mobilize poor and minority voters, a [r] ...

12

Secret Communications  A Bibliography of Secret Writing and Cryptography

Secret Communications A Bibliography of Secret Writing and Cryptography

... Follow this and additional works at: https://scholarlycommons.law.northwestern.edu/jclc Part of the Criminal Law Commons, Criminology Commons, and the Criminology and Criminal Justice Co[r] ...

6

America's secret competitive advantage is a dirty secret

America's secret competitive advantage is a dirty secret

... Even during the presidential elections of 2008 when turnout was high by past standards, and which saw extraordinary efforts by the Obama campaign to mobilize poor and minority voters, a [r] ...

11

A  foundation  for  secret,  verifiable  elections

A foundation for secret, verifiable elections

... Smyth, Frink & Clarkson capture universal verifiability as a game that tasks the adversary to falsify evidence that causes checks to succeed when the out- come does not correspond to[r] ...

40

Show all 1924 documents...

Related subjects