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
Verifiable secret sharing and multiparty protocols with honest majority
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Efficient Multiparty Protocols Using Circuit Randomization
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Optimally efficient multi-valued byzantine agreement
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Protocols for secure computations
SFCS '82 Proceedings of the 23rd 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
Scalable and unconditionally secure multiparty computation
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
Perfectly-secure MPC with linear communication complexity
TCC'08 Proceedings of the 5th conference on Theory of cryptography
Efficient multi-party computation with dispute control
TCC'06 Proceedings of the Third conference on Theory of Cryptography
Round Efficient Unconditionally Secure MPC and Multiparty Set Intersection with Optimal Resilience
INDOCRYPT '09 Proceedings of the 10th International Conference on Cryptology in India: Progress in Cryptology
Identifying cheaters without an honest majority
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
Hi-index | 0.00 |
In this paper, we propose a round efficient unconditionally secure multiparty computation (UMPC) protocol in information theoretic model with n 2t players, in the absence of any physical broadcast channel. Our protocol communicates ${\cal O}(n^4)$ field elements per multiplication and requires ${\cal O}(n \log(n) + {\cal D})$ rounds, even if up to t players are under the control of an active adversary having unbounded computing power , where ${\cal D}$ denotes the multiplicative depth of the circuit representing the function to be computed securely. In the absence of a physical broadcast channel and with n 2t players, the best known UMPC protocol with minimum number of rounds, requires ${\cal O}(n^2{\cal D})$ rounds and communicates ${\cal O}(n^6)$ field elements per multiplication. On the other hand, the best known UMPC protocol with minimum communication complexity requires communication overhead of ${\cal O}(n^2)$ field elements per multiplication, but has a round complexity of ${\cal O}(n^3 +{\cal D})$ rounds. Hence our UMPC protocol is the most round efficient protocol so far and ranks second according to communication complexity.