Distributed Computing
Private coins versus public coins in interactive proof systems
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
The knowledge complexity of interactive proof-systems
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Knowledge and common knowledge in a Byzantine environment I: crash failures
Proceedings of the 1986 Conference on Theoretical aspects of reasoning about knowledge
Foundations of knowledge for distributed systems
Proceedings of the 1986 Conference on Theoretical aspects of reasoning about knowledge
The logic of distributed protocols
Proceedings of the 1986 Conference on Theoretical aspects of reasoning about knowledge
The complexity of perfect zero-knowledge
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Zero knowledge proofs of identity
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
A knowledge-theoretic analysis of atomic commitment protocols
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Substituting for real time and common knowledge in asynchronous distributed systems
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
A formal model of knowledge, action, and communication in distributed systems: preliminary report
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
Reasoning about Knowledge and Probability
Proceedings of the 2nd Conference on Theoretical Aspects of Reasoning about Knowledge
Distributed Processes and the Logic of Knowledge
Proceedings of the Conference on Logic of Programs
Proceedings of the 2nd Conference on Theoretical Aspects of Reasoning about Knowledge
Knowledge and common knowledge in a distributed environment
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Knowledge, probability, and adversaries
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
SOSP '89 Proceedings of the twelfth ACM symposium on Operating systems principles
ACM Transactions on Computer Systems (TOCS)
Knowledge, probability, and adversaries
Journal of the ACM (JACM)
Reasoning about knowledge and probability
Journal of the ACM (JACM)
On the relationship between strand spaces and multi-agent systems
CCS '01 Proceedings of the 8th ACM conference on Computer and Communications Security
On the relationship between strand spaces and multi-agent systems
ACM Transactions on Information and System Security (TISSEC)
TARK '94 Proceedings of the 5th conference on Theoretical aspects of reasoning about knowledge
TARK '88 Proceedings of the 2nd conference on Theoretical aspects of reasoning about knowledge
Reasoning about knowledge and probability
TARK '88 Proceedings of the 2nd conference on Theoretical aspects of reasoning about knowledge
An epistemic characterization of zero knowledge
Proceedings of the 12th Conference on Theoretical Aspects of Rationality and Knowledge
A logic for reasoning about evidence
Journal of Artificial Intelligence Research
Generalized modal satisfiability
Journal of Computer and System Sciences
A universally defined undecidable unimodal logic
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Generalized modal satisfiability
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
A logic for reasoning about evidence
UAI'03 Proceedings of the Nineteenth conference on Uncertainty in Artificial Intelligence
Combining epistemic logic and hennessy-milner logic
Logic and Program Semantics
Hi-index | 0.00 |
While the intuition underlying a zero knowledge proof system [GMR85] is that no “knowledge” is leaked by the prover to the verifier, researchers are just beginning to analyze such proof systems in terms of formal notions of knowledge. In this paper, we show how interactive proof systems motivate a new notion of practical knowledge, and we capture the definition of an interactive proof system in terms of practical knowledge. Using this notion of knowledge, we formally capture and prove the intuition that the prover does not leak any knowledge of any fact (other than the fact being proven) during a zero knowledge proof. We extend this result to show that the prover does not leak any knowledge of how to compute any information (such as the factorization of a number) during a zero knowledge proof. Finally, we define the notion of a weak interactive proof in which the prover is limited to probabilistic, polynomial-time computations, and we prove analogous security results for such proof systems. We show that, in a precise sense, any nontrivial weak interactive proof must be a proof about the prover's knowledge, and show that, under natural conditions, the notions of interactive proofs of knowledge defined in [TW87] and [FFS87] are instances of weak interactive proofs.