Lattices Meet Hashes: Recent Advances in Post-Quantum Zero-Knowledge Proofs

Zero-knowledge proofs are a powerful cryptographic tool which has found numerous real-world applications in e.g. confidential transactions, anonymous credentials, e-voting and blockchain. Recently, due to the significant progress in building quantum computers, there has been tremendous interest in constructing such protocols from quantum-safe assumptions.

The goal of this workshop is to share the current state-of-the-art results in the area of post-quantum zero-knowledge proofs and bring the two (seemingly separate) research communities together: lattice- and hash-based proof systems. Indeed, many recent lattice-based constructions (even unknowingly) borrow key techniques from hash-based proof systems, e.g., the split-and-fold approach or the sumcheck protocol. We thus believe the two areas have a lot in common, and by sharing the knowledge in the related fields, we, as a cryptographic research community, can build more efficient and practical quantum-safe zero-knowledge protocols.


Confirmed speakers:
Thomas Attema, CWI and TNO
Jonathan Bootle, IBM Research Zurich
Sarah Bordage, EPFL
Muhammed Esgin, Monash University
Russell W. F. Lai, Aalto University
Vadim Lyubashevsky, IBM Research Zurich
Giulio Malavolta, Max Planck Institute
Gregor Seiler, IBM Research Zurich
Nick Spooner, Warwick University
Akira Takahashi, University of Edinburgh
David Wu, University of Texas


Coming soon


Click here

Start date & time


End date & time



Bernoulli Center


Ngoc Khanh Nguyen, EPFL
Gal Arnon, Weizmann Institute