Quantifying knowledge complexity

Authors:
Oded Goldreich;Erez Petrank
Affiliations:
-;-
Venue:
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Year:
1991

Citing 0
Cited 7

Making zero-knowledge provers efficient

STOC '92 Proceedings of the twenty-fourth 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
Knowledge on the average—perfect, statistical and logarithmic

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Concurrent zero-knowledge

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Checking Programs Discreetly: Demonstrating Result-Correctness Efficiently while Concealing it

ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Concurrent zero-knowledge

Journal of the ACM (JACM)
Intention-Disguised algorithmic trading

FC'10 Proceedings of the 14th international conference on Financial Cryptography and Data Security

Quantified Score

Hi-index	0.00

Visualization

Abstract

Several alternative ways of defining knowledge complexity are presented, and the relationships between them are explored. The discussion covers inclusion results, separation results, properties of knowledge complexity of languages in the Hint sense, and the knowledge complexity of constant round AM proofs.