Lower bounds for non-black-box zero knowledge

Abstract

New lower bounds and impossibility results for general (possibly non-black-box) zero-knowledge proofs and arguments were shown. Beyond the lower bounds themselves, new differences between the power of zero-knowledge proofs versus arguments were implied. It was also implied in some cases complexity assumptions can and should be used to obtain zero-knowledge lower bounds.