Sciweavers

ECCC
2007
91views more  ECCC 2007»
13 years 3 months ago
Which Languages Have 4-Round Zero-Knowledge Proofs?
We show that if a language L has a 4-round, black-box, computational zero-knowledge proof system with negligible soundness error, then ¯L ∈ MA. Assuming the polynomial hierarch...
Jonathan Katz