Protocol insecurity with a finite number of sessions and composed keys is NP-complete-Reference-Cited by-同舟云学术

Protocol insecurity with a finite number of sessions and composed keys is NP-complete

Published:2003-04 Issue:1-3 Volume:299 Page:451-475
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Rusinowitch Michaël,Turuani Mathieu

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference27 articles.

1. R. Amadio, D. Lugiez, On the reachability problem in cryptographic protocols, in: Proc. CONCUR 2000, Lecture Notes in Computer Science, Vol. 1877, Springer, Berlin, 2000.

2. Lazy infinite-state analysis of security protocols;Basin,1999

3. Towards the formal verification of electronic commerce protocols;Bolignano,1997

4. A meta-notation for protocol analysis;Cervesato,1999

5. Y. Chevalier, L. Vigneron, Towards efficient automated verification of security protocols, in: Verification Workshop (VERIFY’01) (in connection with IJCAR’01), Siena, Italy, June 2001.

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

1. Decision and Complexity of Dolev-Yao Hyperproperties;Proceedings of the ACM on Programming Languages;2024-01-05

2. Tidy: Symbolic Verification of Timed Cryptographic Protocols;Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security;2022-11-07

3. A Decidable Class of Security Protocols for Both Reachability and Equivalence Properties;Journal of Automated Reasoning;2020-10-21

4. Typing Messages for Free in Security Protocols;ACM Transactions on Computational Logic;2020-01-10

5. The Hitchhiker’s Guide to Decidability and Complexity of Equivalence Properties in Security Protocols;Logic, Language, and Security;2020