EN FR
EN FR


previous Previous | up Home


Bibliography

Major publications by the team in recent years
  • 1M. Abadi, B. Blanchet.

    Analyzing Security Protocols with Secrecy Types and Logic Programs, in: Journal of the ACM, January 2005, vol. 52, no 1, p. 102–146.
  • 2C. Bansal, K. Bhargavan, S. Maffeis.

    Discovering Concrete Attacks on Website Authorization by Formal Analysis, in: 25th IEEE Computer Security Foundations Symposium (CSF'12), Cambridge, MA, USA, IEEE, June 2012, p. 247–262.
  • 3R. Bardou, R. Focardi, Y. Kawamoto, L. Simionato, G. Steel, J.-K. Tsay.

    Efficient Padding Oracle Attacks on Cryptographic Hardware, in: CRYPTO, 2012, p. 608–625.
  • 4K. Bhargavan, C. Fournet, R. Corin, E. Zalinescu.

    Cryptographically verified implementations for TLS, in: ACM Conference on Computer and Communications Security, 2008, p. 459-468.
  • 5K. Bhargavan, C. Fournet, A. D. Gordon.

    Modular verification of security protocol code by typing, in: 37th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL'10), 2010, p. 445-456.
  • 6B. Blanchet.

    Automatically Verified Mechanized Proof of One-Encryption Key Exchange, in: 25th IEEE Computer Security Foundations Symposium (CSF'12), Cambridge, MA, USA, IEEE, June 2012, p. 325–339.
  • 7B. Blanchet, A. Chaudhuri.

    Automated Formal Analysis of a Protocol for Secure File Sharing on Untrusted Storage, in: IEEE Symposium on Security and Privacy, Oakland, CA, IEEE, May 2008, p. 417–431.
  • 8B. Blanchet, D. Pointcheval.

    Automated Security Proofs with Sequences of Games, in: CRYPTO'06, Santa Barbara, CA, C. Dwork (editor), LNCS, Springer Verlag, August 2006, vol. 4117, p. 537–554.
  • 9M. Bortolozzo, M. Centenaro, R. Focardi, G. Steel.

    Attacking and Fixing PKCS#11 Security Tokens, in: Proceedings of the 17th ACM Conference on Computer and Communications Security (CCS'10), Chicago, Illinois, USA, ACM Press, October 2010, p. 260-269. [ DOI : 10.1145/1866307.1866337 ]

    http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BCFS-ccs10.pdf
  • 10V. Cortier, G. Steel, C. Wiedling.

    Revoke and let live: a secure key revocation api for cryptographic devices, in: ACM Conference on Computer and Communications Security (CCS'12), 2012, p. 918-928.
Publications of the year

Doctoral Dissertations and Habilitation Theses

  • 11K. Bhargavan.

    Towards the Automated Verification of Cryptographic Protocol Implementations, École Normale Supérieure, May 2012, Mémoire d'habilitation.

Articles in International Peer-Reviewed Journals

  • 12M. Avalle, A. Pironti, R. Sisto.

    Formal verification of security protocol implementations: a survey, in: Formal Aspects of Computing, 2012, p. 1-25.
  • 13K. Bhargavan, C. Fournet, R. Corin, E. Zalinescu.

    Verified Cryptographic Implementations for TLS, in: ACM Transactions Inf. Syst. Secur., March 2012, vol. 15, no 1, p. 3:1–3:32.
  • 14V. Cortier, B. Smyth.

    Attacking and fixing Helios: An analysis of ballot secrecy, in: Journal of Computer Security, 2012, Accepted.
  • 15A. Pironti, D. Pozza, R. Sisto.

    Formally-Based Semi-Automatic Implementation of an Open Security Protocol, in: Journal of Systems and Software, 2012, vol. 85, p. 835–849.
  • 16A. Pironti, R. Sisto.

    Safe Abstractions of Data Encodings in Formal Security Protocol Models, in: Formal Aspects of Computing, 2012, p. 1-43.

Invited Conferences

  • 17B. Blanchet.

    Security Protocol Verification: Symbolic and Computational Models, in: First Conference on Principles of Security and Trust (POST'12), Tallinn, Estonia, P. Degano, J. Guttman (editors), Lecture Notes on Computer Science, Springer Verlag, March 2012, vol. 7215, p. 3–29.

International Conferences with Proceedings

  • 18G. Bana, P. Adão, H. Sakurada.

    Computationally Complete Symbolic Attacker in Action, in: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2012), 2012, p. 546-560.
  • 19G. Bana, H. Comon-Lundh.

    Towards Unconditional Soundness: Computationally Complete Symbolic Attacker, in: 2nd Conference on Principles of Security and Trust (POST 2013), 2012, p. 189-208.
  • 20C. Bansal, K. Bhargavan, A. Delignat-Lavaud, S. Maffeis.

    Keys to the Cloud: Formal Analysis and Concrete Attacks on Encrypted Web Storage, in: 2nd Conference on Principles of Security and Trust (POST 2013), Rome, Italy, D. Basin, J. Mitchell (editors), Lecture Notes on Computer Science, Springer Verlag, March 2013, To appear.
  • 21C. Bansal, K. Bhargavan, S. Maffeis.

    Discovering Concrete Attacks on Website Authorization by Formal Analysis, in: 25th IEEE Computer Security Foundations Symposium (CSF'12), Cambridge, MA, USA, IEEE, June 2012, p. 247–262.
  • 22R. Bardou, R. Focardi, Y. Kawamoto, L. Simionato, G. Steel, J.-K. Tsay.

    Efficient Padding Oracle Attacks on Cryptographic Hardware, in: CRYPTO, 2012, p. 608–625.
  • 23P. Bettassa Copet, A. Pironti, D. Pozza, R. Sisto, P. Vivoli.

    Visual Model-Driven Design, Verification and Implementation of Security Protocols, in: IEEE International Symposium on High Assurance Systems Engineering (HASE 12), IEEE Computer Security, 2012, Short paper.
  • 24K. Bhargavan, A. Delignat-Lavaud.

    Web-based Attacks on Host-Proof Encrypted Storage, in: 6th USENIX Workshop on Offensive Technologies (WOOT'12), Usenix, aug 2012.
  • 25B. Blanchet.

    Automatically Verified Mechanized Proof of One-Encryption Key Exchange, in: 25th IEEE Computer Security Foundations Symposium (CSF'12), Cambridge, MA, USA, IEEE, June 2012, p. 325–339.
  • 26D. Cadé, B. Blanchet.

    From Computationally-proved Protocol Specifications to Implementations, in: 7th International Conference on Availability, Reliability and Security (AReS 2012), Prague, Czech Republic, IEEE, August 2012, p. 65–74.
  • 27D. Cadé, B. Blanchet.

    Proved Generation of Implementations from Computationally-Secure Protocol Specifications, in: 2nd Conference on Principles of Security and Trust (POST 2013), Rome, Italy, D. Basin, J. Mitchell (editors), Lecture Notes on Computer Science, Springer Verlag, March 2013, to appear.
  • 28V. Cheval, B. Blanchet.

    Proving More Observational Equivalences with ProVerif, in: 2nd Conference on Principles of Security and Trust (POST 2013), Rome, Italy, D. Basin, J. Mitchell (editors), Lecture Notes on Computer Science, Springer Verlag, March 2013, to appear.
  • 29V. Cortier, G. Steel, C. Wiedling.

    Revoke and let live: a secure key revocation api for cryptographic devices, in: ACM Conference on Computer and Communications Security (CCS'12), 2012, p. 918-928.
  • 30R. Künnemann, G. Steel.

    YubiSecure? Formal Security Analysis Results for the Yubikey and YubiHSM, in: Preliminary Proceedings of the 8th Workshop on Security and Trust Management (STM'12), Pisa, Italy, A. Jøsang, P. Samarati (editors), September 2012.
  • 31M. J. May, K. Bhargavan.

    Towards Unified Authorization for Android, in: 5th International Symposium on Engineering Secure Software and Systems (ESSoS 2013), 2013, To appear.
  • 32M. Paiola, B. Blanchet.

    Verification of Security Protocols with Lists: from Length One to Unbounded Length, in: First Conference on Principles of Security and Trust (POST'12), Tallinn, Estonia, P. Degano, J. Guttman (editors), Lecture Notes on Computer Science, Springer Verlag, March 2012, vol. 7215, p. 69–88.

Scientific Books (or Scientific Book chapters)

  • 33B. Blanchet.

    Mechanizing Game-Based Proofs of Security Protocols, in: Software Safety and Security - Tools for Analysis and Verification, T. Nipkow, O. Grumberg, B. Hauptmann (editors), NATO Science for Peace and Security Series – D: Information and Communication Security, IOS Press, May 2012, vol. 33, p. 1–25, Proceedings of the summer school MOD 2011.

Internal Reports

  • 34R. Bardou, R. Focardi, Y. Kawamoto, L. Simionato, G. Steel, J.-K. Tsay.

    Efficient Padding Oracle Attacks on Cryptographic Hardware, Inria, April 2012, no RR-7944, 19 p.

    http://hal.inria.fr/hal-00691958
  • 35V. Cortier, G. Steel, C. Wiedling.

    Revoke and Let Live: A Secure Key Revocation API for Cryptographic Devices, Inria, July 2012, no RR-7949, 41 p.

    http://hal.inria.fr/hal-00721945
  • 36A. Pironti, P.-Y. Strub, K. Bhargavan.

    Identifying Website Users by TLS Traffic Analysis: New Attacks and Effective Countermeasures, Inria, September 2012, no RR-8067.

    http://hal.inria.fr/hal-00732449
  • 37B. Smyth, M. D. Ryan, L. Chen.

    Formal analysis of privacy in Direct Anonymous Attestation schemes, Cryptology ePrint Archive, 2012, no 2012/650.
References in notes
  • 38M. Abadi, B. Blanchet.

    Analyzing Security Protocols with Secrecy Types and Logic Programs, in: Journal of the ACM, January 2005, vol. 52, no 1, p. 102–146.
  • 39M. Abadi, B. Blanchet, C. Fournet.

    Just Fast Keying in the Pi Calculus, in: ACM Transactions on Information and System Security (TISSEC), July 2007, vol. 10, no 3, p. 1–59.
  • 40J. Bengtson, K. Bhargavan, C. Fournet, A. D. Gordon, S. Maffeis.

    Refinement types for secure implementations, in: ACM Trans. Program. Lang. Syst., 2011, vol. 33, no 2, 8 p.
  • 41K. Bhargavan, C. Fournet, A. D. Gordon.

    Modular Verification of Security Protocol Code by Typing, in: ACM Symposium on Principles of Programming Languages (POPL'10), 2010, p. 445–456.
  • 42K. Bhargavan, C. Fournet, A. D. Gordon, N. Swamy.

    Verified Implementations of the Information Card Federated Identity-Management Protocol, in: Proceedings of the ACM Symposium on Information, Computer and Communications Security (ASIACCS'08), ACM Press, 2008, p. 123–135.
  • 43B. Blanchet, M. Abadi, C. Fournet.

    Automated Verification of Selected Equivalences for Security Protocols, in: Journal of Logic and Algebraic Programming, February–March 2008, vol. 75, no 1, p. 3–51.
  • 44B. Blanchet.

    An Efficient Cryptographic Protocol Verifier Based on Prolog Rules, in: 14th IEEE Computer Security Foundations Workshop (CSFW'01), 2001, p. 82–96.
  • 45B. Blanchet.

    Automatic Verification of Correspondences for Security Protocols, in: Journal of Computer Security, July 2009, vol. 17, no 4, p. 363–434.
  • 46B. Blanchet, A. Podelski.

    Verification of Cryptographic Protocols: Tagging Enforces Termination, in: Theoretical Computer Science, March 2005, vol. 333, no 1-2, p. 67–90, Special issue FoSSaCS'03..
  • 47M. Bortolozzo, M. Centenaro, R. Focardi, G. Steel.

    Attacking and Fixing PKCS#11 Security Tokens, in: Proceedings of the 17th ACM Conference on Computer and Communications Security (CCS'10), Chicago, Illinois, USA, ACM Press, October 2010, p. 260-269.
  • 48J. Clulow.

    On the Security of PKCS#11, in: CHES, 2003, p. 411-425.
  • 49S. Delaune, S. Kremer, G. Steel.

    Formal Analysis of PKCS#11 and Proprietary Extensions, in: Journal of Computer Security, November 2010, vol. 18, no 6, p. 1211-1245.
  • 50D. Dolev, A. Yao.

    On the security of public key protocols, in: IEEE Transactions on Information Theory, 1983, vol. IT–29, no 2, p. 198–208.
  • 51C. Fournet, M. Kohlweiss, P.-Y. Strub.

    Modular Code-Based Cryptographic Verification, in: ACM Conference on Computer and Communications Security, 2011.
  • 52R. Needham, M. Schroeder.

    Using encryption for authentication in large networks of computers, in: Communications of the ACM, 1978, vol. 21, no 12, p. 993–999.
  • 53N. Swamy, J. Chen, C. Fournet, P.-Y. Strub, K. Bhargavan, J. Yang.

    Secure distributed programming with value-dependent types, in: 16th ACM SIGPLAN international conference on Functional Programming, 2011, p. 266-278.


previous Previous | up Home