On the Knowledge Complexity of NP (1996)

Cached

Download Links

by Erez Petrank , Gábor Tardos
Venue:In 37th FOCS
Citations:10 - 3 self

Documents Related by Co-Citation

11073 Computers and Intractability: A Guide to the Theory of NP-Completeness – M R Garey, D S Johnson - 1979
1058 The knowledge complexity of interactive proof systems – Shafi Goldwasser, Silvio Micali, Charles Rackoff - 1985
309 Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes – L Babai, S Moran - 1988
381 Proofs that Yield Nothing but Their Validity or All Languages in NP Have Zero-Knowledge Proof Systems – Oded Goldreich , Silvio Micali, et al. - 1991
734 Pseudo-Random Generation from One-Way Functions – Johan Håstad, Russell Impagliazzo, Leonid A. Levin, Michael Luby - 1988
1200 Probabilistic Encryption – S Goldwasser, S Micali - 1984
520 Theory and Applications of Trapdoor Functions – A C Yao - 1982
526 How to play any mental game or a completeness theorem for protocols with honest majority – O Goldreich, S Micali, A Widgerson
548 Protocols for secure computations – A C Yao - 1982