Cryptology ePrint Archive: Report 2005/262

Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator

Ivan Damg{\aa}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.

Category / Keywords: cryptographic protocols /

Publication Info: An abridged version of this paper appears in the proceedings of Crypto 2005.

Date: received 10 Aug 2005

Contact author: yuvali at cs technion ac il

Available formats: Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation

Version: 20050811:072449 (All versions of this report)

Discussion forum: Show discussion | Start new discussion