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
••
[...]
TL;DR: Reading is a need and a hobby at once and this condition is the on that will make you feel that you must read.
Abstract: Some people may be laughing when looking at you reading in your spare time. Some may be admired of you. And some may want be like you who have reading hobby. What about your own feel? Have you felt right? Reading is a need and a hobby at once. This condition is the on that will make you feel that you must read. If you know are looking for the book enPDFd the open secret as the choice of reading, you can find here.
29 citations
••
TL;DR: This paper proposes a concrete VDB construction supporting efficient keyword search based on the enhanced vector commitment, where each position of vector commitment is tied to a distinct keyword.
29 citations
•
28 Oct 2004
TL;DR: In this article, a self-signed signature is first generated and then used as input to the generation of a pair of private and public keys, and verification of the signature proves that the keys are generated from a key generation process utilizing the signature.
Abstract: The invention provides a method of verifiable generation of public keys. According to the method, a self-signed signature is first generated and then used as input to the generation of a pair of private and public keys. Verification of the signature proves that the keys are generated from a key generation process utilizing the signature. A certification authority can validate and verify a public key generated from a verifiable key generation process.
29 citations
••
27 Jan 2003TL;DR: This work generalizes some protocols dealing with verifiable secret sharing, in such a way that they run in a general distributed scenario for both the tolerated subset of dishonest players and the subsets of honest players authorized to execute the different phases of the protocols.
Abstract: Secret sharing schemes are an essential part of distributed cryptographic systems. When dishonest participants are considered, then an appropriate tool are verifiable secret sharing schemes. Such schemes have been traditionally considered for a threshold scenario, in which all the participants play an equivalent role. In this work, we generalize some protocols dealing with verifiable secret sharing, in such a way that they run in a general distributed scenario for both the tolerated subsets of dishonest players and the subsets of honest players authorized to execute the different phases of the protocols.
29 citations
••
TL;DR: The security of this protocol, in which the collective eavesdropping-check is employed, is found to be insecure and two dishonest agents may collaborate to eavesdrop (half of) Alice's secret messages without introducing any error.
29 citations