Compositionality of game-based secure key-exchange
(Warinschi, B / Bristol)
|
|
|
|
Constructive cryptography
(Maurer, U / ETH Zürich)
|
|
|
|
Meta-Reductions
(Fischlin, M / TU, Darmstadt)
|
|
|
|
Multi-key Homomorphic Encryption and Applications
(Vaikuntanathan, V / Toronto)
|
|
|
|
Rational Proofs
(Micali, S / MIT)
|
|
|
|
Verifying Crypto Protocols Written in C
(Gordon, A / Microsoft Research)
|
|
|
|
Foundations of Garbled Circuits
(Rogaway, P / UC, Davis)
|
|
|
|
From crypto verif specifications to computationally secure implementations of protocols
(Blanchet, B / ENS)
|
|
|
|
How to Compute in the Presence of Leakage
(Rothblum, G / Microsoft Research)
|
|
|
|
Pairing-based succinct non-interactive zero-knowledge arguments
(Groth, J / UCL)
|
|
|
|
Quadratic Span Programs for Succinct NIZKs without PCPs
(Gentry, C / IBM Research)
|
|
|
|
Definitions of Predicate Encryption
(Persiano, P / Salerno)
|
|
|
|
Efficient Smooth Projective Hash Functions and Applications
(Pointcheval, D / ENS - Paris)
|
|
|
|
How provably secure are cryptographic primitives used in practice
(Kiltz, E / Ruhr-Universität Bochum)
|
|
|
|
Leakage-Resilient Zero-Knowledge Proofs and their Applications
(Sahai, A / UCLA)
|
|
|
|
Semantic security for the wiretap channel
(Tessaro, S / Massachusetts Institute of Technology)
|
|
|
|
Where Delegation Meets Einstein
(Tauman Kalai, Y)
|
|
|
|
Computer-aided security proofs
(Barthe, G / Madrid Institute of Advanced Studies)
|
|
|
|
Cryptographically verified implementation of TLS 1.2
(Fournet, C / Microsoft Research)
|
|
|
|
How to fake auxiliary input
(Pietrzak, C / IST Austria)
|
|
|
|
Overcoming Weak Expectations
(Dodis, Y / New York)
|
|
|
|
The Privacy of the Analyst and The Power of the State
(Naor, M / Weizmann Institute of Science)
|
|
|
|
Zero Knowledge Proofs and Nuclear Disarmament
(Barak, B / Microsoft Research New England)
|
|
|
| Back to top of page |
|
