Abstract
Consider a set of n players who wish to compute the value of a commonly agreed multi-variate function on their local inputs, whilst keeping their local inputs as private as possible even when a non-trivial subset of players collude and behave maliciously. This is the problem of secure multiparty computation. In this work, we present an effcient protocol for asynchronous secure computation tolerating a computationally unbounded Byzantine adversary that corrupts up to t < n 4 players.
This work was supported by Defence Research and Development Organization, India under project CSE01-02044DRDOHODX
Financial support from Infosys Technologies Limited, India is acknowledged.
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. Effcient multiparty protocols using circuit randomization. In CRYPTO’ 91, vol. 576 of LNCS, pp. 420–432. Springer-Verlag, 1991.
M. Ben-Or, R. Canetti, and O. Goldreich. Asynchronous secure computations. In 25th ACM STOC, pp. 52–61, 1993.
M. Ben-Or, B. Kelmer, and T. Rabin. Asynchronous secure computation with optimal resilience. In 13th ACM PODC, pp. 183–192, 1994.
R. Canetti and T. Rabin. Optimal asynchronous byzantine agreement. In 25th ACM STOC, pp. 42–51, 1993.
R. Gennaro, M.O. Rabin, and T. Rabin. Simplified VSS and fast-track multiparty computations with applications to threshold cryptography. In 17th ACM PODC, pp. 101–111, 1998.
M. Hirt and U. Maurer. Robustness for free in unconditional multi-party computation. In CRYPTO’01, vol. 2139 of LNCS, pp. 101–118. Springer-Verlag, 2001.
M. Hirt, U. Maurer, and B. Przydatek. Effcient multi-party computation. In ASIACRYPT 2000, vol. 1976 of LNCS, pp. 143–161. Springer-Verlag, 2000.
A. Shamir. How to share a secret. Communications of the ACM, 22:612–613, 1979.
K. Srinathan and C. Pandu Rangan. Effcient asynchronous secure multiparty distributed computation. In INDOCRYPT’00, vol. 1977 of LNCS, pp. 117–130. Springer-Verlag, 2000.
A.C. Yao. Protocols for secure computations. In 23rd IEEE FOCS, pp. 160–164, 1982.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Prabhu, B., Srinathan, K., Rangan, C.P. (2002). Asynchronous Unconditionally Secure Computation: An Efficiency Improvement. In: Menezes, A., Sarkar, P. (eds) Progress in Cryptology — INDOCRYPT 2002. INDOCRYPT 2002. Lecture Notes in Computer Science, vol 2551. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36231-2_9
Download citation
DOI: https://doi.org/10.1007/3-540-36231-2_9
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00263-5
Online ISBN: 978-3-540-36231-9
eBook Packages: Springer Book Archive