Sciweavers

2 search results - page 1 / 1
» Constant-Round Multiparty Computation Using a Black-Box Pseu...
Sort
View
CRYPTO
2005
Springer
135views Cryptology» more  CRYPTO 2005»
15 years 2 months ago
Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator
We present a constant-round protocol for general secure multiparty computation which makes a black-box use of a pseudorandom generator. In particular, the protocol does not requir...
Ivan Damgård, Yuval Ishai
APPROX
2008
Springer
88views Algorithms» more  APPROX 2008»
14 years 11 months ago
Limitations of Hardness vs. Randomness under Uniform Reductions
We consider (uniform) reductions from computing a function f to the task of distinguishing the output of some pseudorandom generator G from uniform. Impagliazzo and Wigderson [IW]...
Dan Gutfreund, Salil P. Vadhan