Computationally sound secrecy proofs by mechanized flow analysis-Reference-Cited by-同舟云学术

Computationally sound secrecy proofs by mechanized flow analysis

Published:2006 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 13th ACM conference on Computer and communications security - CCS '06
language:
Short-container-title:

Author:

Backes Michael¹,Laud Peeter²

Affiliation:

1. Saarland University, Saarbrücken, Germany

2. Tartu University, Tartu, Estonia

Publisher

ACM Press

Reference51 articles.

1. M. Abadi. Secrecy by Typing in Security Protocols. Journal of the ACM, 46(5):749--786, Sept. 1999.]]

2. M. Abadi and B. Blanchet. Secrecy types for asymmetric communication. Theoretical Computer Science, 298(3):387--415, 2003.]]

3. M. Abadi and B. Blanchet. Analyzing Security Protocols with Secrecy Types and Logic Programs. Journal of the ACM, 52(1):102--146, Jan. 2005.]]

4. M. Abadi and A. D. Gordon. A calculus for cryptographic protocols: The spi calculus. In Proc. 4th ACM CCS, pages 36--47, 1997.]]

5. M. Abadi and P. Rogaway. Reconciling two views of cryptography: The computational soundness of formal encryption. In Proc. 1st IFIP TCS, volume 1872 of LNCS, pages 3--22. Springer, 2000.]]

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

1. Computational Soundness for Interactive Primitives;Computer Security -- ESORICS 2015;2015

2. Computational Soundness Results for ProVerif;Lecture Notes in Computer Science;2014

3. Verified Cryptographic Implementations for TLS;ACM Transactions on Information and System Security;2012-03

4. A Survey of Symbolic Methods in Computational Analysis of Cryptographic Systems;Journal of Automated Reasoning;2010-07-13

5. A User Interface for a Game-Based Protocol Verification Tool;Formal Aspects in Security and Trust;2010