Conference Program

Google calendar: html, ical

Sunday, May 8

17:00-20:00	Welcome Reception Aula der Wissenschaften(map)

Monday, May 9

9:00 - 9:15	Welcome
9:15-10:15	Invited Talk Protecting Transport Layer Security from Legacy Vulnerabilities Karthikeyan Bhargavan [slides]
10:15-10:40	Coffee break
	(Pseudo)Randomness	Lattice-based Schemes
10:40-11:05	Provably Robust Sponge-Based PRNGs and KDFs Peter Gaži, Stefano Tessaro	Zero-Knowledge Arguments for Lattice-Based Accumulators: Logarithmic-Size Ring Signatures and Group Signatures without Trapdoors Benoît Libert, San Ling, Khoa Nguyen, Huaxiong Wang [slides]
11:05-11:30	Reusable Fuzzy Extractors for Low-Entropy Distributions Ran Canetti, Benjamin Fuller, Omer Paneth, Leonid Reyzin, Adam Smith [slides]	Adaptively Secure Identity-Based Encryption from Lattices with Asymptotically Shorter Public Parameters Shota Yamada [slides]
11:30-11:35	Track-switch break
	LPN/LWE	Zero-Knowledge I
11:35-12:00	Provably Weak Instances of Ring-LWE Revisited Wouter Castryck, Ilia Iliashenko, Frederik Vercauteren	Online/Offline OR Composition of Sigma Protocols Michele Ciampi, Giuseppe Persiano, Alessandra Scafuro, Luisa Siniscalchi, Ivan Visconti [slides]
12:00-12:25	Faster Algorithms for Solving LPN Bin Zhang, Lin Jiao, Mingsheng Wang	Constant-round Leakage-resilient Zero-knowledge from Collision Resistance Susumu Kiyoshima [slides]
12:25-14:00	Lunch Break
	Cryptanalysis I.	Pseudorandom Functions
14:00-14:25	Provable Security Evaluation of Structures against Impossible Differential and Zero Correlation Linear Cryptanalysis Bing Sun, Meicheng Liu, Jian Guo, Vincent Rijmen, Ruilin Li [slides]	Constrained Pseudorandom Functions for Unconstrained Inputs Apoorvaa Deshpande, Venkata Koppula, Brent Waters [slides]
14:25-14:50	Polytopal Cryptanalysis Tyge Tiessen	Pseudorandom Functions in Almost Constant Depth from Low-Noise LPN Yu Yu, John Steinberger [slides]
14:50-14:55	Track-switch break
	Masking	Multi-Party Computation I
14:55-15:20	From Improved Leakage Detection to the Detection of Points of Interests in Leakage Traces François Durvaux, François-Xavier Standaert	Secure Computation from Elastic Noisy Channels Dakshita Khurana, Hemanta K. Maji, Amit Sahai [slides]
15:20-15:45	Improved Masking for Tweakable Blockciphers with Applications to Authenticated Encryption Robert Granger, Philipp Jovanovic, Bart Mennink, Samuel Neves	All Complete Functionalities are Reversible Dakshita Khurana, Daniel Kraschewski, Hemanta K. Maji, Manoj Prabhakaran, Amit Sahai [slides]
15:45-16:10	Coffee break
	Fully Homomorphic Encryption	Separations
16:10-16:35	Sanitization of FHE Ciphertexts Léo Ducas, Damien Stehlé	Limits on the Power of Hierarchical Identity-Based Encryption Mohammad Mahmoody, Ameer Mohammed
16:35-17:00	Towards Stream Ciphers for Efficient FHE with Low-Noise Ciphertexts Pierrick Méaux, Anthony Journault, François-Xavier Standaert, Claude Carlet [slides]	On the Impossibility of Tight Cryptographic Reductions Christoph Bader, Tibor Jager, Yong Li, Sven Schäge [slides]
19:30-22:00	Cocktail Reception and IACR Award Ceremony Vienna Town Hall(map) [slides]

Tuesday, May 10

	Best Paper and Honorable Mentions
9:00-9:25	Tightly CCA-Secure Encryption without Pairings Romain Gay, Dennis Hofheinz, Eike Kiltz, Hoeteck Wee
9:25-9:50	Indistinguishability Obfuscation from Constant-Degree Graded Encoding Schemes Huijia Lin
9:50-10:15	Essentially Optimal Robust Secret Sharing with Maximal Corruptions Allison Bishop, Valerio Pastro, Rajmohan Rajaraman and Daniel Wichs
10:15-10:40	Coffee break
	Cryptanalysis II	Zero-Knowledge II
10:40-11:05	Improved Differential-Linear Cryptanalysis of 7-round Chaskey with Partitioning Gaëtan Leurent [slides]	On the Size of Pairing-based Non-interactive Arguments Jens Groth [slides]
11:05-11:30	Reverse-Engineering the S-Box of Streebog, Kuznyechik and STRIBOBr1 Alex Biryukov, Léo Perrin, Aleksei Udovenko	Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting Jonathan Bootle, Andrea Cerulli, Pyrros Chaidos, Jens Groth, Christophe Petit
11:30-11:35	Track-switch break
	Number Theory	Protocols
11:35-12:00	Complete addition formulas for prime order elliptic curves Joost Renes, Craig Costello, Lejla Batina [slides]	On the Complexity of Scrypt and Proofs of Space in the Parallel Random Oracle Model Joël Alwen, Binyi Chen, Chethan Kamath, Vladimir Kolmogorov, Krzysztof Pietrzak, Stefano Tessaro [slides]
12:00-12:25	New Complexity Trade-Offs for the (Multiple) Number Field Sieve Algorithm in Non-Prime Fields Palash Sarkar and Shashank Singh [slides]	Anonymous Traitor Tracing: How to Embed Arbitrary Information in a Key Ryo Nishimaki, Daniel Wichs, Mark Zhandry
12:25-14:00	Lunch Break
	Hash functions	Round Complexity
14:00-14:25	Freestart collision for full SHA-1 Marc Stevens, Pierre Karpman, Thomas Peyrin	Unconditionally Secure Computation with Reduced Interaction Adi Rosen, Ivan Damgård, Jesper Buus Nielsen, Rafail Ostrovsky
14:25-14:50	New Attacks on the Concatenation and XOR Hash Combiners Itai Dinur [slides]	The Exact Round Complexity of Secure Computation Sanjam Garg, Pratyay Mukherjee, Omkant Pandey, Antigoni Polychroniadou ebr/> [slides] [slides]
14:50-14:55	Track-switch break
14:55-15:45	Tutorial (Part I) Securing Cryptography Implementations in Embedded Systems Emmanuel Prouff
15:45-16:10	Coffee break
16:10-17:00	Tutorial (Part II) Securing Cryptography Implementations in Embedded Systems Emmanuel Prouff
18:30-19:30	IACR Membership Meeting Aula der Wissenschaften(map)
19:30-22:00	Rump Session Aula der Wissenschaften(map)

Wednesday, May 11

9:15-10:15	Invited Talk The Future of Cryptography Bart Preneel [slides]
10:15-10:40	Coffee break
	Multilinear Maps	Commitments
10:40-11:05	Cryptanalysis of the New CLT Multilinear Maps over the Integers Jung Hee Cheon, Pierre-Alain Fouque, Changmin Lee, Brice Minaud, Hansol Ryu [slides]	On the Composition of Two-Prover Commitments, and Applications to Multi-Round Relativistic Commitments Serge Fehr, Max Fillinger
11:05-11:30	Cryptanalysis of GGH Map Yupu Hu, Huiwen Jia [slides]	Computationally binding quantum commitments Dominique Unruh [slides]
11:30-11:35	Track-switch break
	Message Authentication Codes	Lattices
11:35-12:00	Hash-Function based PRFs: AMAC and its Multi-User Security Mihir Bellare, Daniel J. Bernstein, Stefano Tessaro	Structural Lattice Reduction: Generalized Worst-Case to Average-Case Reductions and Homomorphic Cryptosystems Nicolas Gama, Malika Izabachene, Phong Q. Nguyen, Xiang Xie [slides]
12:00-12:25	On the Influence of Message Length in PMAC's Security Bounds Atul Luykx, Bart Preneel, Alan Szepieniec, Kan Yasuda [slides]	Recovering Short Generators of Principal Ideals in Cyclotomic Rings Ronald Cramer, Léo Ducas, Chris Peikert, Oded Regev [slides]
12:25-14:00	Lunch Break
	Attacks on SSL/TLS	Leakage
14:00-14:25	Lucky Microseconds: A Timing Attack on Amazon's s2n Implementation of TLS Martin R. Albrecht, Kenneth G. Paterson	Circuit Compilers with $O(1/log(n))$ Leakage Rate Marcin Andrychowicz, Stefan Dziembowski, Sebastian Faust
14:25-14:50	An Analysis of OpenSSL's Random Number Generator Falko Strenzke	Randomness Complexity of Private Circuits for Multiplication Sonia Belaïd, Fabrice Benhamouda, Alain Passelègue, Emmanuel Prouff, Adrian Thillard, Damien Vergnaud [slides]
14:50-14:55	Track-switch break
	Real-world Protocols	Indifferentiability
14:55-15:20	Safely exporting keys from secure channels: On the security of EAP-TLS and TLS Key Exporters Christina Brzuska, Håkon Jacobsen, Douglas Stebila	10-Round Feistel is Indifferentiable from an Ideal Cipher Dana Dachman-Soled, Jonathan Katz, Aishwarya Thiruvengadam
15:20-15:45	Valiant's Universal Circuit is Practical Ágnes Kiss, Thomas Schneider [slides]	Indifferentiability of Confusion-Diffusion Networks Yevgeniy Dodis, Martijn Stam, John Steinberger, Liu Tianren [slides]
15:45-16:10	Coffee break
	Robust Designs	Multi-Party Computation II
16:10-16:35	Nonce-Based Cryptography: Retaining Security when Randomness Fails Mihir Bellare, Björn Tackmann [slides]	Fair and Robust Multi-Party Computation using a Global Transaction Ledger Aggelos Kiayias, Hong-Sheng Zhou, Vassilis Zikas
16:35-17:00	Honey Encryption Beyond Message Recovery Security Joseph Jaeger, Thomas Ristenpart, Qiang Tang	Two Round Multiparty Computation via Multi-Key FHE Pratyay Mukherjee, Daniel Wichs [slides]
	Conference Dinner Weingut Fuhrgassl-Huber(map) Buses leave from Schwedenplatz at 18:00.

Thursday, May 12

9:15-10:15	Invited Talk Engineering Code Obfuscation Christian Collberg
10:15-10:40	Coffee break
	Lattice Reduction	Obfuscation
10:40-11:05	Improved Progressive BKZ Algorithms and their Precise Cost Estimation by Sharp Simulator Yoshinori Aono, Yuntao Wang, Takuya Hayashi, Tsuyoshi Takagi [slides]	Post-Zeroizing Obfuscation: new mathematical tools, and the case of evasive circuits Saikrishna Badrinarayanan, Eric Miles, Amit Sahai, Mark Zhandry
11:05-11:30	Practical, Predictable Lattice Basis Reduction Daniele Micciancio and Michael Walter	New Negative Results on Differing-Inputs Obfuscation Mihir Bellare, Igors Stepanovs, Brent Waters [slides]
11:30-11:35	Track-switch break
	Automated Analysis, Functional Encryption, and Non-malleable Codes
11:35-12:00	Automated Unbounded Analysis of Cryptographic Constructions in the Generic Group Model Miguel Ambrona, Gilles Barthe, Benedikt Schmidt
12:00-12:25	Multi-Input Functional Encryption in the Private-Key Setting: Stronger Security from Weaker Assumptions Zvika Brakerski, Ilan Komargodski, Gil Segev
12:25-12:50	Non-Malleable Codes for Bounded Depth Circuits Marshall Ball, Dana Dachman-Soled, Mukul Kulkarni, Tal Malkin
12:50-13:00	Closing Remarks
13:30-15:30	CFRG Meeting

Conference Program

Sunday, May 8

Monday, May 9

Tuesday, May 10

Wednesday, May 11

Thursday, May 12