Efficient symbolic execution for analysing cryptographic protocol implementations

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6542 LNCS, Issue , 2011, Pages 58-72

  Corin, Ricardo ^a,b   Manzano, Felipe Andrés ^a  

^a UNIVERSIDAD NACIONAL DE CÓRDOBA   (Argentina)

^b CONICET ^*  (Argentina)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHIC PRIMITIVES; CRYPTOGRAPHIC PROTOCOLS; REWRITING RULES; SYMBOLIC ANALYSIS; SYMBOLIC EXECUTION; SYMBOLIC FUNCTIONS; SYMBOLIC SEMANTICS; VIRTUAL MACHINES; CONCURRENT CRYPTOGRAPHIC PROTOCOLS; LOW LEVEL VIRTUAL MACHINES;

SEMANTICS; CONCRETES; MODEL CHECKING;

CRYPTOGRAPHY;

EID: 79551546339     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-19125-1_5     Document Type: Conference Paper

References (18)

1. Aizatulin, M., Gordon, A., Jurgens, J., Nuseibeh, B.: Verifying implementations of security protocols in c, http://users.mct.open.ac.uk/ma4962/ files/ abstract202010.pdf
2. Bhargavan, K., Fournet, C., Corin, R., Zalinescu, E.: Cryptographically verified implementations for tls. In: Ning, P., Syverson, P.F., Jha, S. (eds.) ACM Conference on Computer and Communications Security, pp. 459-468. ACM, New York (2008)
3. Blanchet, B.: An efficient cryptographic protocol verifier based on prolog rules. In: CSFW, pp. 82-96. IEEE Computer Society, Los Alamitos (2001)
4. Blanchet, B.: A computationally sound mechanized prover for security protocols. IEEE Trans. Dependable Sec. Comput. 5(4), 193-207 (2008)
5. Cadar, C., Dunbar, D., Engler: D.r.: Klee: Unassisted and automatic generation of high-coverage tests for complex systems programs. In: Proceedings of OSDI, pp. 209-224 (2008)
6. Corin, R.: Analysis Models for Security Protocols. PhD thesis, University of Twente (2006)
7. Dierks, T., Rescorla, E.: The Transport Layer Security (tls) protocol. RFC 4346, Internet Engineering Task Force (April 2006), http://www.ietf.org/rfc/ rfc4346. txt
8. Dolev, D., Yao, A.C.: On the security of public key protocols. IEEE Transactions on Information Theory 29(2), 198-208 (1983)
9. Ganesh, V., Dill, D.: Stp: A decision procedure for bitvectors and arrays, http:// theory.stanford.edu/~vganesh/stp
10. Goubault-Larrecq, J.: Csur: Static analysis of C code (2002), http://www.lsv. ens-cachan.fr/csur/ Written in OCaml (12648 lines)
11. Jürjens, J.: Security analysis of crypto-based java programs using automated theorem provers. In: ASE, pp. 167-176. IEEE Computer Society, Los Alamitos (2006)
12. King, J.C.: Symbolic execution and program testing. ACM Commun. 19(7), 385-394 (1976)
13. Kremer, S., Delaune, S., Kremer, S.: Computing knowledge in security protocols under convergent equational theories (March 2009)
14. Lattner, C., Adve, V.: The LLVM language reference manual, http://llvm.org/ docs/LangRef.html
15. Molnar, D.A., Wagner, D.: Catchconv: Symbolic execution and run-time type inference for integer conversion errors. Technical report (2007)
16. Pironti, A., Jürjens, J.: Formally-based black-box monitoring of security protocols. In: Massacci, F., Wallach, D.S., Zannone, N. (eds.) ESSoS 2010. LNCS, vol. 5965, pp. 79-95. Springer, Heidelberg (2010)
17. Song, D., Brumley, D., Yin, H., Caballero, J., Jager, I., Kang, M.G., Liang, Z., Newsome, J., Poosankam, P., Saxena, P.: BitBlaze: A new approach to computer security via binary analysis. In: Sekar, R., Pujari, A.K. (eds.) ICISS 2008. LNCS, vol. 5352, pp. 1-25. Springer, Heidelberg (2008)
18. Woo, T.Y.C., Lam, S.S.: A semantic model for authentication protocols (1993)