Jonathan Bootle

Orcid: 0000-0003-3582-3368

Affiliations:
  • IBM Research, Zurich, Switzerland


According to our database1, Jonathan Bootle authored at least 30 papers between 2015 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Formal Verification of the Sumcheck Protocol.
CoRR, 2024

The Sumcheck Protocol.
Arch. Formal Proofs, 2024

2023
A Framework for Practical Anonymous Credentials from Lattices.
IACR Cryptol. ePrint Arch., 2023

Generalized Fuzzy Password-Authenticated Key Exchange from Error Correcting Codes.
IACR Cryptol. ePrint Arch., 2023

DualDory: Logarithmic-Verifier Linkable Ring Signatures through Preprocessing.
IACR Cryptol. ePrint Arch., 2023

Lattice-Based Succinct Arguments for NP with Polylogarithmic-Time Verification.
IACR Cryptol. ePrint Arch., 2023

2022
Gemini: Elastic SNARKs for Diverse Environments.
IACR Cryptol. ePrint Arch., 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

2021
Sumcheck Arguments and their Applications.
IACR Cryptol. ePrint Arch., 2021

2020
Foundations of Fully Dynamic Group Signatures.
J. Cryptol., 2020

More Efficient Amortization of Exact Zero-Knowledge Proofs for LWE.
IACR Cryptol. ePrint Arch., 2020

A non-PCP Approach to Succinct Quantum-Safe Zero-Knowledge.
IACR Cryptol. ePrint Arch., 2020

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

Linear-Time Arguments with Sublinear Verification from Tensor Codes.
IACR Cryptol. ePrint Arch., 2020

Compact Privacy Protocols from Post-quantum and Timed Classical Assumptions.
Proceedings of the Post-Quantum Cryptography - 11th International Conference, 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.
IACR Cryptol. ePrint Arch., 2019

2018
Efficient Batch Zero-Knowledge Arguments for Low Degree Polynomials.
IACR Cryptol. ePrint Arch., 2018

LWE Without Modular Reduction and Improved Side-Channel Attacks Against BLISS.
IACR Cryptol. ePrint Arch., 2018

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

Sub-Linear Lattice-Based Zero-Knowledge Arguments for Arithmetic Circuits.
IACR Cryptol. ePrint Arch., 2018

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

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

2017
Bulletproofs: Short Proofs for Confidential Transactions and More.
IACR Cryptol. ePrint Arch., 2017

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

Linear-Time Zero-Knowledge Proofs for Arithmetic Circuit Satisfiability.
IACR Cryptol. ePrint Arch., 2017

2016
Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting.
IACR Cryptol. ePrint Arch., 2016

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

2015
Short Accountable Ring Signatures Based on DDH.
IACR Cryptol. ePrint Arch., 2015


  Loading...