Verification of low-level crypto-protocol implementations using automated theorem proving

Proceedings - Third ACM and IEEE International Conference on Formal Methods and Models for Co-Design, MEMOCODE'05

Volumn 2005, Issue , 2005, Pages 89-98

  Jürjens, Jan ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; COMPUTER HARDWARE; NETWORK PROTOCOLS; PUBLIC KEY CRYPTOGRAPHY; STANDARDS; THEOREM PROVING;

AUTOMATED THEOREM PROVING; CODE ANALYSIS; CRYPTOGRAPHIC PROTOCOLS; TOKEN INTERFACE STANDARD PKCS 11;

AUTOMATA THEORY;

EID: 33745178885     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/MEMCOD.2005.1487898     Document Type: Conference Paper

References (23)

1. [Abs04] Abslnt. aicall. http://www.aicall.de/, 2004.
2. [ALP03] Myla Archer, Elizabeth Leonard, and Matteo Pradella. Analyzing security-enhanced linux policy specifications. In 4th IEEE International Workshop on Policies for Distributed Systems and Networks (POLICY 2003), pages 158-172. IEEE Computer Society, 2003.
3. [APS99] V. Apostolopoulos, V. Peris, and D. Saha. Transport layer security: How much does it really cost? In Conference on Computer Communications (IEEE Infocom), pages 717-725. IEEE Computer Society, March 1999.
4. [CKL04] Edmund M. Clarke, Daniel Kroening, and Flavio Lerda. A tool for checking ANSI-C programs. In Kurt Jensen and Andreas Podelski, editors, TACAS, volume 2988 of Lecture Notes in Computer Science, pages 168-176. Springer, 2004.
5. [CKY03] E. Clarke, D. Kroening, and K. Yorav. Behavioral consistency of C and Verilog programs using bounded model checking. Technical Report CMUCS-03-126, School of Computer Science, Carnegie Mellon University, 2003.
6. [Coh03] Ernie Cohen. First-order verification of cryptographic protocols. Journal of Computer Security, 11(2):189-216, 2003.
7. [DLMS99] N. Durgin, P. Lincoln, J. Mitchell, and A. Scedrov. Undecidability of bounded security protocols. In Workshop on Formal Methods and Security Protocols (FMSP 1999), 1999.
8. [DY83] D. Dolev and A. Yao. On the security of public key protocols. IEEE Transactions on Information Theory, IT-29(2):198-208, 1983.
9. [GRS99] Fred Gilham, Robert A. Riemenschneider, and Victoria Stavridou. Secure interoperation of secure distributed databases. In Jeannette M. Wing, Jim Woodcock, and Jim Davies, editors, World Congress on Formal Methods in the Development of Computing Systems (FM 99), number 1708 in Lecture Notes in Computer Science, pages 701-717. Springer-Verlag, 1999.
10. [HS01] G.J. Holzmann and M.H. Smith. Software model checking: extracting verification models from source code. Software Testing, Verification & Reliability, 11(2):65-79, 2001.
11. [JK04] J. Jürjens and Thomas Kuhn. Practical security analysis of C programs using automatic theorem provers. Technical Report ITB 51, Verisoft Project, December 2004.
12. [Jür04a] J. Jürjens. Secure Systems Development with UML. Springer-Verlag, 2004.
13. [Jür04b] J. Jürjens. Security analysis tool (webinterface and download), 2004. http://www4.in.tum.de/csduml/interface.
14. [Jür05] J. Jürjens. Sound methods and effective tools for model-based security engineering with UML. In 27th International Conference on Software Engineering (ICSE 2005). IEEE Computer Society, 2005.
15. [KAH99] J. Kirby, M. Archer, and C. Heitmeyer. Applying formal methods to an information security device: An experience report. In 4th IEEE International Symposium on High Assurance Systems Engineering (HASE 1999), pages 81-88. IEEE Computer Society, 1999.
16. [Lab04] RSA Labs. PKCS 11 http://www. rsasecurity.com/rsalabs/node.asp?id=2133, 2004.
17. [RS98] P. Ryan and S. Schneider. An attack on a recursive authentication protocol. Information Processing Letters, 65:7-10, 1998.
18. [Sch97] J. Schumann. Automatic verification of cryptographic protocols with SETHEO. In W. McCune, editor, 14th International Conference on Automated Deduction (CADE-14), volume 1249 of Lecture Notes in Computer Science, pages 87-100. Springer-Verlag, 1997.
19. [Shy02] R. K. Shyamasundar. Analyzing cryptographic protocols in a reactive framework. In Agostino Cortesi, editor, VMCAI, volume 2294 of Lecture Notes in Computer Science, pages 46-64. Springer, 2002.
20. [SS01] G. Sutcliffe and C. Suttner. The TPTP problem library for automated theorem proving, 2001. Available at http://www.tptp.org.
21. [Sto02] Scott D. Stoller. A bound on attacks on authentication protocols. In Ricardo A. Baeza-Yates, Ugo Montanari, and Nicola Santoro, editors, IFIP TCS, volume 223 of IFIP Conference Proceedings, pages 588-600. Kluwer, 2002.
22. 3 theorem prover. In R. Dyckhoff, editor, Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX 2000), volume 1847 of Lecture Notes in Computer Science, pages 436-440. Springer-Verlag, 2000.
23. [Wei99] C. Weidenbach. Towards an automatic analysis of security protocols in first-order logic. In H. Ganzinger, editor, 16th International Conference on Automated Deduction (CADE-16), volume 1632 of Lecture Notes in Computer Science, pages 314-328, 1999.