reasonable complexity assumptions

FOCS
2002
IEEE

110views Theoretical Computer Science» more FOCS 2002»

14 years 10 days ago

We show new lower bounds and impossibility results for general (possibly non-black-box) zero-knowledge proofs and arguments. Our main results are that, under reasonable complexity...

Oded Goldreich

claim paper

Read More »

click to vote

FOCS
2003
IEEE

100views Theoretical Computer Science» more FOCS 2003»

Lower Bounds for Non-Black-Box Zero Knowledge

14 years 21 days ago

Download www.cs.princeton.edu

We show new lower bounds and impossibility results for general (possibly non-black-box) zero-knowledge proofs and arguments. Our main results are that, under reasonable complexity...

Boaz Barak, Yehuda Lindell, Salil P. Vadhan

claim paper

Read More »

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers