Advertisement

Efficient Multiparty Computations Secure Against an Adaptive Adversary

  • Ronald Cramer
  • Ivan Damgård
  • Stefan Dziembowski
  • Martin Hirt
  • Tal Rabin
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1592)

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.

Keywords

Secret Sharing Broadcast Channel Adversary Structure Static Adversary Private Channel 
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

  1. [Bea91]
    D. Beaver. Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority. Journal of Cryptology, 4:75–122, 1991.zbMATHCrossRefGoogle Scholar
  2. [BGW88]
    M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness theorems for noncryptographic fault-tolerant distributed computations. In 20th STOC, pp. 1–10. ACM, 1988.Google Scholar
  3. [BH92]
    D. Beaver and S. Haber. Cryptographic protocols provably secure against dynamic adversaries. Eurocrypt’ 92, pp. 307–323. Springer LNCS 658, 1992.Google Scholar
  4. [Can98]
    R. Canetti. Security and composition of multiparty cryptographic protocols. Manuscript, to appear, 1998.Google Scholar
  5. [CCD88]
    D. Chaum, C. Crepeau, and I. Damgård. Multiparty unconditionally secure protocols. In 20th STOC, pp. 11–19. ACM, 1988.Google Scholar
  6. [CGMA85]
    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.Google Scholar
  7. [CDM99]
    R. Cramer, I. Damgård, and U. Maurer. General secure multi-party computation from any linear secret-sharing scheme. Manuscript, 1999.Google Scholar
  8. [CFGN96]
    Ran Canetti, Uri Feige, Oded Goldreich, and Moni Naor. Adaptively secure multi-party computation. In 28th STOC, pp. 639–648. ACM, 1996.Google Scholar
  9. [FM88]
    P. Feldman and S. Micali. An optimal algorithm for synchronous Byzantine agreement. In 20th STOC, pp. 148–161. ACM, 1988.Google Scholar
  10. [GL90]
    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.Google Scholar
  11. [GMW87]
    O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game. In 19th STOC, pp. 218–229. ACM, 1987.Google Scholar
  12. [GRR98]
    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.Google Scholar
  13. [HM97]
    M. Hirt and U. Maurer. Complete characterization of adversaries tolerable in general multiparty computations. In 16th PODC, pp. 25–34. ACM, 1998.Google Scholar
  14. [KW93]
    M. Karchmer and A. Wigderson. On span programs. In Proc. of Structure in Complexity, pp. 383–395, 1993.Google Scholar
  15. [MR91]
    S. Micali and P. Rogaway. Secure computation. Crypto’ 91, pp. 392–404. Springer LNCS 576, 1991.Google Scholar
  16. [MR98]
    S. Micali and P. Rogaway. Secure computation: The information theoretic case. Manuscript, to appear, 1998.Google Scholar
  17. [Rab94]
    T. Rabin. Robust sharing of secrets when the dealer is honest or faulty. Journal of the ACM, 41(6):1089–1109, 1994.CrossRefMathSciNetGoogle Scholar
  18. [RB89]
    T. Rabin and M. Ben-Or. Verifiable secret sharing and multiparty protocols with honest majority. In 21st STOC, pp. 73–85. ACM, 1989.Google Scholar
  19. [SS98]
    A. Smith and A. Stiglic. Multiparty computations unconditionally secure against Q 2 adversary structures. Manuscript, 1998.Google Scholar
  20. [Yao82]
    A.C. Yao. Protocols for secure computations. In 23rd FOCS, pp. 160–164. IEEE, 1982.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Ronald Cramer
    • 1
  • Ivan Damgård
    • 2
  • Stefan Dziembowski
    • 2
  • Martin Hirt
    • 1
  • Tal Rabin
    • 3
  1. 1.ETHZurichSwitzerland
  2. 2.Aarhus University, BRICSSwitzerland
  3. 3.IBM T.J.Watson Research CenterSwitzerland

Personalised recommendations