A rewriting-based inference system for the NRL Protocol Analyzer and its meta-logical properties

Theoretical Computer Science

Volumn 367, Issue 1-2, 2006, Pages 162-202

  Escobar, Santiago ^a,c   Meadows, Catherine ^b   Meseguer, José ^c  

^a UNIVERSITAT POLITÈCNICA DE VALÈNCIA   (Spain)

^b NAVAL RESEARCH LABORATORY   (United States)

^c UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; FORMAL LOGIC; PATTERN RECOGNITION; PUBLIC KEY CRYPTOGRAPHY; REAL TIME SYSTEMS; SECURITY OF DATA;

EQUATIONAL THEORY; PROTOCOL ANALYZER; SEARCH ALGORITHM;

NETWORK PROTOCOLS;

EID: 33750477656     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2006.08.035     Document Type: Article

References (32)

1. Baader F., and Snyder W. Unification theory. In: Robinson A., and Voronkov A. (Eds). Handbook of Automated Reasoning Vol. 1 (2001), Elsevier Science, Amsterdam 445-532 (Chapter 8)
2. Basin D., Mödersheim S., and Viganò L. OFMC: a symbolic model checker for security protocols. Internat. J. Inform. Security 4 3 (2001) 181-208
3. Bistarelli S., Cervesato I., Lenzini G., and Martinelli F. Relating multiset rewriting and process algebras for security protocol analysis. J. Comput. Security 13 1 (2005) 3-47
4. Blanchet B. An efficient cryptographic protocol verifier based on prolog rules. 14th IEEE Computer Security Foundations Workshop (2001), IEEE Computer Society, Silver Spring, MD 82-96
5. Y. Chevalier, R. Küsters, M. Rusinowitch, M. Turuani, Deciding the security of protocols with Diffie-Hellman exponentiation and products in exponents, in: 23rd Conf. on Foundations Software Technology and Theoretical Computer Science, Lecture Notes in Computer Science, Vol. 2914, Springer, Berlin, 2003, pp. 124-135.
6. Y. Chevalier, R. Küsters, M. Rusinowitch, M. Turuani, An NP decision procedure for protocol insecurity with XOR, in: 18th Annu. IEEE Symp. Logic in Computer Science, 2003.
7. Clavel M., Durán F., Eker S., Lincoln P., Martí-Oliet N., Meseguer J., and Quesada J. Maude: specification and programming in rewriting logic. Theoret. Comput. Sci. 285 (2002) 187-243
8. H. Comon-Lundh, V. Shmatikov, Intruder deductions, constraint solving and insecurity decision in presence of exclusive-or, in: 18th Annu. IEEE Symp. on Logic in Computer Science, 2003, pp. 271-280.
9. N. Dershowitz, S. Mitra, G. Sivakumar, Decidable matching for convergent systems (preliminary version), in: D. Kapur (Ed.), 11th Internat. Conf. on Automated Deduction, Lecture Notes in Computer Science, Vol. 607, Springer, Berlin, 1992, pp. 589-602.
10. Dolev D., and Yao A. On the security of public key protocols. IEEE Trans. Inform. Theory 29 2 (1983) 198-208
11. Escobar S., Meadows C., and Meseguer J. A rewriting-based inference system for the NRL Protocol Analyzer: grammar generation. In: Küsters R., and Mitchell J. (Eds). Proc. 2005 ACM Workshop on Formal Methods in Security Engineering (2005), ACM, New York 1-12
12. Fabrega F.J.T., Herzog J.C., and Guttman J. Strand spaces: proving security protocols correct. J. Comput. Security 7 (1999) 191-230
13. T. Genet, F. Klay, Rewriting for cryptographic protocol verification, in: D.A. McAllester (Ed.), 17th Internat. Conf. on Automated Deduction, Lecture Notes in Computer Science, Vol. 1831, Springer, Berlin, 2000, pp. 271-290.
14. Heather J., and Schneider S. A decision procedure for the existence of a rank function. J. Comput. Security 13 2 (2005) 317-344
15. J. Hullot, Canonical forms and unification, in: W. Bibel, R. Kowalski (Eds.), Fifth Conf. on Automated Deduction, Lecture Notes in Computer Science, Vol. 87, Springer, Berlin, 1980, pp. 318-334.
16. Kapur D., and Narendran P. Matching, Unification and Complexity. ACM SIGSAM Bulletin 21 4 (1987) 6-9
17. G. Lowe, Breaking and fixing the Needham-Schroeder public-key protocol using FDR, in: Tools and Algorithms for Construction and Analysis of Systems, Lecture Notes in Computer Science, Vol. 1055, Springer, Berlin, 1996, pp. 147-166.
18. Meadows C. Applying formal methods to the analysis of a key management protocol. J. Comput. Security 1 1 (1992)
19. C. Meadows, Analyzing the Needham-Schroeder public-key protocol: a comparison of two approaches, in: E. Bertino, H. Kurth, G. Martella, E. Montolivo (Eds.), Proc. Fourth European Symp. on Research in Computer Security, Lecture Notes in Computer Science, Vol. 1146, Springer, Berlin, 1996, pp. 351-364.
20. Meadows C. Language generation and verification in the NRL Protocol Analyzer. Proc. Ninth IEEE Computer Security Foundations Workshop (1996), IEEE Computer Society Press, Silver Spring, MD 48-61
21. Meadows C. The NRL Protocol Analyzer: an overview. J. Logic Programming 26 2 (1996) 113-131
22. Meadows C. Invariant generation techniques in cryptographic protocol analysis. Proc. 13th Computer Security Foundations Workshop (2000), IEEE Computer Society Press, Silver Spring, MD
23. Meadows C., Cervesato I., and Syverson P. Specification of the group domain of interpretation protocol using NPATRL and the NRL Protocol Analyzer. J. Comput. Security 12 6 (2004) 893-932
24. Meseguer J. Conditional rewriting logic as a unified model of concurrency. Theoret. Comput. Sci. 96 1 (1992) 73-155
25. J. Meseguer, Membership algebra as a logical framework for equational specification, in: F. Parisi-Presicce (Ed.), Proc. WADT'97, Springer, Lecture Notes in Computer Science, Vol. 1376, Springer, Berlin, 1998, pp. 18-61.
26. Meseguer J., and Thati P. Symbolic reachability analysis using narrowing and its application to the verification of cryptographic protocols. In: Martí-Oliet J. (Ed). Proc. Fifth Internat. Workshop on Rewriting Logic and its Applications (2004), ENTCS, Elsevier, Amsterdam
27. J. Millen, V. Shmatikov, Constraint solving for bounded-process cryptographic protocol analysis, in: Eighth ACM Conf. on Computer and Communications Security, 2001, pp. 166-175.
28. Needham R., and Schroeder M. Using encryption for authentication in large networks of computers. Comm. ACM 21 12 (1978) 993-999
29. D. Peled, Ten years of partial order reduction, in: 10th Conf. on Computer-aided Verification, Lecture Notes in Computer Science, Vol. 1427, Springer, Berlin, 1998, pp. 17-28.
30. Stubblebine S., and Meadows C. Formal characterization and automated analysis of known-pair and chosen-text attacks. IEEE J. Selected Areas in Comm. 18 4 (2000) 571-581
31. TeReSe (Ed.), Term Rewriting Systems, Cambridge University Press, Cambridge, 2003.
32. C. Weidenbach, Towards an automatic analysis of security protocols in first-order logic, in: H. Ganzinger (Ed.), 16th Internat. Conf. on Automated Deduction, Lecture Notes in Computer Science, Vol. 1632, Springer, Berlin, 1999, pp. 314-328.