Efficient Multiparty Computations Secure Against an Adaptive Adversary

Ronald Cramer, Ivan Damgård, Stefan Dziembowski, Martin Hirt, and Tal Rabin

Advances in Cryptology — EUROCRYPT '99, Lecture Notes in Computer Science, Springer-Verlag, vol. 1592, pp. 311–326, May 1999.

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 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 $Q^2$-adversaries.

BibTeX Citation

@inproceedings{CDDHR99,
    author       = {Ronald Cramer and Ivan Damgård and Stefan Dziembowski and Martin Hirt and Tal Rabin},
    title        = {Efficient Multiparty Computations Secure Against an Adaptive Adversary},
    editor       = {Jacques Stern},
    booktitle    = {Advances in Cryptology --- EUROCRYPT~'99},
    pages        = {311--326},
    series       = {Lecture Notes in Computer Science},
    volume       = {1592},
    year         = {1999},
    month        = {5},
    publisher    = {Springer-Verlag},
}