Asynchronous Multiparty Computation with Linear Communication Complexity
- 1 January 2013
- book chapter
- Published by Springer Nature
- p. 388-402
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority2012
- Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography2010
- Perfectly-Secure MPC with Linear Communication Complexity2008
- Simple and Efficient Perfectly-Secure Asynchronous MPC2007
- Scalable and Unconditionally Secure Multiparty Computation2007
- Efficient Multi-party Computation with Dispute Control2006
- Efficient Multiparty Protocols Using Circuit Randomization2001
- Efficient Secure Multi-party Computation2000
- Asynchronous secure computation1993
- Completeness theorems for non-cryptographic fault-tolerant distributed computation1988