Strong verifiable secret sharing extended abstract
- 1 January 1991
- book chapter
- Published by Springer Nature
- p. 213-227
- https://doi.org/10.1007/3-540-54099-7_15
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- A zero-one law for Boolean privacyPublished by Association for Computing Machinery (ACM) ,1989
- Verifiable secret sharing and multiparty protocols with honest majorityPublished by Association for Computing Machinery (ACM) ,1989
- Multiparty computation with faulty majorityPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989
- Optimal algorithms for Byzantine agreementPublished by Association for Computing Machinery (ACM) ,1988
- Multiparty unconditionally secure protocolsPublished by Association for Computing Machinery (ACM) ,1988
- 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