Knowledge on the average—perfect, statistical and logarithmic

Authors:
William Aiello;Mihir Bellare;Ramarathnam Venkatesan
Affiliations:
Math and Cryptography Research Group, Bellcore, 445 South St. Morristown, NJ;IBM T.J. Watson Research Center, PO Box 704, Yorktown Heights, NY;Math and Cryptography Research Group, Bellcore, 445 South St. Morristown, NJ
Venue:
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Year:
1995

Trading group theory for randomness

STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Arthur-Merlin games: a randomized proof system, and a hierarchy of complexity class

Journal of Computer and System Sciences - 17th Annual ACM Symposium in the Theory of Computing, May 6-8, 1985
The knowledge complexity of interactive proof systems

SIAM Journal on Computing
Statistical zero-knowledge languages can be recognized in two rounds

Journal of Computer and System Sciences
Quantifying knowledge complexity

SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Making zero-knowledge provers efficient

STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Two prover protocols: low error at affordable rates

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Computational complexity and knowledge complexity (extended abstract)

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
The complexity of approximate counting

STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
On monotone formula closure of SZK

SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science

Hi-index	0.00