Efficient Multiparty Computations with Dishonest Minority


  • Ronald Cramer
  • Ivan B. Damgård
  • Stefan Dziembowski
  • Martin Hirt
  • Tal Rabin




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 rst 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 Q2 adversaries.




How to Cite

Cramer, R., Damgård, I. B., Dziembowski, S., Hirt, M., & Rabin, T. (1998). Efficient Multiparty Computations with Dishonest Minority. BRICS Report Series, 5(36). https://doi.org/10.7146/brics.v5i36.19441