• DOI:10.1007/3-540-48910-X_22
Corpus ID: 1182874

Efficient Multiparty Computations Secure Against an Adaptive Adversary

@inproceedings{Cramer1999EfficientMC,
  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},
  booktitle={EUROCRYPT},
  year={1999}
}

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

View via Publisher

link.springer.com

Save to Library

Create Alert

Cite

Launch Research Feed