An E-unification Algorithm for Analyzing Protocols That Use Modular Exponentiation-Reference-Cited by-同舟云学术

An E-unification Algorithm for Analyzing Protocols That Use Modular Exponentiation

Published:2003 Issue: Volume: Page:165-179
ISSN:0302-9743
Container-title:Rewriting Techniques and Applications
language:
Short-container-title:

Author:

Kapur Deepak,Narendran Paliath,Wang Lida

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-44881-0_13

Reference19 articles.

1. F. Baader. Unification in Commutative Theories, Hilbert’s Basis Theorem, and Gröbner Bases. J. ACM, 40(3), 1993, 477–503.

2. Lect Notes Comput Sci;F. Baader,1991

3. LNAI;F. Baader,1992

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: http://www-users.cs.york.ac.uk/~jac/papers/drareviewps.ps .

5. M. Davis. Computability and Unsolvability. Dover Publications, 1982.

Cited by 15 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Bounded ACh unification;Mathematical Structures in Computer Science;2020-06

2. Theories of Homomorphic Encryption, Unification, and the Finite Variant Property;Proceedings of the 16th International Symposium on Principles and Practice of Declarative Programming - PPDP '14;2014

3. An Algebra for Symbolic Diffie-Hellman Protocol Analysis;Trustworthy Global Computing;2013

4. Unification modulo a partial theory of exponentiation;Electronic Proceedings in Theoretical Computer Science;2010-12-21

5. Reduction of the Intruder Deduction Problem into Equational Elementary Deduction for Electronic Purse Protocols with Blind Signatures;Logic, Language, Information and Computation;2010