Affiliated Workshop — Eurocrypt 2026
Low-Complexity Cryptography
Workshop
Saturday, May 9, 2026
About
An exciting trend in cryptographic research is the development of cryptographic primitives of very low complexity. While low-complexity cryptography typically focuses on “simple” cryptographic primitives — e.g., one-way functions (OWFs), pseudorandom generators (PRGs) or functions (PRFs), collision-resistance hash functions (CRHs), etc. — the impact of these results is arguably most profound in the design of modern, high-powered cryptography. For example, constructions of indistinguishability obfuscation rely on local PRGs, and secure multiparty computation relies on simple PRGs/PRFs to allow for efficient distributed evaluation, such as in the context of oblivious PRFs or pseudorandom correlation generators/functions. Low-complexity cryptographic constructions also play important roles in (fast) fully homomorphic encryption and zero-knowledge proofs.
Confirmed speakers are Benny Applebaum, Youlong Ding, Lorenzo Grassi, Yuval Ishai, and Simona Samardjiska.
Registration
All participants must be registered through the
Eurocrypt website.
Tentative Program
| 9:30 – 9:45 | Introduction
Organizers: Lisa Kohl & Nicolas Resch
|
| 9:45 – 10:30 | Presentation |
| 10:30 – 11:00 | Coffee break |
| 11:00 – 11:45 | Presentation |
| 11:45 – 12:30 | Presentation |
| 12:30 – 14:00 | Lunch break |
| 14:00 – 14:45 | Presentation |
| 14:45 – 15:30 | Presentation |
| 15:30 – 16:00 | Coffee break |
| 16:00 – 16:45 | Presentation |
| 16:45 – 17:15 | Interactive Session and Closing Remarks
Lisa Kohl & Nicolas Resch
|
Organizers
Support
VI.Veni.222.347 and VI.Veni.222.348.
Lisa Kohl 