Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

13

ECCC
2006

favoriteEmaildiscussreport

96views more ECCC 2006»

An Unconditional Study of Computational Zero Knowledge

13 years 4 months ago

An Unconditional Study of Computational Zero Knowledge

Download people.seas.harvard.edu

We prove a number of general theorems about ZK, the class of problems possessing (computational) zero knowledge proofs. Our results are unconditional, in contrast to most previous works on ZK which rely on the assumption that one-way functions exist. We establish several new characterizations of ZK, and use these characterizations to prove results such as:

Salil P. Vadhan

Real-time Traffic

ECCC 2006 | General Theorems | One-way Functions | Zero Knowledge Proofs |

claim paper

Related Content

» Unconditional Characterizations of Noninteractive ZeroKnowledge

» Zero Knowledge and Soundness Are Symmetric

» Adaptive ZeroKnowledge Proofs and Adaptively Secure Oblivious Transfer

» OneWay Functions Hard on Average Problems and Statistical ZeroKnowledge Proofs

» A Complete Problem for Statistical Zero Knowledge

» Adaptive Security of Concurrent NonMalleable ZeroKnowledge

» Adiabatic quantum state generation and statistical zero knowledge

» Efficient ZeroKnowledge Authentication Based on a Linear Algebra Problem MinRank

» LeakageResilient Zero Knowledge

Post Info
More Details (n/a)

Added	12 Dec 2010
Updated	12 Dec 2010
Type	Journal
Year	2006
Where	ECCC
Authors	Salil P. Vadhan

Comments (0)