NARROWER: a new algorithm for unification and its application to logic programming
Proc. of the first international conference on Rewriting techniques and applications
An attack on the Needham-Schroeder public-key authentication protocol
Information Processing Letters
Using encryption for authentication in large networks of computers
Communications of the ACM
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
Paradigm shifts in protocol analysis
Proceedings of the 1999 workshop on New security paradigms
Using a Declarative Language to Build an Experimental Analysis Tool
PADL '02 Proceedings of the 4th International Symposium on Practical Aspects of Declarative Languages
Partial Order Reductions for Security Protocol Verification
TACAS '00 Proceedings of the 6th International Conference on Tools and Algorithms for Construction and Analysis of Systems: Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS 2000
First-order verification of cryptographic protocols
Journal of Computer Security - CSFW13
Using backward strategy to the Needham-Schroeder public key protocol verification
Artificial intelligence and security in computing systems
New semantic model for authentication protocols in ASMs
Journal of Computer Science and Technology
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
A survey of algebraic properties used in cryptographic protocols
Journal of Computer Security
Trusting trusted hardware: towards a formal model for programmable secure coprocessors
WOEC'98 Proceedings of the 3rd conference on USENIX Workshop on Electronic Commerce - Volume 3
Comparing State Spaces in Automatic Security Protocol Analysis
Formal to Practical Security
Secure transaction protocol analysis: models and applications
Secure transaction protocol analysis: models and applications
Protocol analysis in Maude-NPA using unification modulo homomorphic encryption
Proceedings of the 13th international ACM SIGPLAN symposium on Principles and practices of declarative programming
Comparison of cryptographic verification tools dealing with algebraic properties
FAST'09 Proceedings of the 6th international conference on Formal Aspects in Security and Trust
| Hi-index | 0.00 |
The NRL protocol analyzer is a tool for proving security properties of cryptographic protocols, and for finding flaws if they exist. It is used by having the user first prove a number of lemmas stating that infinite classes of states are unreachable, and then performing an exhaustive search on the remaining state space. One main source of difficulty in using the tool is in generating the lemmas that are to be proved. In this paper we show how we have made the test easier by automating the generation of lemmas involving the use of formal languages.