Abstract
We consider verifiable secret sharing (VSS) and multiparty computation (MPC) in the secure-channels model, where a broadcast channel is given and a non-zero error probability is allowed. In this model Rabin and Ben-Or proposed VSS and MPC protocols secure against an adversary that can corrupt any minority of the players. In this paper, we first observe that a subprotocol of theirs, known as weak secret sharing (WSS), is not secure against an adaptive adversary, contrary to what was believed earlier. We then propose new and adaptively secure protocols for WSS, VSS and MPC that are substantially more efficient than the original ones. Our protocols generalize easily to provide security against general Q 2-adversaries.
Supported by the Swiss National Science Foundation (SNF), SPP 5003-045293.
Basic Research in Computer Science, center of the Danish National Research Foundation.
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
D. Beaver. Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority. Journal of Cryptology, 4:75–122, 1991.
M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness theorems for noncryptographic fault-tolerant distributed computations. In 20th STOC, pp. 1–10. ACM, 1988.
D. Beaver and S. Haber. Cryptographic protocols provably secure against dynamic adversaries. Eurocrypt’ 92, pp. 307–323. Springer LNCS 658, 1992.
R. Canetti. Security and composition of multiparty cryptographic protocols. Manuscript, to appear, 1998.
D. Chaum, C. Crepeau, and I. Damgård. Multiparty unconditionally secure protocols. In 20th STOC, pp. 11–19. ACM, 1988.
B. Chor, S. Goldwasser, S. Micali, and B. Awerbuch. Verifiable secret sharing and achieving simultaneity in the presence of faults. In 26th FOCS, pp. 383–395. IEEE, 1985.
R. Cramer, I. Damgård, and U. Maurer. General secure multi-party computation from any linear secret-sharing scheme. Manuscript, 1999.
Ran Canetti, Uri Feige, Oded Goldreich, and Moni Naor. Adaptively secure multi-party computation. In 28th STOC, pp. 639–648. ACM, 1996.
P. Feldman and S. Micali. An optimal algorithm for synchronous Byzantine agreement. In 20th STOC, pp. 148–161. ACM, 1988.
S. Goldwasser and L. Levin. Fair computation of general functions in presence of immoral majorityFair computation of general functions in presence of immoral majority. Crypto’ 90, pp. 77–93. Springer LNCS 537, 1990.
O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game. In 19th STOC, pp. 218–229. ACM, 1987.
R. Gennaro, M. Rabin, and T Rabin. Simplified VSS and fast-track multiparty computations with applications to threshold cryptography. In 17th PODC, pp. 101–111. ACM, 1998.
M. Hirt and U. Maurer. Complete characterization of adversaries tolerable in general multiparty computations. In 16th PODC, pp. 25–34. ACM, 1998.
M. Karchmer and A. Wigderson. On span programs. In Proc. of Structure in Complexity, pp. 383–395, 1993.
S. Micali and P. Rogaway. Secure computation. Crypto’ 91, pp. 392–404. Springer LNCS 576, 1991.
S. Micali and P. Rogaway. Secure computation: The information theoretic case. Manuscript, to appear, 1998.
T. Rabin. Robust sharing of secrets when the dealer is honest or faulty. Journal of the ACM, 41(6):1089–1109, 1994.
T. Rabin and M. Ben-Or. Verifiable secret sharing and multiparty protocols with honest majority. In 21st STOC, pp. 73–85. ACM, 1989.
A. Smith and A. Stiglic. Multiparty computations unconditionally secure against Q 2 adversary structures. Manuscript, 1998.
A.C. Yao. Protocols for secure computations. In 23rd FOCS, pp. 160–164. IEEE, 1982.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cramer, R., Damgård, I., Dziembowski, S., Hirt, M., Rabin, T. (1999). Efficient Multiparty Computations Secure Against an Adaptive Adversary. In: Stern, J. (eds) Advances in Cryptology — EUROCRYPT ’99. EUROCRYPT 1999. Lecture Notes in Computer Science, vol 1592. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48910-X_22
Download citation
DOI: https://doi.org/10.1007/3-540-48910-X_22
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65889-4
Online ISBN: 978-3-540-48910-8
eBook Packages: Springer Book Archive