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: 2002
• Where: FOCS
• Authors: Oded Goldreich
• Keywords: FOCS 2002, Reasonable Complexity Assumptions, Theoretical Computer Science, Zero-knowledge Proofs