Jonathan Bootle

Orcid: 0000-0003-3582-3368

Affiliations:
  • IBM Research, Zurich, Switzerland


According to our database1, Jonathan Bootle authored at least 31 papers between 2015 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Efficient Verifiable Mixnets from Lattices, Revisited.
Proceedings of the Public-Key Cryptography - PKC 2025, 2025

2024
The Sumcheck Protocol.
Arch. Formal Proofs, 2024

Formal Verification of the Sumcheck Protocol.
Proceedings of the 37th IEEE Computer Security Foundations Symposium, 2024

2023
A Framework for Practical Anonymous Credentials from Lattices.
Proceedings of the Advances in Cryptology - CRYPTO 2023, 2023

Lattice-Based Succinct Arguments for NP with Polylogarithmic-Time Verification.
Proceedings of the Advances in Cryptology - CRYPTO 2023, 2023

Generalized Fuzzy Password-Authenticated Key Exchange from Error Correcting Codes.
Proceedings of the Advances in Cryptology - ASIACRYPT 2023, 2023

2022
Linear-Time Probabilistic Proofs with Sublinear Verification for Algebraic Automata Over Every Field.
IACR Cryptol. ePrint Arch., 2022

Zero-Knowledge IOPs with Linear-Time Prover and Polylogarithmic-Time Verifier.
Proceedings of the Advances in Cryptology - EUROCRYPT 2022 - 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Trondheim, Norway, May 30, 2022

Gemini: Elastic SNARKs for Diverse Environments.
Proceedings of the Advances in Cryptology - EUROCRYPT 2022 - 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Trondheim, Norway, May 30, 2022

DualDory: Logarithmic-Verifier Linkable Ring Signatures Through Preprocessing.
Proceedings of the Computer Security - ESORICS 2022, 2022

2021
More Efficient Amortization of Exact Zero-Knowledge Proofs for LWE.
Proceedings of the Computer Security - ESORICS 2021, 2021

Sumcheck Arguments and Their Applications.
Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

2020
Zero-Knowledge Succinct Arguments with a Linear-Time Prover.
IACR Cryptol. ePrint Arch., 2020

Linear-Time Arguments with Sublinear Verification from Tensor Codes.
Proceedings of the Theory of Cryptography - 18th International Conference, 2020

Compact Privacy Protocols from Post-quantum and Timed Classical Assumptions.
Proceedings of the Post-Quantum Cryptography - 11th International Conference, 2020

A Non-PCP Approach to Succinct Quantum-Safe Zero-Knowledge.
Proceedings of the Advances in Cryptology - CRYPTO 2020, 2020

2019
Designing efficient zero-knowledge proofs in the ideal linear commitment model.
PhD thesis, 2019

Algebraic Techniques for Short(er) Exact Lattice-Based Zero-Knowledge Proofs.
Proceedings of the Advances in Cryptology - CRYPTO 2019, 2019

2018
Nearly Linear-Time Zero-Knowledge Proofs for Correct Program Execution.
IACR Cryptol. ePrint Arch., 2018

Bulletproofs: Short Proofs for Confidential Transactions and More.
Proceedings of the 2018 IEEE Symposium on Security and Privacy, 2018

Efficient Batch Zero-Knowledge Arguments for Low Degree Polynomials.
Proceedings of the Public-Key Cryptography - PKC 2018, 2018

Cryptanalysis of Compact-LWE.
Proceedings of the Topics in Cryptology - CT-RSA 2018, 2018

Sub-linear Lattice-Based Zero-Knowledge Arguments for Arithmetic Circuits.
Proceedings of the Advances in Cryptology - CRYPTO 2018, 2018

LWE Without Modular Reduction and Improved Side-Channel Attacks Against BLISS.
Proceedings of the Advances in Cryptology - ASIACRYPT 2018, 2018

Arya: Nearly Linear-Time Zero-Knowledge Proofs for Correct Program Execution.
Proceedings of the Advances in Cryptology - ASIACRYPT 2018, 2018

2017
Cryptanalysis of Compact-LWE.
IACR Cryptol. ePrint Arch., 2017

Linear-Time Zero-Knowledge Proofs for Arithmetic Circuit Satisfiability.
Proceedings of the Advances in Cryptology - ASIACRYPT 2017, 2017

2016
Efficient Zero-Knowledge Proof Systems.
Proceedings of the Foundations of Security Analysis and Design VIII, 2016

Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting.
Proceedings of the Advances in Cryptology - EUROCRYPT 2016, 2016

Foundations of Fully Dynamic Group Signatures.
Proceedings of the Applied Cryptography and Network Security, 2016

2015
Short Accountable Ring Signatures Based on DDH.
Proceedings of the Computer Security - ESORICS 2015, 2015


  Loading...