Conference Program (also available in pdf A4, A5 or A6)
Sunday, April 30
| 18:30-21:00 | Welcome reception at Campus Jussieu 4 place Jussieu 75005 Paris, France |
Monday, May 1
| Slot | Track A | Track B |
|---|---|---|
| 8:50 - 8:55 | Opening remarks | |
| 9:00-10:15 | Lattice attacks and constructions 1 Chair: Leo Ducas |
Obfuscation and functional encryption Chair: Daniel Wichs |
| Revisiting Lattice Attacks on overstretched NTRU parameters Paul Kirchner, Pierre-Alain Fouque (slides) | Robust transforming combiners from indistinguishability obfuscation to functional encryption Prabhanjan Ananth, Aayush Jain, Amit Sahai (slides) | |
| Short generators without quantum computers: the case of multiquadratics Jens Bauch, Daniel J. Bernstein, Henry de Valence, Tanja Lange, Christine van Vredendaal (slides) | From Minicrypt to Obfustopia via Private-Key Functional Encryption Ilan Komargodski, Gil Segev (slides) | |
| Computing generator in cyclotomic integer rings Jean-François Biasse, Thomas Espitau, Pierre-Alain Fouque, Alexandre Gélin, Paul Kirchner (slides) | Projective Arithmetic Functional Encryption and Indistinguishability Obfuscation From Degree-5 Multilinear Maps Prabhanjan Ananth, Amit Sahai (slides) | |
| 10:15-10:20 | Track-switch break | |
| 10:20-11:20 | Discrete logarithm Chair: Robert Granger |
Multiparty computation 1 Chair: Stefan Dziembowski |
| Computation of a 768-bit prime field discrete logarithm Thorsten Kleinjung, Claus Diem, Arjen K. Lenstra, Christine Priplata, Colin Stahlke (slides) | Improved Private Set Intersection against Malicious Adversaries Peter Rindal, Mike Rosulek (slides) | |
| A kilobit hidden SNFS discrete logarithm computation Joshua Fried, Pierrick Gaudry, Nadia Heninger, Emmanuel Thomé (slides) | Formal Abstractions for Attested Execution Secure Processors Rafael Pass, Elaine Shi, Florian Tramèr (slides) | |
| 11:10-11:40 | Coffee break | |
| 11:40-12:40 | Invited talk (Chair: Jean-Sebastien Coron) | |
| Advances in computer-aided cryptography Gilles Barthe (IMDEA Software Institute, Spain) (slides) | ||
| 12:40-14:15 | Lunch | |
| 14:15-15:05 | Lattice attacks and constructions 2 Chair: Nicolas Gama |
Universal composability Chair: Vlad Kolesnikov |
| One-Shot Verifiable Encryption from Lattices Vadim Lyubashevsky, Gregory Neven (slides) | Concurrently composable security with shielded super-polynomial simulators Brandon Broadnax, Nico Döttling, Gunnar Hartung, Jörn Müller-Quade, Matthias Nagel (slides) | |
| Short Stickelberger Class Relations and application to Ideal-SVP Ronald Cramer, Léo Ducas, Benjamin Wesolowski (slides) | Unconditional UC-Secure Computation with (Stronger-Malicious) PUFs Saikrishna Badrinarayanan, Dakshita Khurana, Rafail Ostrovsky, Ivan Visconti (slides) | |
| 15:05-15:10 | Track-switch break | |
| 15:10-16:00 | Lattice attacks and constructions 3 Chair: Nicolas Gama |
Zero knowledge 1 Chair: Rafail Ostrovsky |
| Private Puncturable PRFs From Standard Lattice Assumptions Dan Boneh, Sam Kim, Hart Montgomery (slides) | Amortized Complexity of Zero-Knowledge Proofs Revisited: Achieving Linear Soundness Slack Ronald Cramer, Ivan Damgård, Chaoping Xing, Chen Yuan (slides) | |
| Constraint-hiding constrained PRFs for NC1 from LWE Ran Canetti, Yilei Chen (slides) | Sublinear Zero-Knowledge Arguments for RAM Programs Payman Mohassel, Mike Rosulek, Alessandra Scafuro (slides) | |
| 16:00-16:30 | Coffee break | |
| 16:30-17:20 | Side-channel attacks and countermeasures Chair: Jean-Sebastien Coron |
Functional encryption 1 Chair: Nuttapong Attrapadung |
| Parallel Implementations of Masking Schemes and the Bounded Moment Leakage Model Gilles Barthe, François Dupressoir, Sebastian Faust, Benjamin Grégoire, François-Xavier Standaert, Pierre-Yves Strub (slides) | Multi-Input Inner-Product Functional Encryption from Pairings Michel Abdalla, Romain Gay, Mariana Raykova, Hoeteck Wee (slides) | |
| How Fast Can Higher-Order Masking Be in Software? Dahmun Goudarzi, Matthieu Rivain (slides) | Simplifying Design and Analysis of Complex Predicate Encryption Schemes Shashank Agrawal, Melissa Chase (slides) | |
| 17:20-17:25 | Track-switch break | |
| 17:25-18:15 | Elliptic curves Chair: San Ling |
Functional encryption 2 Chair: Eyal Kushilevitz |
| Twisted μ4-normal form for elliptic curves David Kohel (slides) | On Removing Graded Encodings from Functional Encryption Nir Bitansky, Huijia Lin, Omer Paneth (slides) | |
| Efficient compression of SIDH public keys Craig Costello, David Jao, Patrick Longa, Michael Naehrig, Joost Renes, David Urbanik (slides) | Functional Encryption: Deterministic to Randomized Functions from Simple Assumptions Shashank Agrawal, David Wu (slides) | |
Tuesday, May 2
| Slot | Track A | Track B |
|---|---|---|
| 9:00-10:15 | Lattice attacks and constructions 4 Chair: Leo Ducas |
Multiparty computation 2 Chair: Abhi Shelat |
| Random Sampling Revisited: Lattice Enumeration with Discrete Pruning Yoshinori Aono, Phong Q. Nguyen (slides) | Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation Elette Boyle, Niv Gilboa, Yuval Ishai | |
| On dual lattice attacks against small-secret LWE and parameter choices in HElib and SEAL Martin R. Albrecht (slides) | On the Exact Round Complexity of Self-Composable Two-Party Computation Sanjam Garg, Susumu Kiyoshima, Omkant Pandey (slides) | |
| Small CRT-Exponent RSA Revisited Atsushi Takayasu, Yao Lu, Liquiang Peng (slides) | High-Throughput Secure Three-Party Computation for Malicious Adversaries and an Honest Majority Jun Furukawa, Yehuda Lindell, Ariel Nof, Or Weinstein (slides) | |
| 10:15-10:20 | Track-switch break | |
| 10:20-11:10 | Symmetric cryptanalysis 1 Chair: Maria Naya-Plasencia |
Zero knowledge 2 Chair: Miyako Ohkubo |
| Conditional Cube Attack on Reduced-Round Keccak Sponge Function Senyang Huang, Xiaoyun Wang, Guangwu Xu, Meiqin Wang, Jingyuan Zhao | Removing the Strong RSA Assumption from Arguments over the Integers Geoffroy Couteau, Thomas Peters, David Pointcheval (slides) | |
| New Collision Attacks on Round-Reduced Keccak Kexin Qiao, Ling Song, Meicheng Liu, Jian Guo (slides) | Magic Adversaries Versus Individual Reduction: Science Wins Either Way Yi Deng (slides) | |
| 11:10-11:40 | Coffee break | |
| 11:40-12:40 | Invited talk (Chair: Jesper Buus Nielsen) | |
| Living Between the Ideal and Real Worlds Nigel Smart (University of Bristol) (slides) | ||
| 18:30- | Rump session | |
Wednesday, May 3
| Slot | Track A | Track B |
|---|---|---|
| 9:00-9:50 | Provable Security for Symmetric Cryptography 1 Chair: Eike Kiltz |
Security models 1 Chair: Krzysztof Pietrzak |
| The Multi-User Security of Double Encryption Viet Tung Hoang, Stefano Tessaro (slides) | Cryptography with Updates Prabhanjan Ananth, Aloni Cohen, Abhishek Jain (slides) | |
| Public-Seed Pseudorandom Permutations Pratik Soni, Stefano Tessaro (slides) | Fixing Cracks in the Concrete: Random Oracles with Auxiliary Input, Revisited Yevgeniy Dodis, Siyao Guo, Jonathan Katz (slides) | |
| 9:50-9:55 | Track-switch break | |
| 9:55-10:45 | Blockchain Chair: Brent Waters |
Security models 2 Chair: Krzysztof Pietrzak |
| Decentralized Anonymous Micropayments Alessandro Chiesa, Matthew Green, Jingcheng Liu, Peihan Miao, Ian Miers, Pratyush Mishra (slides) | Toward Fine-Grained Blackbox Separations Between Semantic and Circular-Security Notions Mohammad Hajiabadi, Bruce M. Kapron (slides) | |
| Analysis of the Blockchain Protocol in Asynchronous Networks Rafael Pass, Lior Seeman, abhi shelat (slides) | A Note on Perfect Correctness by Derandomization Nir Bitansky, Vinod Vaikuntanathan (slides) | |
| 10:45-11:15 | Coffee break | |
| 11:15-12:05 | Provable Security for Symmetric Cryptography 2 Chair: Aggelos Kiayias |
Memory hard functions Chair: Ilya Mironov |
| Modifying an Enciphering Scheme after Deployment Paul Grubbs, Thomas Ristenpart, Yuval Yarom (slides) | Depth-Robust Graphs and Their Cumulative Memory Complexity Joël Alwen, Jeremiah Blocki, Krzysztof Pietrzak (slides) | |
| Separating Semantic and Circular Security for Symmetric-Key Bit Encryption from the Learning with Errors Assumption Rishab Goyal, Venkata Koppula, Brent Waters (slides) |
Scrypt is Maximally Memory-Hard
Best Paper Award Joël Alwen, Binyi Chen, Krzysztof Pietrzak, Leonid Reyzin, Stefano Tessaro (slides) |
|
| 12:05-14:00 | Lunch | |
| 14:00-14:50 | Symmetric-key constructions Chair: Daniel Wichs |
Obfuscation 1 Chair: Nir Bitansky |
| Quantum-Secure Symmetric-Key Cryptography Based on Hidden Shifts Gorjan Alagic, Alexander Russell (slides) | Patchable Indistinguishability Obfuscation: iO for Evolving Software Prabhanjan Ananth, Abhishek Jain, Amit Sahai (slides) | |
| Boolean Searchable Symmetric Encryption with Worst-Case Sub-Linear Complexity Seny Kamara, Tarik Moataz (slides) | Breaking the Sub-Exponential Barrier in Obfustopia Sanjam Garg, Omkant Pandey, Akshayaram Srinivasan, Mark Zhandry (slides) | |
| 14:50-15:20 | Coffee break | |
| 15:20-16:10 | Symmetric cryptanalysis 2 Chair: Maria Naya-Plasencia |
Obfuscation 2 Chair: Nir Bitansky |
| New Impossible Differential Search Tool from Design and Cryptanalysis Aspects Yu Sasaki, Yosuke Todo (slides) | Lattice-Based SNARGs and Their Application to More Efficient Obfuscation Dan Boneh, Yuval Ishai, Amit Sahai, David J. Wu (slides) | |
| A New Structural-Differential Property of 5-Round AES Lorenzo Grassi, Christian Rechberger, Sondre Rønjom (slides) | Cryptanalyses of Candidate Branching Program Obfuscators Yilei Chen, Craig Gentry, Shai Halevi (slides) | |
| 16:15-17:15 | IACR Membership Meeting | |
| 19:00-00:00 |
Banquet at Pavillon Dauphine Place du Maréchal de Lattre de Tassigny 75116 PARIS DIRECTIONS |
|
Thursday, May 4
| Slot | Track A | Track B |
|---|---|---|
| 9:00-10:15 | Quantum cryptography Chair: Fabrice Benhamouda |
Multiparty computation 3 Chair: Jesper Buus Nielsen |
| Quantum Authentication and Encryption with Key Recycling Serge Fehr, Louis Salvail (slides) | Faster Secure Two-Party Computation in the Single-Execution Setting Xiao Wang, Alex J. Malozemoff, Jonathan Katz | |
| Quantum authentication with key recycling Christopher Portmann (slides) | Non-Interactive Secure 2PC in the Offline/Online and Batch Settings Payman Mohassel, Mike Rosulek (slides) | |
| Relativistic (or 2-prover 1-round) zero-knowledge protocol for NP secure against quantum adversaries André Chailloux, Anthony Leverrier | Hashing Garbled Circuits for Free Xiong Fan, Chaya Ganesh, Vladimir Kolesnikov (slides) | |
| 10:15-10:45 | Coffee break | |
| 10:45-12:00 | Public-key encryption and key-exchange Chair: Fabrice Benhamouda |
Multiparty computation 4 Chair: Jesper Buus Nielsen |
| Adaptive partitioning Dennis Hofheinz (slides) | Computational integrity with a public random string from quasi-linear PCPs Eli Ben-Sasson, Iddo Ben-Tov, Alessandro Chiesa, Ariel Gabizon, Daniel Genkin, Matan Hamilis, Evgenya Pergament, Michael Riabzev, Mark Silberstein, Eran Tromer, Madars Virza (slides) | |
| 0-RTT Key Exchange with Full Forward Secrecy Felix Günther, Britta Hale, Tibor Jager, Sebastian Lauer (slides) | Ad Hoc PSM Protocols: Secure Computation without Coordination Amos Beimel, Yuval Ishai, Eyal Kushilevitz (slides) | |
| Topology-Hiding Computation Beyond Logarithmic Diameter Adi Akavia, Tal Moran (slides) | ||