Blanchet, Bruno - Département d'Informatique, École Normale Supérieure

• d'Informatique, Introduction
• Reconstruction of Attacks against Cryptographic Protocols # Xavier Allamigeon
• Automated Verification of Selected Equivalences for Security Protocols Bruno Blanchet
• Abstracting Cryptographic Protocols by Prolog Rules
• Analyzing Security Protocols with Secrecy Types and Logic Programs
• Design and Implementation of a Special-Purpose Static Program Analyzer
• Computer-Assisted Veri cation of a Protocol for Certi ed Email
• An Efficient Cryptographic Protocol Verifier Based on Prolog Rules Bruno Blanchet
• Veri cation of Cryptographic Protocols: Tagging Enforces Termination
• Automatic Verification of Correspondences for Security Protocols
• A Static Analyzer for Large Safety-Critical Software (Extended Abstract)
• A Computationally Sound Mechanized Prover for Security Protocols Bruno Blanchet
• Design and Implementation of a Special-Purpose Static Program Analyzer
• Escape Analysis for Java TM . Theory and Practice BRUNO BLANCHET
• Automated Security Proofs with Sequences of Games
• Computationally Sound Mechanized Proofs of Correspondence Assertions Bruno Blanchet
• A Computationally Sound Mechanized Prover for Security Protocols Bruno Blanchet #+
• Automated Security Proofs with Sequences of Games
• Automated Verification of Selected Equivalences for Security Protocols #
• Automatic Verification of Cryptographic Protocols: A Logic Programming Approach
• Refining Computationally Sound Mechanized Proofs for Kerberos B. Blanchet
• Automated Formal Analysis of a Protocol for Secure File Sharing on Untrusted Storage
• Escape Analysis for Object Oriented Languages. Application to Bruno BLANCHET
• From Secrecy to Authenticity in Security Protocols ?
• Just Fast Keying in the Pi Calculus Martn Abadi 1 , Bruno Blanchet 2 , and Cedric Fournet 3
• Just Fast Keying in the Pi Calculus Mart n Abadi
• A Calculus for Secure Mobility Bruno Blanchet 1 and Benjamin Aziz 2
• Reconstruction of Attacks against Cryptographic Protocols Xavier Allamigeon
• I N F O R M A T I K Automatic Proof of Strong
• Analyzing Security Protocols with Secrecy Types and Logic Programs
• Computationally Sound Mechanized Proofs for Basic and Public-key Kerberos
• A Static Analyzer for Large SafetyCritical Software (Extended Abstract)
• The computational and decisional Diffie-Hellman assumptions in CryptoVerif
• N ffi attribu'e par la biblioth`eque ann'ee : 2000
• Secrecy Types for Asymmetric Communication Mart'in Abadi 1 and Bruno Blanchet 2
• Prolongement de stage de DEA Garbage Collection statique
• Rapport de magist`ere (Magist`ere de Math'ematiques Fondamentales et Appliqu'ees et
• Security Protocols: From Linear to Classical Logic by Abstract Interpretation
• Automatic Proof of Strong Secrecy for Security Protocols Bruno Blanchet
• Veri cation of Cryptographic Protocols: Tagging Enforces Termination
• Escape Analysis: Correctness Proof, Implementation and Experimental Results Bruno Blanchet
• ComputerAssisted Verification of a Protocol for Certified Email #
• Automatic Verification of Cryptographic Protocols: A Logic Programming Approach
• Universite Paris-Dauphine Habilitation `a Diriger des Recherches
• A Computationally Sound Mechanized Prover for Security Protocols Bruno Blanchet
• Using Horn Clauses for Analyzing Security Protocols
• A Computationally Sound Mechanized Prover for Security Protocols Bruno Blanchet
• A second look at Shoup's lemma Bruno Blanchet
• Mechanizing Game-Based Proofs of Security Protocols
• Security Protocol Verification: Symbolic and Computational Models