Equational Cryptographic Reasoning in the Maude-NRL Protocol Analyzer

Electronic Notes in Theoretical Computer Science

Volumn 171, Issue 4, 2007, Pages 23-36

  Escobar, Santiago ^a   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

Cryptographic Protocol Verification; Equational Reasoning; Maude; Narrowing; Rewriting Logic

Indexed keywords

ALGEBRA; COMPUTER PROGRAMMING LANGUAGES; CRYPTOGRAPHY; NUMERICAL METHODS;

ALGEBRAIC PROPERTIES; EQUATIONAL REASONING; PROTOCOL ANALYZER; REWRITING LOGIC;

NETWORK PROTOCOLS;

EID: 34250834342     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2007.02.053     Document Type: Article

References (20)

1. Armando A., Basin D.A., Boichut Y., Chevalier Y., Compagna L., Cuéllar J., Drielsma P.H., Héam P.-C., Kouchnarenko O., Mantovani J., Mödersheim S., von Oheimb D., Rusinowitch M., Santiago J., Turuani M., Viganò L., and Vigneron L. The AVISPA tool for the automated validation of internet security protocols and applications. In: Etessami K., and Rajamani S.K. (Eds). CAV. Lecture Notes in Computer Science 3576 (2005) 281-285
2. Baader F., and Snyder W. Unification theory. In: Robinson A., and Voronkov A. (Eds). Handbook of Automated Reasoning, Volume 1 (2001), Elsevier Science 445-532
3. Basin D.A., Mödersheim S., and Viganò L. Algebraic intruder deductions. In: Sutcliffe G., and Voronkov A. (Eds). LPAR. Lecture Notes in Computer Science 3835 (2005) 549-564
4. Baugher, M., B. Weis, T. Hardjono and H. Harney, The group domain of intepretation, in: Internet Engineering Task Force, RFC 3547, 2003
5. Blanchet, B., An efficient cryptographic protocol verifier based on prolog rules., in: Proceedings of the IEEE Computer Security Foundations Workshop (CSFW-14) (2001), pp. 82-96
6. Clavel M., Durán F., Eker S., Lincoln P., Martí-Oliet N., Meseguer J., and Quesada J. Maude: specification and programming in rewriting logic. Theoretical Computer Science 285 (2002) 187-243
7. Cremers, C., "Scyther - Semantics and Verification of Security Protocols," Ph.D. dissertation, Eindhoven University of Technology (2006)
8. Dershowitz N., Mitra S., and Sivakumar G. Decidable matching for convergent systems (preliminary version). In: Kapur D. (Ed). 11th International Conference on Automated Deduction. (CADE-11). Lecture Notes in Computer Science 607 (1992) 589-602
9. Dolev D., and Yao A. On the security of public key protocols. IEEE Transaction on Information Theory 29 (1983) 198-208
10. Escobar S., Meadows C., and Meseguer J. A rewriting-based inference system for the NRL Protocol Analyzer and its meta-logical properties. Theoretical Computer Science 367 (2006) 162-202
11. Fabrega F.J.T., Herzog J.C., and Guttman J. Strand spaces: Proving security protocols correct. Journal of Computer Security 7 (1999) 191-230
12. Heather, J., G. Lowe and S. Schneider, How to prevent type flaw attacks on security protocols, in: Proceedings of the 13th IEEE Computer Security Foundations Workshop (2000), pp. 255-268
13. Hullot J. Canonical forms and unification. In: Bibel W., and Kowalski R. (Eds). 5th Conference on Automated Deduction. Lecture Notes in Computer Science 87 (1980) 318-334
14. Kapur, D., P. Narendran and L. Wang, An E-unification algorithm for analyzing protocols that use modular exponentiation, Technical Report TR-03-2, CS Dept. SUNY Albany (2003)
15. Meadows C. Applying formal methods to the analysis of a key management protocol. Journal of Computer Security 1 (1992)
16. Meadows C. The NRL Protocol Analyzer: An overview. The Journal of Logic Programming 26 (1996) 113-131
17. Meadows C., Cervesato I., and Syverson P. Specification of the Group Domain of Interpretation Protocol using NPATRL and the NRL Protocol Analyzer. Journal of Computer Security 12 (2004) 893-932
18. Meadows, C. and P. Narendran, A unification algorithm for the group Diffie-Hellman protocol, in: Proc. Workshop on Issues in the Theory of Security WITS 2002, 2002
19. Meseguer J. Conditional rewriting logic as a unified model of concurrency. Theoretical Computer Science 96 (1992) 73-155
20. Stubblebine S., and Meadows C. Formal characterization and automated analysis of known-pair and chosen-text attacks. IEEE Journal on Selected Areas in Communications 18 (2000) 571-581