An E-unification algorithm for analyzing protocols that use modular exponentiation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2706, Issue , 2003, Pages 165-179

  Kapur, Deepak ^a   Narendran, Paliath ^b   Wang, Lida ^b  

^a University of New Mexico   (United States)

^b State University of New York   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY;

BOUNDEDNESS PROPERTIES; CRYPTOGRAPHIC PROTOCOLS; INTERNET ENGINEERING TASK FORCES; INTERNET KEY EXCHANGE; MODULAR EXPONENTIATION; MODULAR MULTIPLICATION; SYMBOLIC COMPUTATION; UNIFICATION ALGORITHMS;

COMPUTATION THEORY;

EID: 51149098006     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44881-0_13     Document Type: Conference Paper

References (20)

1. F. Baader. Unification in Commutative Theories, Hilbert’s Basis Theorem, and Gröbner Bases. J. ACM, 40 (3), 1993, 477–503.
2. F. Baader and W. Nutt: Adding Homomorphisms to Commutative/Monoidal Theories, or: How Algebra Can Help in Equational Unification. Proc. 4th Intl. Conf. on Rewriting Techniques and Applications (RTA 91), LNCS 488, 1991, 124–135.
3. F. Baader and K.U. Schultz: Unification in the Union of Disjoint Equational Theories: Combining Decision Procedures. Proc. 11th Conference on Automated Deduction (CADE-11), Saratoga Springs, NY, Springer LNAI 607, 1992, 50–65.
4. J. Clark and J. Jacob: A Survey of Authentication Protocol Literature: Version 1.0. Unpublished Technical Report, Department of Computer Science, University of York, UK, Nov 1997. Available at the URL: www-users.cs.york.ac.uk/˜jac/papers/drareviewps.ps.
5. M. Davis. Computability and Unsolvability. Dover Publications, 1982.
6. A. Kandri-Rody and D. Kapur. Computing the Gröbner Basis of a Polynomial Ideal over Integers. Proc. Third MACSYMA Users’ Conference, Schenectady, NY, July 1984, 436–451.
7. A. Kandri-Rody and D. Kapur. An Algorithm for Computing the Gröbner Basis of a Polynomial Ideal over an Euclidean Ring. Journal of Symbolic Computation, 6 (1), August 1988, 37-57.
8. D. Kapur, P. Narendran, and L. Wang. A Unification Algorithm for Analysis of Protocols with Blinded Signatures. TR 02-5, Department of Computer Science, SUNY, Albany, NY. To appear in the Festschrift for Jörg Siekmann (Dieter Hutter, Werner Stephan, eds.), Lecture Notes in Artificial Intelligence 2605, Springer.
9. D. Kapur, P. Narendran, and L. Wang. Analyzing Protocols that use Modular Exponentiation: Semantic Unification Techniques Technical Report, Department of Computer Science, SUNY, Albany, NY. An expanded version of this paper.
10. K. Madlener and B. Reinert. On Gröbner bases in Monoid and Group Rings. SEKI Report SR-93-08, Universität Kaiserslautern, Germany.
11. C. Meadows. The NRL Protocol Analyzer: An Overview. J. Logic Programming, 26(2), 1996, 113–131.
12. C. Meadows. Analysis of the Internet Key Exchange protocol using the NRL Protocol Analyzer. In: Proc. the 1999 Symp. on Security and Privacy, IEEE.
13. C. Meadows, P. Syverson and I. Cervesato. Formal Specification and Analysis of the Group Domain of Interpretation Protocol using NPATROL and the NRL Protocol Analyzer. To appear in the Journal of Computer Security.
14. C. Meadows and P. Narendran. A Unification Algorithm for the Group Diffie- Hellman Protocol. Workshop on Issues in the Theory of Security (WITS 2002), Portland, OR, Jan 2002.
15. P. Narendran. On solving linear equations over polynomial semirings. In: Proc. 11th Annual Symp. on Logic in Computer Science (LICS), NJ, July 96, 466–472.
16. P. Narendran, F. Pfenning, and R. Statman. On the Unification Problem for Cartesian Closed Categories. Journal of Symbolic Logic, 62 (2), June 97, 636–647.
17. O. Pereira and J.-J. Quisquater: A Security Analysis of the Cliques Protocols Suites. Proc. 14th IEEE Computer Security Foundations Workshop, June 2001.
18. R.L. Rivest, A. Shamir, and L. Adleman. A Method for Obtaining Digital Signatures and Public Key Cryptosystems. CACM 21 (2), 1978, 120–126.
19. G. Simmons and C. Meadows. The Role of Trust in Information Integrity Protocols. Journal of Computer Security 3(2), 1994.
20. S.G. Stubblebine and C. Meadows. On Searching for Known and Chosen Cipher Pairs using the NRL Protocol Analyzer. Presented at the DIMACS Workshop on Design and Formal Verification of Security Protocols, September 1997