Round-Optimal and Efficient Verifiable Secret Sharing
- 1 January 2006
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
- p. 329-342
- https://doi.org/10.1007/11681878_17
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- The round complexity of verifiable secret sharing and secure multicastPublished by Association for Computing Machinery (ACM) ,2001
- Simplified VSS and fast-track multiparty computations with applications to threshold cryptographyPublished by Association for Computing Machinery (ACM) ,1998
- Verifiable secret sharing and multiparty protocols with honest majorityPublished by Association for Computing Machinery (ACM) ,1989
- Completeness theorems for non-cryptographic fault-tolerant distributed computationPublished by Association for Computing Machinery (ACM) ,1988
- Verifiable secret sharing and achieving simultaneity in the presence of faultsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1985
- How to share a secretCommunications of the ACM, 1979
- Safeguarding cryptographic keysPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1979