Welcome to the resource topic for 2005/262
Title:
Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator
Authors: Ivan Damgård, 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.
ePrint: https://eprint.iacr.org/2005/262
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .