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...
TCC
2007
Springer
92views Cryptology» more  TCC 2007»
14 years 5 months ago
One-Way Permutations, Interactive Hashing and Statistically Hiding Commitments
We present a lower bound on the round complexity of a natural class of black-box constructions of statistically hiding commitments from one-way permutations. This implies a Ω( n ...
Hoeteck Wee
ASIACRYPT
2009
Springer
14 years 6 months ago
On Black-Box Constructions of Predicate Encryption from Trapdoor Permutations
Abstract. Predicate encryption is a recent generalization of identitybased encryption (IBE), broadcast encryption, attribute-based encryption, and more. A natural question is wheth...
Jonathan Katz, Arkady Yerukhimovich