Strand Spaces and Rank Functions: More than Distant Cousins
CSFW '02 Proceedings of the 15th IEEE workshop on Computer Security Foundations
First-order verification of cryptographic protocols
Journal of Computer Security - CSFW13
Proving Secrecy is Easy Enough
CSFW '01 Proceedings of the 14th IEEE workshop on Computer Security Foundations
New semantic model for authentication protocols in ASMs
Journal of Computer Science and Technology
A comparison between strand spaces and multiset rewriting for security protocol analysis
Journal of Computer Security
A rewriting-based inference system for the NRL protocol analyzer: grammar generation
Proceedings of the 2005 ACM workshop on Formal methods in security engineering
A rewriting-based inference system for the NRL Protocol analyzer and its meta-logical properties
Theoretical Computer Science - Automated reasoning for security protocol analysis
Secrecy by interpretation functions
Knowledge-Based Systems
Constructing and Reasoning About Security Protocols Using Invariants
Electronic Notes in Theoretical Computer Science (ENTCS)
Pattern-based abstraction for verifying secrecy in protocols
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
| Hi-index | 0.01 |
The growing interest in the application of formal methods of cryptographic protocol analysis has led to the development of a number of different techniques for generating and describing invariants that are defined in terms of what messages an intruder can and cannot learn. These invariants, which can be used to prove authentication as well as secrecy results, appear to be central to many different tools and techniques. However, since they are usually developed independently for different systems, it is often not easy to see what they have in common with each other, or to tell whether or not they can be used in systems other than the ones for which they were developed. In this paper, we attempt to remedy this situation by giving an overview of several of these techniques, discussing their relationships to each other, and developing a simple taxonomy. We also discuss some of the implications for future research.