Seventh Workshop on
Formal and Computational Cryptography
FCC 2011

Program

9:00-10:00 - Session 1: Invited Talk

• Formal and Computer-Aided Design of Secure Distributed Applications (Abstract)
  Matteo Maffei

10:00-10:30 - Coffee Break

10:30-12:30 - Session 2: Automated Verification (chair: Hubert Comon-Lundh)

• Modular Cryptographic Verification by Typing (Abstract)
  Cedric Fournet and Markulf Kohlweiss
• Cryptographically Verified Design and Implementation of a Distributed Key Manager (Abstract)
  Tolga Acar, Cedric Fournet and Dan Shumow
  
• Cryptographic Types for Homomorphic Encryptions (Abstract)
  Cedric Fournet, Jeremy Planul, and Tamara Rezk
  
• Automated Proof for Formal Indistinguishability and Its Applications (Abstract)
  Long Ngo, Colin Boyd, and Juan Gonzalez Nieto

12:30-14:00 - Lunch Break

14:00-15:30 - Session 3: Proof Techniques (chair: Dominique Unruh)

• A composable computational soundness notion (Abstract)
  Véronique Cortier and Bogdan Warinschi
• A second look at Shoup's lemma (Abstract)
  Bruno Blanchet
• Computational Soundness without Symbolic Length Function (Abstract)
  Hubert Comon-Lundh, Masami Hagiya, Yusuke Kawamoto, and Hideki Sakurada

15:30-16:00 - Coffee Break

16:00-17:30 - Session 4: Computational Soundness for New Primitive (chair: Véronique Cortier)

• Computational Soundness of Passively Secure Encryption in Presence of Active Adversaries (Abstract)
  Sebastian Meiser
  
• Computational Soundness of Malleable Zero-Knowledge Proofs (Abstract)
  Michael Backes and Esfandiar Mohammadi
  
• Computationally Sound Abstraction and Verification of Secure Multi-Party Computations (Abstract)
  Michael Backes, Matteo Maffei, and Esfandiar Mohammadi