Robustness for Free in Unconditional Multi-party Computation
- 2 August 2001
- book chapter
- Published by Springer Nature
- p. 101-118
- https://doi.org/10.1007/3-540-44647-8_6
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Efficient Multiparty Protocols Using Circuit RandomizationPublished by Springer Nature ,2001
- Multiparty Computation from Threshold Homomorphic EncryptionPublished by Springer Nature ,2001
- Efficient Secure Multi-party ComputationPublished by Springer Nature ,2000
- Efficient Multiparty Computations Secure Against an Adaptive AdversaryPublished by Springer Nature ,1999
- Simplified VSS and fast-track multiparty computations with applications to threshold cryptographyPublished by Association for Computing Machinery (ACM) ,1998
- Asynchronous secure computationPublished by Association for Computing Machinery (ACM) ,1993
- 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
- Optimal algorithms for Byzantine agreementPublished by Association for Computing Machinery (ACM) ,1988
- Completeness theorems for non-cryptographic fault-tolerant distributed computationPublished by Association for Computing Machinery (ACM) ,1988