Formal and Computational Cryptographic Proofs

• A. Gordon: Verifying Crypto Protocols Written in C

• V. Vaikuntanathan: Multi-key Homomorphic Encryption and Applications

• B. Warinschi: Compositionality of game-based secure key-exchange

• S. Micali: Rational Proofs

• U. Maurer: Constructive Cryptography

• P. Rogaway: Garbled Circuits

• M. Fischlin: Meta-Reductions

• J. Groth: Pairing-based Succinct Non-interactive Zero-Knowledge Arguments

• B. Blanchet: From CryptoVerif Specifications to Computationally Secure Implementations of Protocols

• C. Gentry: Quadratic Span Programs for Succinct NIZKs without PCPs

• G. Rothblum: How to Compute in the Presence of Leakage

• P. Persiano: Definitions of Predicate Encryption

• E. Kiltz: How Provably Secure are Cryptographic Primitives used in Practice?

• D. Pointcheval: Efficient Smooth Projective Hash Functions and Applications

• A. Sahai: Leakage-Resilient Zero-Knowledge Proofs and their Applications.

• Y. Tauman Kalai: Where Delegation Meets Einstein

• S. Tessaro: Semantic Security for the Wiretap Channel

• Shafi Goldwasser: Pseudo Deterministic Algorithms and Applications to Cryptography

• M. Naor: T.B.A.

• K. Pietrzak: How to Fake Auxiliary Input

• B. Barak: Zero Knowledge Proofs and Nuclear Disarmament

• C. Fournet: Modular Cryptographic Verification for an Implementation of TLS 1.2

• Y. Dodis : Overcoming Weak Expectations

• G. Barthe: Computer-aided security proofs