Efficient Secure Multi-party Computation
- 27 October 2000
- book chapter
- Published by Springer Nature
- p. 143-161
- https://doi.org/10.1007/3-540-44448-3_12
Abstract
No abstract availableKeywords
This publication has 28 references indexed in Scilit:
- Maintaining Security in the Presence of Transient FaultsPublished by Springer Nature ,2001
- Efficient Multiparty Protocols Using Circuit RandomizationPublished by Springer Nature ,2001
- General Secure Multi-party Computation from any Linear Secret-Sharing SchemePublished by Springer Nature ,2000
- Security and Composition of Multiparty Cryptographic ProtocolsJournal of Cryptology, 2000
- Efficient Multiparty Computations Secure Against an Adaptive AdversaryPublished by Springer Nature ,1999
- Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minorityJournal of Cryptology, 1991
- Non-cryptographic fault-tolerant computing in constant number of rounds of interactionPublished by Association for Computing Machinery (ACM) ,1989
- Completeness theorems for non-cryptographic fault-tolerant distributed computationPublished by Association for Computing Machinery (ACM) ,1988
- Bounds on information exchange for Byzantine agreementJournal of the ACM, 1985
- An efficient algorithm for byzantine agreement without authenticationInformation and Control, 1982