Complete Characterization of Adversaries Tolerable in Secure Multi-Party Computation (Extended Abstract)

@inproceedings{Hirt1997CompleteCO,
  title={Complete Characterization of Adversaries Tolerable in Secure Multi-Party Computation (Extended Abstract)},
  author={Martin Hirt and Ueli Maurer},
  booktitle={PODC},
  year={1997}
}
The classical results in unconditional multi-party computation among a set of n players state that less than n/2 passive or Iess than n/3 active adversaries can be tolerated; assuming a broadcast channel the threshold for active adversaries is ta/2. Strictly generalizing these results we specify the set of potential y misbehaving players as an arbitrary set… CONTINUE READING