International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Paper: Robustness for Free in Unconditional Multi-Party Computation

Authors:
Martin Hirt
Ueli Maurer
Download:
URL: http://eprint.iacr.org/2001/023
Search ePrint
Search Google
Abstract: We present a very efficient multi-party computation protocol unconditionally secure against an active adversary. The security is maximal, i.e., active corruption of up to $t<n/3$ of the $n$ players is tolerated. The communication complexity for securely evaluating a circuit with $m$ multiplication gates over a finite field is $\O(mn^2)$ field elements, including the communication required for simulating broadcast. This corresponds to the complexity of the best known protocols for the passive model, where the corrupted players are guaranteed not to deviate from the protocol. Even in this model, it seems to be unavoidable that for every multiplication gate every player must send a value to every other player, and hence the complexity of our protocol may well be optimal. The constant overhead factor for robustness is small and the protocol is practical.
BibTeX
@misc{eprint-2001-11435,
  title={Robustness for Free in Unconditional Multi-Party Computation},
  booktitle={IACR Eprint archive},
  keywords={cryptographic protocols / multi-party computation, optimal efficiency, unconditional security},
  url={http://eprint.iacr.org/2001/023},
  note={ hirt@inf.ethz.ch 11388 received 7 Mar 2001},
  author={Martin Hirt and Ueli Maurer},
  year=2001
}