CryptoDB
Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator
Authors: | |
---|---|
Download: | |
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. |
BibTeX
@misc{eprint-2005-12596, title={Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator}, booktitle={IACR Eprint archive}, keywords={cryptographic protocols /}, url={http://eprint.iacr.org/2005/262}, note={An abridged version of this paper appears in the proceedings of Crypto 2005. yuvali@cs.technion.ac.il 13005 received 10 Aug 2005}, author={Ivan Damgård and Yuval Ishai}, year=2005 }