Efficient Multiparty Computations Secure Against an Adaptive Adversary

  title={Efficient Multiparty Computations Secure Against an Adaptive Adversary},
  author={R. Cramer and I. Damg{\aa}rd and Stefan Dziembowski and M. Hirt and T. Rabin},
  • R. Cramer, I. Damgård, +2 authors T. Rabin
  • Published in EUROCRYPT 1999
  • Computer Science
  • 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… CONTINUE READING
    215 Citations

    Topics from this paper

    Adaptively Secure Threshold Signature Scheme in the Standard Model
    • 8
    • PDF
    Robustness for Free in Unconditional Multi-party Computation
    • 80
    • PDF
    Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority
    • 76
    • PDF
    Probabilistic Verifiable Secret Sharing Tolerating Adaptive Adversary
    • 1
    General Secure Multi-party Computation from any Linear Secret-Sharing Scheme
    • 456
    • PDF
    Multi-party Computation with Hybrid Security
    • 18
    • PDF
    Hybrid-secure MPC: trading information-theoretic robustness for computational privacy
    • 15
    • PDF
    Round Efficient Unconditionally Secure MPC and Multiparty Set Intersection with Optimal Resilience
    • 9
    • Highly Influenced


    Adaptively secure multi-party computation
    • 474
    • PDF
    General Secure Multi-party Computation from any Linear Secret-Sharing Scheme
    • 456
    • PDF
    Cryptographic Protocols Provably Secure Against Dynamic Adversaries
    • 137
    • PDF
    Security and Composition of Multiparty Cryptographic Protocols
    • R. Canetti
    • Computer Science, Mathematics
    • Journal of Cryptology
    • 2000
    • 1,151
    Secure Computation (Abstract)
    • 228
    • PDF
    Robust sharing of secrets when the dealer is honest or cheating
    • 99