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(nL 2 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(mL 3 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.
This work was supported by Defence Research and Development Organization, India under project CSE01-02044DRDOHODX.
Financial support from Infosys Technologies Limited, India is acknowledged.
Throughout the paper we work only with maximal basis of the adversary structure.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
D. Beaver. Efficient multiparty protocols using circuit randomization. In CRYPTO’ 91, volume 576 of LNCS, pages 420–432, 1991.
M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness theorems for non-cryptographic fault-tolerant distributed computation. In 20th ACM STOC, pages 1–10, 1988.
R. Cramer, I. Damgard, and U. Maurer. Efficient general secure multiparty computation from any linear secret sharing scheme. In EUROCRYPT’00, volume 1807 of LNCS, 2000.
M. Fitzi and U. Maurer. Efficient byzantine agreement secure against general adversaries. In DISC’ 98, volume 1499 of LNCS, pages 134–148, 1998.
M. Hirt and U. Maurer. Player simulation and general adversary structures in perfect multiparty computation. Journal of Cryptology, 13(1):31–60, April 2000. Preliminary version appeared in 16th ACM PODC, pages 25-34, 1997.
M. Hirt and U. Maurer. Robustness for free in unconditional multi-party computation. In CRYPTO’ 01, volume 2139 of LNCS, 2001.
M. Hirt, U. Maurer, and B. Przydatek. Efficient multi-party computation. In ASIACRYPT’00, volume 1976 of LNCS, 2000.
M. Karchmer and A. Wigderson. On span programs. In 8th IEEE Structure in Complexity Theory, pages 102–111, 1993.
T. Rabin and M. Ben-Or. Verifiable secret sharing and multiparty protocols with honest majority. In 21st ACM STOC, pages 73–85, 1989.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Prabhu, B., Srinathan, K., Pandu Rangan, C. (2003). Trading Players for Efficiency in Unconditional Multiparty Computation. In: Cimato, S., Persiano, G., Galdi, C. (eds) Security in Communication Networks. SCN 2002. Lecture Notes in Computer Science, vol 2576. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36413-7_25
Download citation
DOI: https://doi.org/10.1007/3-540-36413-7_25
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00420-2
Online ISBN: 978-3-540-36413-9
eBook Packages: Springer Book Archive