A practical scheme for non-interactive verifiable secret sharing
- 1 October 1987
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 02725428,p. 427-438
- https://doi.org/10.1109/sfcs.1987.4
Abstract
This paper presents an extremely efficient, non-interactive protocol for verifiable secret sharing. Verifiable secret sharing (VSS) is a way of bequeathing information to a set of processors such that a quorum of processors is needed to access the information. VSS is a fundamental tool of cryptography and distributed computing. Seemingly difficult problems such as secret bidding, fair voting, leader election, and flipping a fair coin have simple one-round reductions to VSS. There is a constant-round reduction from Byzantine Agreement to non-interactive VSS. Non-interactive VSS provides asynchronous networks with a constant-round simulation of simultaneous broadcast networks whenever even a bare majority of processors are good. VSS is constantly repeated in the simulation of fault-free protocols by faulty systems. As verifiable secret sharing is a bottleneck for so many results, it is essential to find efficient solutions.Keywords
This publication has 11 references indexed in Scilit:
- Achieving independence in logarithmic number of roundsPublished by Association for Computing Machinery (ACM) ,1987
- Proofs that yield nothing but their validity and a methodology of cryptographic protocol designPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1986
- A Simple and Efficient Randomized Byzantine Agreement AlgorithmIEEE Transactions on Software Engineering, 1985
- Verifiable secret sharing and achieving simultaneity in the presence of faultsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1985
- A robust and verifiable cryptographically secure election schemePublished by Institute of Electrical and Electronics Engineers (IEEE) ,1985
- Probabilistic encryptionJournal of Computer and System Sciences, 1984
- How discreet is the discrete log?Published by Association for Computing Machinery (ACM) ,1983
- How to generate random integers with known factorizationPublished by Association for Computing Machinery (ACM) ,1983
- How to share a secretCommunications of the ACM, 1979
- A method for obtaining digital signatures and public-key cryptosystemsCommunications of the ACM, 1978