Lower Bounds for Non-Black-Box Zero Knowledge

13 years 9 months 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 assumptions:

Boaz Barak, Yehuda Lindell, Salil P. Vadhan

Real-time Traffic

FOCS 2003 | Reasonable Complexity Assumptions | Theoretical Computer Science | Zero-knowledge Proofs |

claim paper

» A Note on the RoundComplexity of Concurrent ZeroKnowledge

» ZeroKnowledge

» Private Coins versus Public Coins in ZeroKnowledge Proof Systems

» Responsive Round Complexity and Concurrent ZeroKnowledge

» On the ImPossibility of ArthurMerlin Witness Hiding Protocols

» Scheduling in the Dark

Post Info
More Details (n/a)

Added	04 Jul 2010
Updated	04 Jul 2010
Type	Conference
Year	2003
Where	FOCS
Authors	Boaz Barak, Yehuda Lindell, Salil P. Vadhan

Comments (0)

Sciweavers

Lower Bounds for Non-Black-Box Zero Knowledge

FOCS 2003 | Reasonable Complexity Assumptions | Theoretical Computer Science | Zero-knowledge Proofs |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers