Difference between revisions of "The Joint EasyCrypt-F*-CryptoVerif School 2014"

From prosecco
(Sponsors)
(Invited speakers: Announced the confirmed invited speakers)
Line 29: Line 29:
  
 
= Invited speakers =
 
= Invited speakers =
TBA
+
* [http://www.lsv.ens-cachan.fr/~comon/ Hubert Comon] (LSV, CNRS & ENS de Cachan) - Computationally Complete Symbolic Attacker
 +
* [http://www.loria.fr/~cortier/ Véronique Cortier] (CNRS & LORIA Nancy) - Using F* to Verify E-Voting Protocols
 +
* [http://www.sps.cs.uni-saarland.de/maffei/ Matteo Maffei] (Saarland University) - Linear Refinement Type Systems
 +
* [http://www.cs.ut.ee/~unruh/ Dominique Unruh] (University of Tartu) - Computational Soundness for Refinement Types
 +
* ''maybe more''
  
 
= Organization =
 
= Organization =

Revision as of 08:43, 17 August 2014

Dates: 24-28 November

Place: INRIA office in Paris

23 Avenue d'Italie, 75013 Paris (map)

Abstract

The school is aimed at teaching participants how to use three state-of-the-art security verification tools: EasyCrypt, F*, and CryptoVerif, as well as give participants a glimpse of the formal foundations behind these tools.

EasyCrypt is a toolset for reasoning about relational properties of probabilistic computations with adversarial code. Its main application is the construction and verification of game-based cryptographic proofs. EasyCrypt was used to prove the security of complex cryptographic constructions, including the Cramer-Shoup encryption scheme, the Merkle-Damgaard iterative hash function design, and the ZAEP encryption scheme. More recently, it has been used for proving the security of protocols based on garbled circuits, and for the proof of security for authenticated key-exchange protocols and derived proofs under weaker assumptions.

F* is a new ML-like functional programming language designed with program verification in mind. It has a powerful refinement type-checker that discharges verification conditions using the Z3 SMT solver. F* has been successfully used to verify nearly 50,000 lines of code, ranging from cryptographic protocol implementations to web browser extensions, and from cloud-hosted web applications to key parts of the F* compiler itself. The newest version on F* erases to both F# and OCaml, on which it is based. It also compiles securely to JavaScript, enabling safe interoperability with arbitrary, untrusted JavaScript libraries.

CryptoVerif is an automatic protocol prover sound in the computational model. It can prove secrecy and correspondences (e.g. authentication). The generated proofs are by sequences of games, as used by cryptographers. CryptoVerif was successfully used for security proofs of FDH signatures, Kerberos, OEKE, and the SSH transport layer protocol.

Lecturers and tutorial aides

Participants will attend lectures and hands-on tutorials, under the guidance of members from the tools' developer teams:

Invited speakers

  • Hubert Comon (LSV, CNRS & ENS de Cachan) - Computationally Complete Symbolic Attacker
  • Véronique Cortier (CNRS & LORIA Nancy) - Using F* to Verify E-Voting Protocols
  • Matteo Maffei (Saarland University) - Linear Refinement Type Systems
  • Dominique Unruh (University of Tartu) - Computational Soundness for Refinement Types
  • maybe more

Organization

Anna Bednarik, Cătălin Hriţcu (contact), Pierre-Yves Strub

Schedule

  • Monday, 24 November: EasyCrypt
  • Tuesday, 25 November: EasyCrypt
  • Wednesday, 26 November: F*
  • Thursday, 27 November: Lectures on F* + CryptoVerif (morning) + F* tutorial (afternoon)
  • Friday, 28 November: Invited speakers (morning) + CryptoVerif lecture + tutorial

Hardware and software

Roughly half of the time of the school is devoted to hands-on exercise sessions and tutorials. Participants are expected to bring their own laptop with EasyCrypt, F*, and CryptoVerif installed. More details e.g. about precise versions and setup will be communicated by email to the registered participants.

Registration

  • There are no registration fees for participants.
  • Registration deadline: 1 September, 2014.
  • The number of participants is limited.
  • You will be informed of the outcome of the selection process shortly after the registration deadline.
  • Please fill in this registration form

Financial support

  • We try to offer grants covering the travel and/or accommodation costs of the participants who need it.
  • The accommodation support is for double hotel rooms we will directly book and which will be shared by two participants each.
  • The travel support comes in the form of reimbursement for the costs of a trip participants plan and initially pay themselves, provided these costs stay within certain bounds we establish in advance.
  • Participants can apply for financial support via the registration form above.
  • A number of the grants for UK attendees are subsidized by CryptoForma; the application process is the same for all grants (part of the normal registration form above).

Social events

We will organize a social dinner and a social lunch that are free for all registered participants.

Travel, food, and accommodation

Participants are expected to make their own travel, food, and accommodation arrangements. Paris offers many good alternatives. The only exceptions are for invited speakers, for the shared hotel rooms (see financial support above), and for the social events (see above).

Sponsors

This school is financially supported by the Prosecco team at INRIA Paris-Rocquencourt. The EPSRC CryptoForma network on formal methods and cryptography sponsors a number of grants for UK attendees.