The knowledge complexity of interactive proof-systems
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
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
Non-cryptographic fault-tolerant computing in constant number of rounds of interaction
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
Modular construction of a Byzantine agreement protocol with optimal message bit complexity
Information and Computation
Asynchronous secure computation
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Non-interactive and non-malleable commitment
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
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
On the complexity of verifiable secret sharing and multiparty computation
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
Optimal Early Stopping in Distributed Consensus (Extended Abstract)
WDAG '92 Proceedings of the 6th International Workshop on Distributed Algorithms
Efficient Non-malleable Commitment Schemes
CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
Robustness for Free in Unconditional Multi-party Computation
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
On 2-Round Secure Multiparty Computation
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
How to Solve any Protocol Problem - An Efficiency Improvement
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
Multiparty Computations Ensuring Privacy of Each Party's Input and Correctness of the Result
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
Fair Computation of General Functions in Presence of Immoral Majority
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
Relations Among Notions of Security for Public-Key Encryption Schemes
CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
Multiparty Computation from Threshold Homomorphic Encryption
EUROCRYPT '01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances 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
Efficient Secure Multi-party Computation
ASIACRYPT '00 Proceedings of the 6th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Threshold Cryptosystems Based on Factoring
ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Sharing Decryption in the Context of Voting or Lotteries
FC '00 Proceedings of the 4th International Conference on Financial Cryptography
PKC '01 Proceedings of the 4th International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
Non-interactive and reusable non-malleable commitment schemes
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Universally Composable Security: A New Paradigm for Cryptographic Protocols
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Protocols for secure computations
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Public-key cryptosystems based on composite degree residuosity classes
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
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
Efficient concurrent zero-knowledge in the auxiliary string model
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Tight bounds for the multiplicative complexity of symmetric functions
Theoretical Computer Science
Scalable Multiparty Computation with Nearly Optimal Work and Resilience
CRYPTO 2008 Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology
Scalable and unconditionally secure multiparty computation
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
Concrete multiplicative complexity of symmetric functions
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Multi-party computation with conversion of secret sharing
Designs, Codes and Cryptography
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
Hi-index | 0.00 |
We give improved upper bounds on the communication complexity of optimally-resilient secure multiparty computation in the cryptographic model. We consider evaluating an n-party randomized function and show that if f can be computed by a circuit of size c, then $\mathcal{O}(cn^2\kappa)$ is an upper bound for active security with optimal resilience t n/2 and security parameter κ. This improves on the communication complexity of previous protocols by a factor of at least n. This improvement comes from the fact that in the new protocol, only $\mathcal{O}(n)$ messages (of size $\mathcal{O}(\kappa)$ each) are broadcast during the whole protocol execution, in contrast to previous protocols which require at least $\mathcal{O}(n)$ broadcasts per gate. Furthermore, we improve the upper bound on the communication complexity of passive secure multiparty computation with resilience tn from $\mathcal{O}(cn^2\kappa)$ to $\mathcal{O}(cn\kappa)$. This improvement is mainly due to a simple observation.