Zero-Knowledge

13 years 9 months ago

Download www.math.ias.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:

Oded Goldreich

Real-time Traffic

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

claim paper

Related Content

» ZeroKnowledge Proofs for Finite Field Arithmetic or Can ZeroKnowledge be for Free

» Local zero knowledge

» An epistemic characterization of zero knowledge

» Zero knowledge with efficient provers

» A Note on the RoundComplexity of Concurrent ZeroKnowledge

» Resettable Zero Knowledge in the Bare PublicKey Model under Standard Assumption

» Impossibility and Feasibility Results for Zero Knowledge with Public Keys

» A DolevYao Model for Zero Knowledge

» An Unconditional Study of Computational Zero Knowledge

» ConstantRound Resettable Zero Knowledge with Concurrent Soundness in the Bare PublicKey Mo...

Post Info
More Details (n/a)

Added	14 Jul 2010
Updated	14 Jul 2010
Type	Conference
Year	2002
Where	FOCS
Authors	Oded Goldreich

Comments (0)

Sciweavers

Zero-Knowledge

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

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers