About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Conference paper
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.