Perfectly-Secure MPC with Linear Communication Complexity
Authors:
- 25 February 2008
- book chapter
- Published by Springer Nature
- p. 213-230
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Robust Multiparty Computation with Linear Communication Complexity2006
- Efficient Multi-party Computation with Dispute Control2006
- Efficient Multiparty Protocols Using Circuit Randomization2001
- Efficient Secure Multi-party Computation2000
- Modular construction of a Byzantine agreement protocol with optimal message bit complexityInformation and Computation, 1992
- Bit Optimal Distributed Consensus1992
- Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minorityJournal of Cryptology, 1991
- Multiparty Computations Ensuring Privacy of Each Party’s Input and Correctness of the Result1988
- Cryptographic Computation: Secure Fault-Tolerant Protocols and the Public-Key Model (Extended Abstract)1988
- How to share a secretCommunications of the ACM, 1979