Abstracting Cryptographic Protocols by Prolog Rules
- 4 July 2001
- book chapter
- Published by Springer Nature
- p. 433-436
- https://doi.org/10.1007/3-540-47764-0_27
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- An efficient cryptographic protocol verifier based on prolog rulesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Athena: a new efficient automatic checker for security protocol analysisPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Automating Data IndependencePublished by Springer Nature ,2000
- Abstracting Cryptographic Protocols with Tree AutomataPublished by Springer Nature ,1999
- Proving security protocols with model checkers by data independence techniquesJournal of Computer Security, 1999
- The inductive approach to verifying cryptographic protocolsJournal of Computer Security, 1998
- Explicit communication revisited: two new attacks on authentication protocolsIEEE Transactions on Software Engineering, 1997
- Breaking and fixing the Needham-Schroeder Public-Key Protocol using FDRPublished by Springer Nature ,1996
- Prudent engineering practice for cryptographic protocolsIEEE Transactions on Software Engineering, 1996
- A logic of authenticationProceedings of the Royal Society of London. Series A. Mathematical and Physical Sciences, 1989