Lower Bounds for Non-Black-Box Zero Knowledge

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:

• Type: Conference
• Year: 2003
• Where: FOCS
• Authors: Boaz Barak, Yehuda Lindell, Salil P. Vadhan
• Keywords: FOCS 2003, Reasonable Complexity Assumptions, Theoretical Computer Science, Zero-knowledge Proofs