Sciweavers

LATINCRYPT
2010
13 years 10 months ago
On the Round Complexity of Zero-Knowledge Proofs Based on One-Way Permutations
We consider the following problem: can we construct constant-round zero-knowledge proofs (with negligible soundness) for NP assuming only the existence of one-way permutations? We...
S. Dov Gordon, Hoeteck Wee, David Xiao, Arkady Yer...
STOC
2002
ACM
80views Algorithms» more  STOC 2002»
14 years 12 months ago
Strict polynomial-time in simulation and extraction
The notion of efficient computation is usually identified in cryptography and complexity with (strict) probabilistic polynomial time. However, until recently, in order to obtain c...
Boaz Barak, Yehuda Lindell