Knowledge and efficient computation

Authors:
Silvio Micali
Affiliations:
MIT, Cambridge, MA
Venue:
TARK '86 Proceedings of the 1986 conference on Theoretical aspects of reasoning about knowledge
Year:
1986

Citing 3
Cited 0

The knowledge complexity of interactive proof-systems

STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
The complexity of theorem-proving procedures

STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
A logic to reason about likelihood

STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We informally discuss "knowledge complexity": a measure for the amount of knowledge that can be feasibly extracted from a communication. Our measure provides an answer to the following two questions: 1) How much knowledge should be communicated for proving a theorem? 2) How to prove correctness of cryptographic protocols?