A Complete Quantified Epistemic Logic for Reasoning about Message Passing Systems
Computational Logic in Multi-Agent Systems
Quantified epistemic logics for reasoning about knowledge in multi-agent systems
Artificial Intelligence
Epistemic Logic for the Applied Pi Calculus
FMOODS '09/FORTE '09 Proceedings of the Joint 11th IFIP WG 6.1 International Conference FMOODS '09 and 29th IFIP WG 6.1 International Conference FORTE '09 on Formal Techniques for Distributed Systems
A symmetry reduction technique for model checking temporal-epistemic logic
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Using deductive knowledge to improve cryptographic protocol verification
MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
Rethinking about guessing attacks
Proceedings of the 6th ACM Symposium on Information, Computer and Communications Security
Logic of information flow on communication channels
DALT'10 Proceedings of the 8th international conference on Declarative agent languages and technologies VIII
An Epistemic Predicate CTL* for Finite Control π-Processes
Electronic Notes in Theoretical Computer Science (ENTCS)
Epistemic temporal logic for information flow security
Proceedings of the ACM SIGPLAN 6th Workshop on Programming Languages and Analysis for Security
Automatic verification of epistemic specifications under convergent equational theories
Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
| Hi-index | 0.01 |
The combination of first-order epistemic logic with formal cryptography offers a potentially powerful framework for security protocol verification. In this paper, cryptography is modelled using private constants and one-way computable operations, as in the Applied Pi-calculus. To give the concept of knowledge a computational justification, we propose a generalized Kripke semantics that uses permutations on the underlying domain of cryptographic messages to reflect agents' limited resources. This interpretation links the logic tightly to static equivalence, another important concept of knowledge that has recently been examined in the security protocol literature, and for which there are strong computational soundness results. We exhibit an axiomatization which is sound and complete relative to the underlying theory of terms, and to an omega-rule for quantifiers. Besides standard axioms and rules, the axiomatization includes novel axioms for the interaction between knowledge and cryptography. As protocol examples we use mixes, a Crowds-style protocol, and electronic payments. Furthermore, we provide embedding results for BAN and SVO.