program
| Monday, May 31 | |
|---|---|
| 08:30–11:00 | Registration |
| 09:30–10:30 | Coffee |
| 10:50–11:00 | Welcome and Opening Remarks |
| 11:00–12:40 | Cryptosystems I — Alexander May |
| »On Ideal Lattices and Learning with Errors over Rings
[slides]
V. Lyubashevsky, C. Peikert, and O. Regev | |
| »Fully Homomorphic Encryption over the Integers
[slides]
M. van Dijk, C. Gentry, S. Halevi, and V. Vaikuntanathan | |
| »Converting Pairing-Based Cryptosystems from Composite-Order Groups to Prime-Order Groups
[slides]
D. M. Freeman | |
| »Fully Secure Functional Encryption: Attribute-Based Encryption and (Hierarchical) Inner Product Encryption
[slides]
A. Lewko, T. Okamoto, A. Sahai, K. Takashima, and B. Waters | |
| 12:45–14:15 | Lunch |
| 14:15–15:30 | Obfuscation and Side Channel Security — Helena Handschuh |
| »Secure Obfuscation for Encrypted Signatures
[slides]
S. Hada | |
| »Public-Key Encryption in the Bounded-Retrieval Model
[slides]
J. Alwen, Y. Dodis, M. Naor, G. Segev, S. Walfish, and D. Wichs | |
| »Protecting Circuits from Leakage: The Computationally-Bounded and Noisy Cases
[slides]
S. Faust, T. Rabin, L. Reyzin, E. Tromer, and V. Vaikuntanathan | |
| 15:30–16:00 | Coffee |
| 16:00–17:40 | 2-Party Protocols — Aggelos Kiayias |
| »Partial Fairness in Secure Two-Party Computation
[slides]
S. D. Gordon and J. Katz | |
| »Secure Message Transmission with Small Public Discussion
[slides]
J. Garay, C. Givens, and R. Ostrovsky | |
| »Efficient Device-Independent Quantum Key Distribution
[slides]
E. Hänggi, R. Renner, and S. Wolf | |
| »On the Impossibility of Three-Move Blind Signature Schemes
[slides]
M. Fischlin and D. Schröder | |
| 18:00–20:30 | Reception |
| 20:45 | Buses to Nice |
| Tuesday, June 1 | |
| 09:30–11:10 | Cryptanalysis — Lars R. Knudsen |
| »New Generic Algorithms for Hard Knapsacks
[slides]
N. Howgrave-Graham and A. Joux | |
| »Lattice Enumeration using Extreme Pruning
[slides]
N. Gama, P. Q. Nguyen, and O. Regev | |
| »Algebraic Cryptanalysis of McEliece Variants with Compact Keys
[slides]
J.-C. Faugère, A. Otmani, L. Perret, and J.-P. Tillich | |
| »Key Recovery Attacks of Practical Complexity on AES-256 Variants with up to 10 Rounds
[slides]
A. Biryukov, O. Dunkelman, N. Keller, D. Khovratovich, and A. Shamir | |
| 11:15–11:45 | Coffee |
| 11:45–12:45 | 2010 IACR Distinguished Lecture — Bart Preneel |
| »Cryptography between Wonderland and Underland
Moti Yung | |
| 12:45–14:15 | Lunch |
| 14:15–15:30 | Automated Tools and Formal Methods — Helger Lipmaa |
| »Automatic Search for Related-Key Differential Characteristics in Byte-Oriented Block Ciphers: Application to AES, Camellia, Khazad, and Others
[slides]
A. Biryukov and I. Nikolić | |
| »Plaintext-Dependent Decryption: A Formal Security Treatment of SSH-CTR
[slides]
K. G. Paterson and G. J. Watson | |
| »Computational Soundness, co-Induction, and Encryption Cycles
[slides]
D. Micciancio | |
| 15:30–16:00 | Coffee |
| 16:00–17:15 | Models and Proofs — David Pointcheval |
| »Encryption Schemes Secure Against Chosen-Ciphertext Selective Opening Attacks
[slides]
S. Fehr, D. Hofheinz, E. Kiltz, and H. Wee | |
| »Cryptographic Agility and its Relation to Circular Encryption
T. Acar, M. Belenkiy, M. Bellare, and D. Cash | |
| »Bounded Key-Dependent Message Security
[slides]
B. Barak, I. Haitner, D. Hofheinz, and Y. Ishai | |
| 17:30–18:30 | IACR Members' Meeting |
| 18:30–21:00 | Rump Session — Daniel J. Bernstein and Tanja Lange |
| 21:15 | Buses to Nice |
| Wednesday, June 2 | |
| 09:30–10:45 | Multiparty Protocols — Berry Schoenmakers |
| »Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography
[slides]
I. Damgård, Y. Ishai, and M. Krøigaard | |
| »Adaptively Secure Broadcast
[slides]
M. Hirt and V. Zikas | |
| »Universally Composable Quantum Multi-Party Computation
D. Unruh | |
| 10:45–11:15 | Coffee |
| 11:15–12:30 | Cryptosystems II — Jean-Sébastien Coron |
| »A Simple BGN-Type Cryptosystem from LWE
[slides]
C. Gentry, S. Halevi, and V. Vaikuntanathan | |
| »Bonsai Trees, or How to Delegate a Lattice Basis
[slides]
D. Cash, D. Hofheinz, E. Kiltz, and C. Peikert | |
| »Efficient Lattice (H)IBE in the Standard Model
[slides]
S. Agrawal, D. Boneh, and X. Boyen | |
| 12:30–14:15 | Lunch |
| 19:00–22:00 | Social Event |
| 22:15 | Buses to Monaco |
| Thursday, June 3 | |
| 09:30–10:45 | Hash and MAC — Anne Canteaut |
| »Multi-Property-Preserving Domain Extension using Polynomial-Based Modes of Operation
[slides]
J. Lee and J. Steinberger | |
| »Stam's Collision Resistance Conjecture
J. Steinberger | |
| »Universal One-Way Hash Functions via Inaccessible Entropy
I. Haitner, T. Holenstein, O. Reingold, S. Vadhan, and H. Wee | |
| 10:45–11:15 | Coffee |
| 11:15–12:30 | Foundational Primitives — Krzysztof Pietrzak |
| »Constant-Round Non-Malleable Commitments from Sub-Exponential One-Way Functions
R. Pass and H. Wee | |
| »Constructing Verifiable Random Functions with Large Input Spaces
[slides]
S. Hohenberger and B. Waters | |
| »Adaptive Trapdoor Functions and Chosen-Ciphertext Security
E. Kiltz, P. Mohassel, and A. O'Neill | |
| 12:30–12:35 | Closing Remarks |