An Unconditional Study of Computational Zero Knowledge

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:

• Type: Journal
• Year: 2006
• Where: ECCC
• Authors: Salil P. Vadhan
• Keywords: ECCC 2006, General Theorems, One-way Functions, Zero Knowledge Proofs