I am a cryptography researcher, currently working on efficient zero-knowledge proofs, especially those based on lattice assumptions or error-correcting codes. I am also interested in number theory, game theory, and quantum information theory. I am currently working as a researcher in the Foundational Cryptography group at IBM Research, Zürich.

Previously, I have worked as a postdoctoral researcher with Professor Alessandro Chiesa at UC Berkeley, and with Dr Vadim Lyubashevsky at IBM Research, Zürich. I was a PhD student at University College London, supervised by Professor Jens Groth and Professor Sarah Meiklejohn. I also studied Mathematics to Part III at Clare College, University of Cambridge.

Jonathan Bootle

jbt at zurich dot ibm dot com

Researcher in the Foundational Cryptography Group in the Security Department at IBM Research Zürich.

Publications

See also Google Scholar and DBLP.

Publisher links are often non-free. Links to free preprints and e-prints are included where available. Presentation slides and other extra materials are sometimes included.

  • Orthus: Practical Sublinear Batch-Verification of Lattice Relations from Standard Assumptions.
    Madalina Bolboceanu, Jonathan Bootle, Vadim Lyubashevsky, Antonio Merino-Gallardo and Gregor Seiler.
    IACR ePrint
  • Lookup Arguments over Rings and Applications to Batch-Verification of RAM Programs.
    Jonathan Bootle, Julia Guskind, Sikhar Patranabis and Katerina Sotiraki.
    IACR ePrint
  • Efficient Verifiable Mixnets from Lattices, Revisited.
    Jonathan Bootle, Vadim Lyubashevsky and Antonio Merino-Gallardo.
    PKC 2025
    IACR ePrint Slides
  • Formal Verification of the Sumcheck Protocol.
    Azucena Garvía Bosshard, Jonathan Bootle and Christoph Sprenger.
    CSF 2024
    arXiv
  • Generalized Fuzzy Password-Authenticated Key Exchange from Error Correcting Codes.
    Jonathan Bootle, Sebastian Faller, Julia Hesse, Kristina Hostáková and Johannes Ottenhues.
    ASIACRYPT 2023
    IACR ePrint
  • Lattice-Based Succinct Arguments for NP with Polylogarithmic-Time Verification.
    Jonathan Bootle, Alessandro Chiesa and Katerina Sotiraki.
    CRYPTO 2023
    IACR ePrint Video
  • A Framework for Practical Anonymous Credentials from Lattices.
    Jonathan Bootle, Vadim Lyubashevsky, Ngoc Khanh Nguyen and Alessandro Sorniotti.
    CRYPTO 2023
    IACR ePrint Video
  • Linear-Time Probabilistic Proofs with Sublinear Verification for Algebraic Automata Over Every Field.
    Jonathan Bootle, Alessandro Chiesa, Ziyi Guan and Siqi Liu.
    IACR ePrint
  • DualDory: Logarithmic-verifier linkable ring signatures through preprocessing.
    Jonathan Bootle, Kaoutar Elkhiyaoui, Julia Hesse and Yacov Manevich.
    ESORICS 2022
    IACR ePrint
  • Gemini: Elastic SNARKs for Diverse Environments.
    Jonathan Bootle, Alessandro Chiesa, Yuncong Hu and Michele Orrù.
    EUROCRYPT 2022
    IACR ePrint Slides Video Video
  • Zero-Knowledge IOPs with Linear-Time Prover and Polylogarithmic-Time Verifier.
    Jonathan Bootle, Alessandro Chiesa and Siqi Liu.
    EUROCRYPT 2022
    IACR ePrint Slides Video Video
  • More Efficient Amortization of Exact Zero-Knowledge Proofs for LWE.
    Jonathan Bootle, Vadim Lyubashevsky, Ngoc Khanh Nguyen and Gregor Seiler.
    ESORICS 2021
    IACR ePrint Slides
  • Sumcheck Arguments and their Applications.
    Jonathan Bootle, Alessandro Chiesa and Katerina Sotiraki.
    CRYPTO 2021
    IACR ePrint Slides Video
  • Linear-Time Arguments with Sublinear Verification from Tensor Codes.
    Jonathan Bootle, Alessandro Chiesa and Jens Groth.
    TCC 2020
    IACR ePrint Slides Video
  • A non-PCP Approach to Succinct Quantum-Safe Zero-Knowledge.
    Jonathan Bootle, Vadim Lyubashevsky, Ngoc Khanh Nguyen and Gregor Seiler.
    CRYPTO 2020
    IACR ePrint Video Video
  • Compact Privacy Protocols from Post-Quantum and Timed Classical Assumptions.
    Jonathan Bootle, Anja Lehmann, Vadim Lyubashevsky and Gregor Seiler
    PQCrypto 2020
    HPI
  • Algebraic Techniques for Short(er) Exact Lattice-Based Zero-Knowledge Proofs.
    Jonathan Bootle, Vadim Lyubashevsky and Gregor Seiler
    CRYPTO 2019
    IACR ePrint Video
  • LWE Without Modular Reduction and Improved Side-Channel Attacks Against BLISS.
    Jonathan Bootle, Claire Delaplace, Thomas Espitau, Pierre-Alain Fouque and Mehdi Tibouchi
    ASIACRYPT 2018
    IACR ePrint
  • Arya: Nearly Linear-Time Zero-Knowledge Proofs for Correct Program Execution.
    Jonathan Bootle, Andrea Cerulli, Jens Groth, Sune K. Jakobsen and Mary Maller
    ASIACRYPT 2018
    IACR ePrint Slides
  • Sub-linear Lattice-Based Zero-Knowledge Arguments for Arithmetic Circuits.
    Carsten Baum, Jonathan Bootle, Andrea Cerulli, Rafaël del Pino, Jens Groth and Vadim Lyubashevsky
    CRYPTO 2018
    IACR ePrint Slides Video
  • Bulletproofs: Short Proofs for Confidential Transactions and More.
    Benedikt Bünz, Jonathan Bootle, Dan Boneh, Andrew Poelstra, Pieter Wuille and Greg Maxwell
    S&P 2018
    IACR ePrint Video
  • Cryptanalysis of Compact-LWE.
    Jonathan Bootle, Mehdi Tibouchi and Keita Xagawa
    CT-RSA 2018
    IACR ePrint Slides
  • Efficient Batch Zero-Knowledge Arguments for Low-Degree Polynomials.
    Jonathan Bootle and Jens Groth
    PKC 2018
    IACR ePrint Slides
  • Linear-Time Zero-Knowledge Proofs for Arithmetic Circuit Satisfiability.
    Jonathan Bootle, Andrea Cerulli, Essam Ghadafi, Jens Groth, Mohammad Hajiabadi and Sune K. Jacobsen
    ASIACRYPT 2017
    IACR ePrint Slides Video
  • Efficient Zero-Knowledge Proof Systems
    Jonathan Bootle, Andrea Cerulli, Pyrros Chaidos and Jens Groth
    FOSAD 2015
    Preprint
  • Foundations of Fully Dynamic Group Signatures
    Jonathan Bootle, Andrea Cerulli, Pyrros Chaidos, Essam Ghadafi and Jens Groth
    ACNS 2016
    IACR ePrint
  • Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting.
    Jonathan Bootle, Andrea Cerulli, Pyrros Chaidos, Jens Groth and Christophe Petit
    EUROCRYPT 2016
    IACR ePrint Slides
  • Short Accountable Ring Signatures Based on DDH.
    Jonathan Bootle, Andrea Cerulli, Pyrros Chaidos, Essam Ghadafi, Jens Groth and Christophe Petit
    ESORICS 2015
    IACR ePrint Slides

Teaching

I am teaching the Autumn 2026 course "263-4665-00L, Zero-Knowledge Proofs" at ETH Zurich. The catalogue entry for the course is here. ETH students can access the Moodle page and resources for the course here. The course covers roughly the following topics:

  • Definitions of interactive and zero-knowledge proofs and arguments, and commitment schemes;
  • First proof systems for graph isomorphism, graph non-isomorphism and graph-three-colouring;
  • Sigma protocols and their parallel, AND and OR compositions;
  • Constructions of sigma protocols based on the discrete logarithm assumption, SIS assumption, and MPC-in-the-head;
  • Constructions of folding schemes (if time permits).
  • The Fiat-Shamir transformation for sigma protocols;
  • The sumcheck and GKR protocols;
  • Interactive Oracle Proofs for NP statements;
  • Polynomial commitment schemes and a construction based on the discrete logarithm assumption; and
  • Constructions of non-interactive zero-knowledge proofs from pairings (if time permits).

I used to help to teach COMPGA18 Cryptanalysis at UCL. Here are some materials from the course as taught in January 2017.

Notes

Useful notes, to include a variety of topics in the future.

Old Lecture Notes

My old, mostly handwritten Cambridge maths notes. I am responsible for any errors or omissions.

Part IA

Part IB

Part II

Part III

Links

Plain Academic