2 search results - page 1 / 1 » On Diophantine Complexity and Statistical Zero-Knowledge Arg... |
ASIACRYPT
2003
Springer
13 years 10 months ago
2003
Springer
EUROCRYPT
2007
Springer
13 years 11 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...