Topic
Verifiable secret sharing
About: Verifiable secret sharing is a research topic. Over the lifetime, 4241 publications have been published within this topic receiving 99569 citations.
Papers published on a yearly basis
Papers
More filters
Posted Content•
TL;DR: Verifiable Random Functions (VRFs) as introduced by Micali, Rabin and Vadhan are a special form of Pseudo Random Functions wherein a secret key holder can also prove validity of the function evaluation relative to a statistically binding commitment.
Abstract: Verifiable Random Functions (VRFs) as introduced by Micali, Rabin and Vadhan are a special form of Pseudo Random Functions (PRFs) wherein a secret key holder can also prove validity of the function evaluation relative to a statistically binding commitment.
41 citations
21 May 1995
TL;DR: A secret sharing scheme permits a secret to be shared among participants in such a way that only qualified subsets of participants can recover the secret if any non qualified subset has absolutely no information about the secret, then the scheme is called perfect.
Abstract: A secret sharing scheme permits a secret to be shared among participants in such a way that only qualified subsets of participants can recover the secret. If any non qualified subset has absolutely no information about the secret, then the scheme is called perfect. Unfortunately, in this case the size of the shares cannot be less than the size of the secret. Krawczyk [9] showed how to improve this bound in the case of computational threshold schemes by using Rabin's information dispersal algorithms [14], [15].
We show how to extend the information dispersal algorithm for general access structure (we call access structure, the set of all qualified subsets). We give bounds on the amount of information each participant must have. Then we apply this to construct computational schemes for general access structures. The size of shares each participant must have in our schemes is nearly minimal: it is equal to the minimal bound plus a piece of information whose length does not depend on the secret size but just on the security parameter.
41 citations
TL;DR: In this article, the authors show how to construct a quantum (k, n) threshold scheme without the assistance of a trusted party, who generates and distributes shares among the participants, instead, each participant chooses his private state and contributes the same to the determination of the final secret quantum state.
Abstract: In a conventional quantum (k, n) threshold scheme, a trusted party shares a secret quantum state with n participants such that any k of those participants can cooperate to recover the original secret, while fewer than k participants obtain no information about the secret. In this paper we show how to construct a quantum (k, n) threshold scheme without the assistance of a trusted party, who generates and distributes shares among the participants. Instead, each participant chooses his private state and contributes the same to the determination of the final secret quantum state.
41 citations
13 Dec 2008
TL;DR: A new approach to the expansion of classical cryptographic algorithms used for secret sharing and sharing data, with an additional, linguistic stage for the generation of the secret element built by defined sequence grammar is presented.
Abstract: The subject of this work is the presentation of a new approach to the expansion of classical cryptographic algorithms used for secret sharing and sharing data, with an additional, linguistic stage for the generation of the secret element. Such a part shall be generated in the form of a linguistic description of the shared data, built by defined sequence grammar. The definition of grammar in this scheme will provide additional information required to reconstruct the secret previously split with any algorithm implementing (m, n)-threshold scheme.
41 citations
12 Nov 2017
TL;DR: Verifiable Random Functions (VRFs) as discussed by the authors are a special form of pseudo random functions where a secret key holder can also prove validity of the function evaluation relative to a statistically binding commitment.
Abstract: Verifiable Random Functions (VRFs) as introduced by Micali, Rabin and Vadhan are a special form of Pseudo Random Functions (PRFs) wherein a secret key holder can also prove validity of the function evaluation relative to a statistically binding commitment.
41 citations