Formal semantics for logics of cryptographic protocols
- 4 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
A logic and associated formal semantics specifically designed to represent and analyze cryptographic protocols are presented. A language is given with distinct means to represent knowledge of an individual word (e.g., the ability to recognize or produce a decryption key) and propositional knowledge. A sample analysis of a protocol is given to demonstrate the potential usefulness of the system.Keywords
This publication has 14 references indexed in Scilit:
- Analyzing encryption protocols using formal verification techniquesIEEE Journal on Selected Areas in Communications, 1989
- Using Reasoning About Knowledge to Analyze Distributed SystemsAnnual Review of Computer Science, 1987
- The complexity of reasoning about knowledge and timePublished by Association for Computing Machinery (ACM) ,1986
- Free LogicsPublished by Springer Nature ,1986
- The knowledge complexity of interactive proof-systemsPublished by Association for Computing Machinery (ACM) ,1985
- Quantification in Modal LogicPublished by Springer Nature ,1984
- Cryptographic protocolsPublished by Association for Computing Machinery (ACM) ,1982
- Timestamps in key distribution protocolsCommunications of the ACM, 1981
- Using encryption for authentication in large networks of computersCommunications of the ACM, 1978
- A logic of believing, knowing, and inferringSynthese, 1974