136
click to vote
EUROCRYPT
2007
Springer
15 years 9 months ago
2007
Springer
We give a complexity-theoretic characterization of the class of problems in NP having zero-knowledge argument systems. This characterization is symmetric in its treatment of the ze...