CryptoForma: 0th Meeting

CryptoForma home

After the formation of the initial consortium, and before funding was announced, a preliminary CryptoForma meeting was held in January 2009, hosted and sponsored by Microsoft Research Cambridge, organised by George Danezis and Andy Gordon.

We had a series of stimulating presentations, a fine dinner at King's College, and built up considerable enthusiasm for the project.

pic at the Cambridge meet dinner

Main speakers and titles (there were also some short talks):

Dan Grundy (Kent) "Calculational proofs for one-way functions"
Misha Aizatulin (OU) "Balanced Contract Signing"
James Heather (Surrey) "Re-encryption in a symmetric setting"
Eerke Boiten (Kent) "The bottom-up formal methods perspective"
MSR Talk: Ross Smith (MS) "Dude, whereÆs my boss? Using Serious Games to improve software development productivity"
Mark Ryan (Birmingham) "TPM Protocols and their Verification"
Jan Juerjens (MSRC/OU) "Modularity and refinement in the verification of crypto-protocols"
Aybek Mukhamedov (Birmingham) "Formal analysis of the Trusted Platform Module"
Alfredo Pironti (Torino) "Towards provably correct black-box monitoring of security protocols" (slides, poster)
Cédric Fournet (MSRC) "A Cryptographic Compiler for Information-Flow Security"
Karthik Bhargavan (MSRC) "Computational Verification of TLS Implementations"
Liqun Chen (HP) "Parsing ambiguities in authentication and key establishment protocols"
Tom Chothia (Birmingham) "Measuring Information Leakage Using Network Information Theory"
Bogdan Warinschi (Bristol) "A compositional soundness result"
Kenny Paterson (RHUL) "Limitations of provable security with respect to crypto specifications and implementations"

For the programme and pictures, see also here (Andy Gordon's blog).

collage of dinner pics