black-box constructions

28

LATINCRYPT
2010

116views Cryptology» more LATINCRYPT 2010»

On the Round Complexity of Zero-Knowledge Proofs Based on One-Way Permutations

13 years 9 months ago

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...

claim paper

Read More »

22

click to vote

TCC
2007
Springer

92views Cryptology» more TCC 2007»

One-Way Permutations, Interactive Hashing and Statistically Hiding Commitments

14 years 5 months ago

Download www.iacr.org

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

claim paper

Read More »

32

click to vote

ASIACRYPT
2009
Springer

163views Cryptology» more ASIACRYPT 2009»

On Black-Box Constructions of Predicate Encryption from Trapdoor Permutations

14 years 5 months ago

Download www.cs.umd.edu

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

claim paper

Read More »

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers