Article

Efficient multiparty computations secure against an adaptive adversary

Authors:

Stefan Dziembowski,

Tal RabinAuthors Info & Claims

EUROCRYPT'99: Proceedings of the 17th international conference on Theory and application of cryptographic techniques

Pages 311 - 326

Published: 02 May 1999 Publication History

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²-adversaries.

References

[1]

D. Beaver. Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority. Journal of Cryptology, 4:75-122, 1991.

Digital Library

[2]

M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness theorems for noncryptographic fault-tolerant distributed computations. In 20th STOC, pp. 1-10. ACM, 1988.

Digital Library

[3]

D. Beaver and S. Haber. Cryptographic protocols provably secure against dynamic adversaries. Eurocrypt '92, pp. 307-323. Springer LNCS 658, 1992.

[4]

R. Canetti. Security and composition of multiparty cryptographic protocols. Manuscript, to appear, 1998.

[5]

D. Chaum, C. Crepeau, and I. Damgård. Multiparty unconditionally secure protocols. In 20th STOC, pp. 11-19. ACM, 1988.

Digital Library

[6]

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.

Digital Library

[7]

R. Cramer, I. Damgård, and U. Maurer. General secure multi-party computation from any linear secret-sharing scheme. Manuscript, 1999.

[8]

Ran Canetti, Uri Feige, Oded Goldreich, andMoni Naor. Adaptively secure multi-party computation. In 28th STOC, pp. 639-648. ACM, 1996.

Digital Library

[9]

P. Feldman and S. Micali. An optimal algorithm for synchronous Byzantine agreement. In 20th STOC, pp. 148-161. ACM, 1988.

Digital Library

[10]

S. Goldwasser and L. Levin. Fair computation of general functions in presence of immoral majority. Crypto '90, pp. 77-93. Springer LNCS 537, 1990.

Digital Library

[11]

O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game. In 19th STOC, pp. 218-229. ACM, 1987.

Digital Library

[12]

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.

Digital Library

[13]

M. Hirt and U. Maurer. Complete characterization of adversaries tolerable in general multiparty computations. In 16th PODC, pp. 25-34. ACM, 1998.

Digital Library

[14]

M. Karchmer and A. Wigderson. On span programs. In Proc. of Structure in Complexity, pp. 383-395, 1993.

[15]

S. Micali and P. Rogaway. Secure computation. Crypto '91, pp. 392-404. Springer LNCS 576, 1991.

Digital Library

[16]

S. Micali and P. Rogaway. Secure computation: The information theoretic case. Manuscript, to appear, 1998.

[17]

T. Rabin. Robust sharing of secrets when the dealer is honest or faulty. Journal of the ACM, 41(6):1089-1109, 1994.

Digital Library

[18]

T. Rabin and M. Ben-Or. Verifiable secret sharing and multiparty protocols with honest majority. In 21st STOC, pp. 73-85. ACM, 1989.

Digital Library

[19]

A. Smith and A. Stiglic. Multiparty computations unconditionally secure against Q ² adversary structures. Manuscript, 1998.

[20]

A.C. Yao. Protocols for secure computations. In 23rd FOCS, pp. 160-164. IEEE, 1982.

Digital Library

Cited By

Deligios GKonring ALiu-Zhang CNarayanan V(2024)Statistical Layered MPCTheory of Cryptography10.1007/978-3-031-78023-3_12(362-394)Online publication date: 2-Dec-2024
https://dl.acm.org/doi/10.1007/978-3-031-78023-3_12
Bangalore LChoudhury AGarimella GHansdah RKrishnaswamy DVaidya N(2019)Round efficient computationally secure multi-party computation revisitedProceedings of the 20th International Conference on Distributed Computing and Networking10.1145/3288599.3288600(292-301)Online publication date: 4-Jan-2019
https://dl.acm.org/doi/10.1145/3288599.3288600
Andrychowicz MDziembowski SFaust S(2016)Circuit Compilers with $$O1/\log n$$O1/logn Leakage RateProceedings, Part II, of the 35th Annual International Conference on Advances in Cryptology --- EUROCRYPT 2016 - Volume 966610.5555/3081738.3081759(586-615)Online publication date: 8-May-2016
https://dl.acm.org/doi/10.5555/3081738.3081759
Show More Cited By

Recommendations

Efficient Secure Multiparty Computation with Identifiable Abort
Proceedings, Part I, of the 14th International Conference on Theory of Cryptography - Volume 9985

We study secure multiparty computation MPC in the dishonest majority setting providing security with identifiable abort, where if the protocol aborts, the honest parties can agree upon the identity of a corrupt party. All known constructions that ...
Two-Round Adaptively Secure Multiparty Computation from Standard Assumptions
Theory of Cryptography
Abstract
We present the first two-round multiparty computation (MPC) protocols secure against malicious adaptive corruption in the common reference string (CRS) model, based on DDH, LWE, or QR. Prior two-round adaptively secure protocols were known only in ...
Round-efficient perfectly secure message transmission scheme against general adversary

In the model of Perfectly Secure Message Transmission Schemes (PSMTs), there are n channels between a sender and a receiver, and they share no key. An infinitely powerful adversary A can corrupt (observe and forge) the messages sent through some ...

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings

EUROCRYPT'99: Proceedings of the 17th international conference on Theory and application of cryptographic techniques

May 1999

475 pages

ISBN:3540658890

Editor:
Jacques Stern
Ecole Normale Supérieure, Paris 05, France

Sponsors

IACR: International Association for Cryptologic Research

In-Cooperation

Group of Cryptology within the Union of Czech Mathematicians and Physicists

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 02 May 1999

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

58
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 16 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Deligios GKonring ALiu-Zhang CNarayanan V(2024)Statistical Layered MPCTheory of Cryptography10.1007/978-3-031-78023-3_12(362-394)Online publication date: 2-Dec-2024
https://dl.acm.org/doi/10.1007/978-3-031-78023-3_12
Bangalore LChoudhury AGarimella GHansdah RKrishnaswamy DVaidya N(2019)Round efficient computationally secure multi-party computation revisitedProceedings of the 20th International Conference on Distributed Computing and Networking10.1145/3288599.3288600(292-301)Online publication date: 4-Jan-2019
https://dl.acm.org/doi/10.1145/3288599.3288600
Andrychowicz MDziembowski SFaust S(2016)Circuit Compilers with $$O1/\log n$$O1/logn Leakage RateProceedings, Part II, of the 35th Annual International Conference on Advances in Cryptology --- EUROCRYPT 2016 - Volume 966610.5555/3081738.3081759(586-615)Online publication date: 8-May-2016
https://dl.acm.org/doi/10.5555/3081738.3081759
(2016)Born and raised distributivelyTheoretical Computer Science10.1016/j.tcs.2016.02.031645:C(1-24)Online publication date: 13-Sep-2016
https://dl.acm.org/doi/10.1016/j.tcs.2016.02.031
Blanton MAguiar E(2016)Private and oblivious set and multiset operationsInternational Journal of Information Security10.1007/s10207-015-0301-115:5(493-518)Online publication date: 1-Oct-2016
https://dl.acm.org/doi/10.1007/s10207-015-0301-1
Baum COrsini EScholl P(2016)Efficient Secure Multiparty Computation with Identifiable AbortProceedings, Part I, of the 14th International Conference on Theory of Cryptography - Volume 998510.1007/978-3-662-53641-4_18(461-490)Online publication date: 31-Oct-2016
https://dl.acm.org/doi/10.1007/978-3-662-53641-4_18
Ishai YKushilevitz EPrabhakaran MSahai AYu C(2016)Secure Protocol TransformationsProceedings, Part II, of the 36th Annual International Cryptology Conference on Advances in Cryptology --- CRYPTO 2016 - Volume 981510.1007/978-3-662-53008-5_15(430-458)Online publication date: 14-Aug-2016
https://dl.acm.org/doi/10.1007/978-3-662-53008-5_15
Babenko LBurtyka PMakarevich OTrepacheva AMakarevich OPoet RElçi AGaur MOrgun MBabenko LFerdous SHo ALaxmi VPieprzyk J(2015)The general model of secure computation systemProceedings of the 8th International Conference on Security of Information and Networks10.1145/2799979.2800006(177-184)Online publication date: 8-Sep-2015
https://dl.acm.org/doi/10.1145/2799979.2800006
Libert BJoye MYung MHalldórsson MDolev S(2014)Born and raised distributivelyProceedings of the 2014 ACM symposium on Principles of distributed computing10.1145/2611462.2611498(303-312)Online publication date: 15-Jul-2014
https://dl.acm.org/doi/10.1145/2611462.2611498
Garay JGivens COstrovsky RRaykov PHalldórsson MDolev S(2014)Fast and unconditionally secure anonymous channelProceedings of the 2014 ACM symposium on Principles of distributed computing10.1145/2611462.2611494(313-321)Online publication date: 15-Jul-2014
https://dl.acm.org/doi/10.1145/2611462.2611494
Show More Cited By

View Options

View options

Figures

Tables

Media

View Table of Conten