Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing
Top Cited Papers
- 18 May 2001
- book chapter
- Published by Springer Nature
- p. 129-140
- https://doi.org/10.1007/3-540-46766-1_9
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- On the Classification of Ideal Secret Sharing SchemesPublished by Springer Nature ,2001
- A Protocol to Set Up Shared Secret Schemes Without the Assistance of a Mutually Trusted PartyPublished by Springer Nature ,1991
- How to (Really) Share a SecretPublished by Springer Nature ,1990
- Verifiable secret sharing and multiparty protocols with honest majorityPublished by Association for Computing Machinery (ACM) ,1989
- Minimum disclosure proofs of knowledgeJournal of Computer and System Sciences, 1988
- Completeness theorems for non-cryptographic fault-tolerant distributed computationPublished by Association for Computing Machinery (ACM) ,1988
- A practical scheme for non-interactive verifiable secret sharingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1987
- How to Generate Cryptographically Strong Sequences of Pseudorandom BitsSIAM Journal on Computing, 1984
- How to share a secretCommunications of the ACM, 1979
- Greatest of the Least Primes in Arithmetic Progressions Having a Given ModulusMathematics of Computation, 1979