PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Theoretical Computer Science - Thirteenth International Colloquim on Automata, Languages and Programming, Renne
The complexity of reasoning about knowledge and time. I. lower bounds
Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
On the synthesis of a reactive module
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Design and validation of computer protocols
Design and validation of computer protocols
A semantics for a logic of authentication (extended abstract)
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
Handbook of theoretical computer science (vol. B)
The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
A logic for reasoning about security
ACM Transactions on Computer Systems (TOCS)
Adding time to a logic of authentication
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
Reasoning about knowledge
Efficient checking of temporal integrity constraints using bounded history encoding
ACM Transactions on Database Systems (TODS)
Temporal logic in information systems
Logics for databases and information systems
The inductive approach to verifying cryptographic protocols
Journal of Computer Security
Using encryption for authentication in large networks of computers
Communications of the ACM
ACM Transactions on Computational Logic (TOCL)
Epistemic Logic for AI and Computer Science
Epistemic Logic for AI and Computer Science
On the temporal analysis of fairness
POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Breaking and Fixing the Needham-Schroeder Public-Key Protocol Using FDR
TACAs '96 Proceedings of the Second International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Using a PVS Embedding of CSP to Verify Authentication Protocols
TPHOLs '97 Proceedings of the 10th International Conference on Theorem Proving in Higher Order Logics
Proceedings of the Conference on Logic of Programs
Verifying authentication protocols with CSP
CSFW '97 Proceedings of the 10th IEEE workshop on Computer Security Foundations
Resolution-Based Proof for Multi-Modal Temporal Logics of Knowledge
TIME '00 Proceedings of the Seventh International Workshop on Temporal Representation and Reasoning (TIME'00)
On Unifying Some Cryptographic Protocol Logics
SP '94 Proceedings of the 1994 IEEE Symposium on Security and Privacy
Automated analysis of cryptographic protocols using Mur/spl phi/
SP '97 Proceedings of the 1997 IEEE Symposium on Security and Privacy
Complete Axiomatizations for Reasoning about Knowledge and Time
SIAM Journal on Computing
Using Temporal Logics of Knowledge in the Formal Verification of Security Protocols
TIME '04 Proceedings of the 11th International Symposium on Temporal Representation and Reasoning
Mechanising first-order temporal resolution
Information and Computation - Special issue: 19th international conference on automated deduction (CADE-19)
ACM Transactions on Computational Logic (TOCL)
First-Order Temporal Verification in Practice
Journal of Automated Reasoning
The modelling and analysis of security protocols: the csp approach
The modelling and analysis of security protocols: the csp approach
Formal methods for cryptographic protocol analysis: emerging issues and trends
IEEE Journal on Selected Areas in Communications
Taming the complexity of temporal epistemic reasoning
FroCoS'09 Proceedings of the 7th international conference on Frontiers of combining systems
| Hi-index | 0.00 |
Temporal logics of knowledge are useful for reasoning about situations where the knowledge of an agent or component is important, and where change in this knowledge may occur over time. Here we investigate the application of temporal logics of knowledge to the specification and verification of security protocols. We show how typical assumptions relating to authentication protocols can be specified. We consider verification methods for these logics, in particular, focusing on proofs using clausal resolution. Finally we present experiences from using a resolution based theorem prover applied to security protocols specified in temporal logics of knowledge.