STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Completeness theorems for non-cryptographic fault-tolerant distributed computation
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Multiparty unconditionally secure protocols
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Optimal algorithms for Byzantine agreement
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Non-cryptographic fault-tolerant computing in constant number of rounds of interaction
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Modular construction of nearly optimal Byzantine agreement protocols
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Verifiable secret sharing and multiparty protocols with honest majority
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
The round complexity of secure protocols
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
How to withstand mobile virus attacks (extended abstract)
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
Message-optimal protocols for byzantine agreement (extended abstract)
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
Communication complexity of secure computation (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Bounds on information exchange for Byzantine agreement
Journal of the ACM (JACM)
Simplified VSS and fast-track multiparty computations with applications to threshold cryptography
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Reaching Agreement in the Presence of Faults
Journal of the ACM (JACM)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Communications of the ACM
Cryptographic Computation: Secure Faut-Tolerant Protocols and the Public-Key Model
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
Security with Low Communication Overhead
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Efficient Multiparty Protocols Using Circuit Randomization
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Maintaining Security in the Presence of Transient Faults
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
Trading Correctness for Privacy in Unconditional Multi-Party Computation (Extended Abstract)
CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
Protocols for secure computations
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Towards optimal distributed consensus
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Efficient multiparty computations secure against an adaptive adversary
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
General secure multi-party computation from any linear secret-sharing scheme
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Asynchronous Perfectly Secure Computation Tolerating Generalized Adversaries
ACISP '02 Proceedings of the 7th Australian Conference on Information Security and Privacy
ESORICS '02 Proceedings of the 7th European Symposium on Research in Computer Security
Multiparty Computation from Threshold Homomorphic Encryption
EUROCRYPT '01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
Asynchronous Unconditionally Secure Computation: An Efficiency Improvement
INDOCRYPT '02 Proceedings of the Third International Conference on Cryptology: Progress in Cryptology
Mix and Match: Secure Function Evaluation via Ciphertexts
ASIACRYPT '00 Proceedings of the 6th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Informatics - 10 Years Back. 10 Years Ahead.
An Unconditionally Secure Protocol for Multi-Party Set Intersection
ACNS '07 Proceedings of the 5th international conference on Applied Cryptography and Network Security
Scalable Multiparty Computation with Nearly Optimal Work and Resilience
CRYPTO 2008 Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology
Counting Method for Multi-party Computation over Non-abelian Groups
CANS '08 Proceedings of the 7th International Conference on Cryptology and Network Security
Graph Design for Secure Multiparty Computation over Non-Abelian Groups
ASIACRYPT '08 Proceedings of the 14th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Realistic Failures in Secure Multi-party Computation
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
Multi-Party Computation with Omnipresent Adversary
Irvine Proceedings of the 12th International Conference on Practice and Theory in Public Key Cryptography: PKC '09
Efficient statistical asynchronous verifiable secret sharing with optimal resilience
ICITS'09 Proceedings of the 4th international conference on Information theoretic security
Secure message transmission in asynchronous networks
Journal of Parallel and Distributed Computing
Communication optimal multi-valued asynchronous byzantine agreement with optimal resilience
ICITS'11 Proceedings of the 5th international conference on Information theoretic security
Perfectly-secure multiplication for any t n/3
CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
ASIACRYPT'05 Proceedings of the 11th international conference on Theory and Application of Cryptology and Information Security
Multi-party computation with conversion of secret sharing
Designs, Codes and Cryptography
TrustedPals: secure multiparty computation implemented with smart cards
ESORICS'06 Proceedings of the 11th European conference on Research in Computer Security
Perfectly secure multiparty computation and the computational overhead of cryptography
EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
Robust multiparty computation with linear communication complexity
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
Scalable secure multiparty computation
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
Efficient multi-party computation with dispute control
TCC'06 Proceedings of the Third conference on Theory of Cryptography
Error-free multi-valued broadcast and byzantine agreement with optimal communication complexity
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
Active security in multiparty computation over black-box groups
SCN'12 Proceedings of the 8th international conference on Security and Cryptography for Networks
| Hi-index | 0.00 |
Since the introduction of secure multi-party computation, all proposed protocols that provide security against cheating players suffer from very high communication complexities. The most efficient unconditionally secure protocols among n players, tolerating cheating by up to t n/3 of them, require communicating O(n6) field elements for each multiplication of two elements, even if only one player cheats. In this paper, we propose a perfectly secure multi-party protocol which requires communicating O(n3) field elements per multiplication. In this protocol, the number of invocations of the broadcast primitive is independent of the size of the circuit to be computed. The proposed techniques are generic and apply to other protocols for robust distributed computations. Furthermore, we show that a sub-protocol proposed in [GRR98] for improving the efficiency of unconditionally secure multi-party computation is insecure.