Sciweavers

TCC
2007
Springer
91views Cryptology» more  TCC 2007»
13 years 11 months ago
Lower Bounds for Non-interactive Zero-Knowledge
Abstract. We establish new lower bounds and impossibility results for noninteractive zero-knowledge proofs and arguments with set-up assumptions. – For the common random string m...
Hoeteck Wee