Trading players for efficiency in unconditional multiparty computation

Authors:
B. Prabhu;K. Srinathan;C. Pandu Rangan
Affiliations:
Department of Computer Science and Engineering, Indian Institute of Technology, Madras, Chennai, India;Department of Computer Science and Engineering, Indian Institute of Technology, Madras, Chennai, India;Department of Computer Science and Engineering, Indian Institute of Technology, Madras, Chennai, India
Venue:
SCN'02 Proceedings of the 3rd international conference on Security in communication networks
Year:
2002

Citing 5
Cited 4

Completeness theorems for non-cryptographic fault-tolerant distributed computation

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 Byzantine Agreement Secure Against General Adversaries

DISC '98 Proceedings of the 12th International Symposium on Distributed Computing
Efficient Multiparty Protocols Using Circuit Randomization

CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
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

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
Communication efficient perfectly secure VSS and MPC in asynchronous networks with optimal resilience

AFRICACRYPT'10 Proceedings of the Third international conference on Cryptology in Africa
Active security in multiparty computation over black-box groups

SCN'12 Proceedings of the 8th international conference on Security and Cryptography for Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we propose a new player elimination technique and use it to design an efficient protocol for unconditionally secure multiparty computation tolerating generalized adversaries. Our protocol requires broadcast of O(nL2 log(|F|) bits (broadcast is simulated using Byzantine agreement) while the non-cryptographic linear secret sharing based protocols, without player elimination, invoke Byzantine agreement sub-protocol for O(mL3 log(|F|) bits, where m is the number of multiplication gates in the arithmetic circuit, over the finite field F, that describes the functionality of the protocol and L is the size of the underlying linear secret sharing scheme tolerating the given adversary structure.