Tuesday, September 15

15:00-16:00 Signatures, Encryption, and Algebraic Constructions.
Chair Helger Lipmaa

A Simple and Efficient Lattice CCA-Secure KEM in the Standard Model
Xavier Boyen, Malika Izabachène and Qinyi Li
[Paper] [Slides] [Video]

Double-Authentication-Preventing Signatures in the Standard Model
Dario Catalano, Georg Fuchsbauer and Azam Soleimanian
[Paper] [Slides] [Video]

Efficient Signatures on Randomizable Ciphertexts
Balthazar Bauer and Georg Fuchsbauer
[Paper] [Video]

Fast Threshold ECDSA with Honest Majority
Ivan Damgård, Thomas P. Jakobsen, Jesper Buus Nielsen,
Jakob Illeborg Pagterand and Michael Bæksvang Østergaard
[Paper] [Slides] [Video]

Short Threshold Dynamic Group Signatures
Jan Camenisch, Manu Drijvers, Anja Lehmann, Gregory Neven and Patrick Towa
[Paper] [Slides] [Video]

16:00-16:10 Break

16:10-17:10 Theory and Lower Bounds I.
Chair Pino Persiano

Anonymous Symmetric-Key Communication 
Fabio Banfi and Ueli Maurer 
[Paper] [Slides] [Video]

Cryptographic Divergences: New Techniques and New Applications
Marc Abboud and Thomas Prest 
[Paper] [Slides] [Video]

Multi-Client Inner-Product Functional Encryption in the Random-Oracle Model  
Michel Abdalla, Florian Brouse, Hugo Marival, David Pointcheval,
Azam Soleimanian and Hendrik Waldner  
[Paper] [Slides] [Video]

Secret Sharing Lower Bound: Either Reconstruction is Hard or Shares are Long  
Kasper Green Larsen and Mark Simkin  
[Paper] [Video]

Separating Symmetric and Asymmetric Password-Authenticated Key Exchange  
Julia Hesse  
[Paper] [Slides] [Video]

17:10-17:20 Break

17:20-18:30 Theory and Lower Bounds II.
Chair: Mike Rosulek

Key-and-Argument-Updatable QA-NIZKs
Helger Lipmaa
[Paper] [Slides] [Video]

On Adaptive Security of Delayed-Input Sigma Protocols and Fiat-Shamir NIZKs
Michele Ciampi, Roberto Parisella, and Daniele Venturi
[Paper] [Slides] [Video]

The Round Complexity of Secure Computation Against Covert Adversaries
Arka Rai Choudhuri, Vipul Goyal, and Abhishek Jain
[Paper] [Slides] [Video]

Unprovability of Leakage-Resilient Cryptography Beyond the Information-Theoretic Limit
Rafael Pass
[Paper] [Slides] [Video]

Impossibility of Strong KDM Security with Auxiliary Input
Cody Freitag, Ilan Komargodski, and Rafael Pass
[Paper] [Slides] [Video]

On the Query Complexity of Constructing PRFs from Non-adaptive PRFs
Pratik Soni and Stefano Tessaro
[Paper] [Slides] [Video]