Paper 2005/262
Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator
Ivan Damgård and Yuval Ishai
Abstract
We present a constant-round protocol for general secure multiparty computation which makes a {\em black-box} use of a pseudorandom generator. In particular, the protocol does not require expensive zero-knowledge proofs and its communication complexity does not depend on the computational complexity of the underlying cryptographic primitive. Our protocol withstands an active, adaptive adversary corrupting a minority of the parties. Previous constant-round protocols of this type were only known in the semi-honest model or for restricted classes of functionlities.
Metadata
- Available format(s)
-
PDF
PS
- Category
- Cryptographic protocols
- Publication info
- Published elsewhere. An abridged version of this paper appears in the proceedings of Crypto 2005.
- Contact author(s)
- yuvali @ cs technion ac il
- History
- 2005-08-11: received
- Short URL
- https://ia.cr/2005/262
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2005/262,
author = {Ivan Damgård and Yuval Ishai},
title = {Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator},
howpublished = {Cryptology {ePrint} Archive, Paper 2005/262},
year = {2005},
url = {https://eprint.iacr.org/2005/262}
}
