Bounding Messages for Free in Security Protocols-Reference-Cited by-同舟云学术

Bounding Messages for Free in Security Protocols

Published:2007 Issue: Volume: Page:376-387
ISSN:0302-9743
Container-title:FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science
language:
Short-container-title:

Author:

Arapinis Myrto,Duflot Marie

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-77050-3_31

Reference15 articles.

1. Arapinis, M., Duflot, M.: Bounding messages for free in security protocols (extended version) (2007), http://www.arapinis.org/publications/fsttcs07ext.pdf

2. Blanchet, B., Podelski, A.: Verification of cryptographic protocols: Tagging enforces termination. TCS: Theoretical Computer Science 333 (2005)

3. Comon, H., Cortier, V.: Tree automata with one memory, set constraints and cryptographic protocols. Research Report LSV-01-13, Laboratoire Spécification et Vérification, ENS Cachan, France, p. 98 (2001)

4. Lecture Notes in Computer Science;V. Cortier,2007

5. Clark, J.A., Jacob, J.L.: A survey of authentication protocol literature (1997)

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

1. Abstractions for security protocol verification;Journal of Computer Security;2018-07-10

2. Typing and Compositionality for Security Protocols: A Generalization to the Geometric Fragment;Computer Security -- ESORICS 2015;2015

3. Leakiness is Decidable for Well-Founded Protocols;Lecture Notes in Computer Science;2015

4. Abstractions for Security Protocol Verification;Lecture Notes in Computer Science;2015

5. Automatic Verification of Security Protocols in the Symbolic Model: The Verifier ProVerif;Foundations of Security Analysis and Design VII;2014