ACM SIGOPS Operating Systems Review
Prudent Engineering Practice for Cryptographic Protocols
IEEE Transactions on Software Engineering
A calculus for cryptographic protocols
Information and Computation
Strand spaces: proving security protocols correct
Journal of Computer Security
Relations between secrets: two formal analyses of the Yahalom protocol
Journal of Computer Security
Cryptography: Theory and Practice
Cryptography: Theory and Practice
Handbook of Applied Cryptography
Handbook of Applied Cryptography
Authentication tests and the structure of bundles
Theoretical Computer Science
Non Interference for the Analysis of Cryptographic Protocols
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Symbolic Trace Analysis of Cryptographic Protocols
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
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
Secrecy types for asymmetric communication
Theoretical Computer Science - Foundations of software science and computation structures
A Hierarchy of Authentication Specifications
CSFW '97 Proceedings of the 10th IEEE workshop on Computer Security Foundations
Protocol Independence through Disjoint Encryption
CSFW '00 Proceedings of the 13th IEEE workshop on Computer Security Foundations
How to Prevent Type Flaw Attacks on Security Protocols
CSFW '00 Proceedings of the 13th IEEE workshop on Computer Security Foundations
Types and Effects for Asymmetric Cryptographic Protocols
CSFW '02 Proceedings of the 15th IEEE workshop on Computer Security Foundations
Authenticity by Typing for Security Protocols
CSFW '01 Proceedings of the 14th IEEE workshop on Computer Security Foundations
A Semantic Model for Authentication Protocols
SP '93 Proceedings of the 1993 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
Authenticity by tagging and typing
Proceedings of the 2004 ACM workshop on Formal methods in security engineering
WITS '05 Proceedings of the 2005 workshop on Issues in the theory of security
Analysis of Typed Analyses of Authentication Protocols
CSFW '05 Proceedings of the 18th IEEE workshop on Computer Security Foundations
Types and effects for asymmetric cryptographic protocols
Journal of Computer Security - Special issue on CSFW15
Verification of cryptographic Protocols: tagging enforces termination
FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
Hi-index | 0.00 |
Authentication protocols are very simple distributed algorithms whose purpose is to enable two entities to achieve mutual and reliable agreement on some piece of information, typically the identity of the other party, its presence, the origin of a message, its intended destination. Achieving the intended agreement guarantees is subtle because they typically are the result of the encryption/decryption of messages composed of different parts, with each part providing a “piece” of the authentication guarantee. This tutorial paper presents the basics of authentication protocols and illustrates a specific technique for statically analysing protocol specifications. The technique allows us to validate protocols in the presence of both malicious outsiders and compromised insiders, with no limitation on the number of parallel sessions. This paper covers the course “Static Analysis of Authentication” given by the author at the FOSAD'04 school. The static analysis technique described here is a joint work with Michele Bugliesi and Matteo Maffei (Università di Venezia)[8,12]. .