Guiding a General-Purpose C Verifier to Prove Cryptographic Protocols

François Dupressoir, Andrew D. Gordon, Jan Jürjens, David A. Naumann

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract / Description of output

We describe how to verify security properties of C code for cryptographic protocols by using a general-purpose verifier. We prove security theorems in the symbolic model of cryptography. Our techniques include: use of ghost state to attach formal algebraic terms to concrete byte arrays and to detect collisions when two distinct terms map to the same byte array, decoration of a crypto API with contracts based on symbolic terms, and expression of the attacker model in terms of C programs. We rely on the general-purpose verifier VCC, we guide VCC to prove security simply by writing suitable header files and annotations in implementation files, rather than by changing VCC itself. We formalize the symbolic model in Coq in order to justify the addition of axioms to VCC.
Original languageEnglish
Title of host publicationProceedings of the 24th IEEE Computer Security Foundations Symposium, CSF 2011, Cernay-la-Ville, France, 27-29 June, 2011
PublisherInstitute of Electrical and Electronics Engineers (IEEE)
Number of pages15
Publication statusPublished - 2011


Dive into the research topics of 'Guiding a General-Purpose C Verifier to Prove Cryptographic Protocols'. Together they form a unique fingerprint.

Cite this