| 2026 | CRYPTO | Orthus: Practical Sublinear Batch-Verification of Lattice Relations from Standard Assumptions. | Madalina Bolboceanu, Jonathan Bootle, Vadim Lyubashevsky, Antonio Merino-Gallardo, Gregor Seiler |
| 2025 | PKC | Efficient Verifiable Mixnets from Lattices, Revisited. | Jonathan Bootle, Vadim Lyubashevsky, Antonio Merino-Gallardo |
| 2023 | ASIACRYPT | Generalized Fuzzy Password-Authenticated Key Exchange from Error Correcting Codes. | Jonathan Bootle, Sebastian H. Faller, Julia Hesse, Kristina Hostkov, Johannes Ottenhues |
| 2023 | CRYPTO | Lattice-Based Succinct Arguments for NP with Polylogarithmic-Time Verification. | Jonathan Bootle, Alessandro Chiesa, Katerina Sotiraki |
| 2023 | CRYPTO | A Framework for Practical Anonymous Credentials from Lattices. | Jonathan Bootle, Vadim Lyubashevsky, Ngoc Khanh Nguyen, Alessandro Sorniotti |
| 2022 | ESORICS | DualDory: Logarithmic-Verifier Linkable Ring Signatures Through Preprocessing. | Jonathan Bootle, Kaoutar Elkhiyaoui, Julia Hesse, Yacov Manevich |
| 2022 | EuroCrypt | Gemini: Elastic SNARKs for Diverse Environments. | Jonathan Bootle, Alessandro Chiesa, Yuncong Hu, Michele Orr |
| 2022 | EuroCrypt | Zero-Knowledge IOPs with Linear-Time Prover and Polylogarithmic-Time Verifier. | Jonathan Bootle, Alessandro Chiesa, Siqi Liu |
| 2021 | CRYPTO | Sumcheck Arguments and Their Applications. | Jonathan Bootle, Alessandro Chiesa, Katerina Sotiraki |
| 2021 | ESORICS | More Efficient Amortization of Exact Zero-Knowledge Proofs for LWE. | Jonathan Bootle, Vadim Lyubashevsky, Ngoc Khanh Nguyen, Gregor Seiler |
| 2020 | CRYPTO | A Non-PCP Approach to Succinct Quantum-Safe Zero-Knowledge. | Jonathan Bootle, Vadim Lyubashevsky, Ngoc Khanh Nguyen, Gregor Seiler |
| 2020 | PQCrypto | Compact Privacy Protocols from Post-quantum and Timed Classical Assumptions. | Jonathan Bootle, Anja Lehmann, Vadim Lyubashevsky, Gregor Seiler |
| 2020 | TCC | Linear-Time Arguments with Sublinear Verification from Tensor Codes. | Jonathan Bootle, Alessandro Chiesa, Jens Groth |
| 2019 | CRYPTO | Algebraic Techniques for Short(er) Exact Lattice-Based Zero-Knowledge Proofs. | Jonathan Bootle, Vadim Lyubashevsky, Gregor Seiler |
| 2018 | ASIACRYPT | Arya: Nearly Linear-Time Zero-Knowledge Proofs for Correct Program Execution. | Jonathan Bootle, Andrea Cerulli, Jens Groth, Sune K. Jakobsen, Mary Maller |
| 2018 | ASIACRYPT | LWE Without Modular Reduction and Improved Side-Channel Attacks Against BLISS. | Jonathan Bootle, Claire Delaplace, Thomas Espitau, Pierre-Alain Fouque, Mehdi Tibouchi |
| 2018 | CRYPTO | Sub-linear Lattice-Based Zero-Knowledge Arguments for Arithmetic Circuits. | Carsten Baum, Jonathan Bootle, Andrea Cerulli, Rafal del Pino, Jens Groth, Vadim Lyubashevsky |
| 2018 | PKC | Efficient Batch Zero-Knowledge Arguments for Low Degree Polynomials. | Jonathan Bootle, Jens Groth |
| 2018 | SP | Bulletproofs: Short Proofs for Confidential Transactions and More. | Benedikt Bnz, Jonathan Bootle, Dan Boneh, Andrew Poelstra, Pieter Wuille, Gregory Maxwell |
| 2017 | ASIACRYPT | Linear-Time Zero-Knowledge Proofs for Arithmetic Circuit Satisfiability. | Jonathan Bootle, Andrea Cerulli, Essam Ghadafi, Jens Groth, Mohammad Hajiabadi, Sune K. Jakobsen |
| 2016 | ACNS | Foundations of Fully Dynamic Group Signatures. | Jonathan Bootle, Andrea Cerulli, Pyrros Chaidos, Essam Ghadafi, Jens Groth |
| 2016 | EuroCrypt | Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting. | Jonathan Bootle, Andrea Cerulli, Pyrros Chaidos, Jens Groth, Christophe Petit |
| 2015 | ESORICS | Short Accountable Ring Signatures Based on DDH. | Jonathan Bootle, Andrea Cerulli, Pyrros Chaidos, Essam Ghadafi, Jens Groth, Christophe Petit |