Robust Multiparty Computation with Linear Communication Complexity
- 1 January 2006
- book chapter
- Published by Springer Nature
- p. 463-482
Abstract
No abstract availableKeywords
This publication has 28 references indexed in Scilit:
- Efficient Multi-party Computation with Dispute Control2006
- Security with Low Communication Overhead2001
- Efficient Multiparty Protocols Using Circuit Randomization2001
- Multiparty Computation from Threshold Homomorphic Encryption2001
- General Secure Multi-party Computation from any Linear Secret-Sharing Scheme2000
- On the complexity of verifiable secret sharing and multiparty computation2000
- Efficient Multiparty Computations Secure Against an Adaptive Adversary1999
- 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 interaction1989
- Multiparty Computations Ensuring Privacy of Each Party’s Input and Correctness of the Result1988