Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJonathan Bootle
Person information
- affiliation: IBM Research, Zurich, Switzerland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j2]Azucena Garvía Bosshard, Christoph Sprenger
, Jonathan Bootle:
The Sumcheck Protocol. Arch. Formal Proofs 2024 (2024)- [i23]Azucena Garvía Bosshard, Jonathan Bootle, Christoph Sprenger:
Formal Verification of the Sumcheck Protocol. CoRR abs/2402.06093 (2024) - 2023
- [c23]Jonathan Bootle, Sebastian H. Faller, Julia Hesse, Kristina Hostáková, Johannes Ottenhues:
Generalized Fuzzy Password-Authenticated Key Exchange from Error Correcting Codes. ASIACRYPT (8) 2023: 110-142 - [c22]Jonathan Bootle, Alessandro Chiesa, Katerina Sotiraki:
Lattice-Based Succinct Arguments for NP with Polylogarithmic-Time Verification. CRYPTO (2) 2023: 227-251 - [c21]Jonathan Bootle, Vadim Lyubashevsky, Ngoc Khanh Nguyen, Alessandro Sorniotti:
A Framework for Practical Anonymous Credentials from Lattices. CRYPTO (2) 2023: 384-417 - [i22]Jonathan Bootle, Vadim Lyubashevsky, Ngoc Khanh Nguyen, Alessandro Sorniotti:
A Framework for Practical Anonymous Credentials from Lattices. IACR Cryptol. ePrint Arch. 2023: 560 (2023) - [i21]Jonathan Bootle, Alessandro Chiesa, Katerina Sotiraki:
Lattice-Based Succinct Arguments for NP with Polylogarithmic-Time Verification. IACR Cryptol. ePrint Arch. 2023: 930 (2023) - [i20]Jonathan Bootle, Kaoutar Elkhiyaoui, Julia Hesse, Yacov Manevich:
DualDory: Logarithmic-Verifier Linkable Ring Signatures through Preprocessing. IACR Cryptol. ePrint Arch. 2023: 1177 (2023) - [i19]Jonathan Bootle, Sebastian H. Faller, Julia Hesse, Kristina Hostáková, Johannes Ottenhues:
Generalized Fuzzy Password-Authenticated Key Exchange from Error Correcting Codes. IACR Cryptol. ePrint Arch. 2023: 1415 (2023) - 2022
- [c20]Jonathan Bootle, Kaoutar Elkhiyaoui, Julia Hesse, Yacov Manevich:
DualDory: Logarithmic-Verifier Linkable Ring Signatures Through Preprocessing. ESORICS (2) 2022: 427-446 - [c19]Jonathan Bootle, Alessandro Chiesa, Siqi Liu:
Zero-Knowledge IOPs with Linear-Time Prover and Polylogarithmic-Time Verifier. EUROCRYPT (2) 2022: 275-304 - [c18]Jonathan Bootle, Alessandro Chiesa, Yuncong Hu, Michele Orrù:
Gemini: Elastic SNARKs for Diverse Environments. EUROCRYPT (2) 2022: 427-457 - [i18]Jonathan Bootle, Alessandro Chiesa, Yuncong Hu, Michele Orrù:
Gemini: Elastic SNARKs for Diverse Environments. IACR Cryptol. ePrint Arch. 2022: 420 (2022) - [i17]Jonathan Bootle, Alessandro Chiesa, Ziyi Guan, Siqi Liu:
Linear-Time Probabilistic Proofs with Sublinear Verification for Algebraic Automata Over Every Field. IACR Cryptol. ePrint Arch. 2022: 1056 (2022) - 2021
- [c17]Jonathan Bootle, Alessandro Chiesa, Katerina Sotiraki:
Sumcheck Arguments and Their Applications. CRYPTO (1) 2021: 742-773 - [c16]Jonathan Bootle, Vadim Lyubashevsky, Ngoc Khanh Nguyen, Gregor Seiler:
More Efficient Amortization of Exact Zero-Knowledge Proofs for LWE. ESORICS (2) 2021: 608-627 - [i16]Jonathan Bootle, Alessandro Chiesa, Katerina Sotiraki:
Sumcheck Arguments and their Applications. IACR Cryptol. ePrint Arch. 2021: 333 (2021) - 2020
- [j1]Jonathan Bootle, Andrea Cerulli, Pyrros Chaidos, Essam Ghadafi, Jens Groth:
Foundations of Fully Dynamic Group Signatures. J. Cryptol. 33(4): 1822-1870 (2020) - [c15]Jonathan Bootle, Vadim Lyubashevsky, Ngoc Khanh Nguyen, Gregor Seiler:
A Non-PCP Approach to Succinct Quantum-Safe Zero-Knowledge. CRYPTO (2) 2020: 441-469 - [c14]Jonathan Bootle, Anja Lehmann, Vadim Lyubashevsky, Gregor Seiler:
Compact Privacy Protocols from Post-quantum and Timed Classical Assumptions. PQCrypto 2020: 226-246 - [c13]Jonathan Bootle, Alessandro Chiesa, Jens Groth:
Linear-Time Arguments with Sublinear Verification from Tensor Codes. TCC (2) 2020: 19-46 - [i15]Jonathan Bootle, Vadim Lyubashevsky, Ngoc Khanh Nguyen, Gregor Seiler:
A non-PCP Approach to Succinct Quantum-Safe Zero-Knowledge. IACR Cryptol. ePrint Arch. 2020: 737 (2020) - [i14]Jonathan Bootle, Alessandro Chiesa, Jens Groth:
Linear-Time Arguments with Sublinear Verification from Tensor Codes. IACR Cryptol. ePrint Arch. 2020: 1426 (2020) - [i13]Jonathan Bootle, Vadim Lyubashevsky, Ngoc Khanh Nguyen, Gregor Seiler:
More Efficient Amortization of Exact Zero-Knowledge Proofs for LWE. IACR Cryptol. ePrint Arch. 2020: 1449 (2020) - [i12]Jonathan Bootle, Alessandro Chiesa, Siqi Liu:
Zero-Knowledge Succinct Arguments with a Linear-Time Prover. IACR Cryptol. ePrint Arch. 2020: 1527 (2020)
2010 – 2019
- 2019
- [b1]Jonathan Bootle:
Designing efficient zero-knowledge proofs in the ideal linear commitment model. University College London, UK, 2019 - [c12]Jonathan Bootle, Vadim Lyubashevsky, Gregor Seiler:
Algebraic Techniques for Short(er) Exact Lattice-Based Zero-Knowledge Proofs. CRYPTO (1) 2019: 176-202 - [i11]Jonathan Bootle, Vadim Lyubashevsky, Gregor Seiler:
Algebraic Techniques for Short(er) Exact Lattice-Based Zero-Knowledge Proofs. IACR Cryptol. ePrint Arch. 2019: 642 (2019) - 2018
- [c11]Jonathan Bootle, Claire Delaplace, Thomas Espitau, Pierre-Alain Fouque, Mehdi Tibouchi:
LWE Without Modular Reduction and Improved Side-Channel Attacks Against BLISS. ASIACRYPT (1) 2018: 494-524 - [c10]Jonathan Bootle, Andrea Cerulli, Jens Groth, Sune K. Jakobsen, Mary Maller:
Arya: Nearly Linear-Time Zero-Knowledge Proofs for Correct Program Execution. ASIACRYPT (1) 2018: 595-626 - [c9]Carsten Baum, Jonathan Bootle, Andrea Cerulli, Rafaël del Pino, Jens Groth, Vadim Lyubashevsky:
Sub-linear Lattice-Based Zero-Knowledge Arguments for Arithmetic Circuits. CRYPTO (2) 2018: 669-699 - [c8]Jonathan Bootle, Mehdi Tibouchi, Keita Xagawa:
Cryptanalysis of Compact-LWE. CT-RSA 2018: 80-97 - [c7]Jonathan Bootle, Jens Groth:
Efficient Batch Zero-Knowledge Arguments for Low Degree Polynomials. Public Key Cryptography (2) 2018: 561-588 - [c6]Benedikt Bünz, Jonathan Bootle, Dan Boneh, Andrew Poelstra, Pieter Wuille, Gregory Maxwell:
Bulletproofs: Short Proofs for Confidential Transactions and More. IEEE Symposium on Security and Privacy 2018: 315-334 - [i10]Jonathan Bootle, Jens Groth:
Efficient Batch Zero-Knowledge Arguments for Low Degree Polynomials. IACR Cryptol. ePrint Arch. 2018: 45 (2018) - [i9]Jonathan Bootle, Andrea Cerulli, Jens Groth, Sune K. Jakobsen, Mary Maller:
Nearly Linear-Time Zero-Knowledge Proofs for Correct Program Execution. IACR Cryptol. ePrint Arch. 2018: 380 (2018) - [i8]Carsten Baum, Jonathan Bootle, Andrea Cerulli, Rafaël Del Pino, Jens Groth, Vadim Lyubashevsky:
Sub-Linear Lattice-Based Zero-Knowledge Arguments for Arithmetic Circuits. IACR Cryptol. ePrint Arch. 2018: 560 (2018) - [i7]Jonathan Bootle, Claire Delaplace, Thomas Espitau, Pierre-Alain Fouque, Mehdi Tibouchi:
LWE Without Modular Reduction and Improved Side-Channel Attacks Against BLISS. IACR Cryptol. ePrint Arch. 2018: 822 (2018) - 2017
- [c5]Jonathan Bootle, Andrea Cerulli, Essam Ghadafi, Jens Groth, Mohammad Hajiabadi, Sune K. Jakobsen:
Linear-Time Zero-Knowledge Proofs for Arithmetic Circuit Satisfiability. ASIACRYPT (3) 2017: 336-365 - [i6]Jonathan Bootle, Mehdi Tibouchi:
Cryptanalysis of Compact-LWE. IACR Cryptol. ePrint Arch. 2017: 742 (2017) - [i5]Jonathan Bootle, Andrea Cerulli, Essam Ghadafi, Jens Groth, Mohammad Hajiabadi, Sune K. Jakobsen:
Linear-Time Zero-Knowledge Proofs for Arithmetic Circuit Satisfiability. IACR Cryptol. ePrint Arch. 2017: 872 (2017) - [i4]Benedikt Bünz, Jonathan Bootle, Dan Boneh, Andrew Poelstra, Pieter Wuille, Gregory Maxwell:
Bulletproofs: Short Proofs for Confidential Transactions and More. IACR Cryptol. ePrint Arch. 2017: 1066 (2017) - 2016
- [c4]Jonathan Bootle, Andrea Cerulli, Pyrros Chaidos, Essam Ghadafi, Jens Groth:
Foundations of Fully Dynamic Group Signatures. ACNS 2016: 117-136 - [c3]Jonathan Bootle, Andrea Cerulli, Pyrros Chaidos, Jens Groth, Christophe Petit:
Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting. EUROCRYPT (2) 2016: 327-357 - [c2]Jonathan Bootle, Andrea Cerulli, Pyrros Chaidos, Jens Groth:
Efficient Zero-Knowledge Proof Systems. FOSAD 2016: 1-31 - [i3]Jonathan Bootle, Andrea Cerulli, Pyrros Chaidos, Jens Groth, Christophe Petit:
Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting. IACR Cryptol. ePrint Arch. 2016: 263 (2016) - [i2]Jonathan Bootle, Andrea Cerulli, Pyrros Chaidos, Essam Ghadafi, Jens Groth:
Foundations of Fully Dynamic Group Signatures. IACR Cryptol. ePrint Arch. 2016: 368 (2016) - 2015
- [c1]Jonathan Bootle, Andrea Cerulli, Pyrros Chaidos, Essam Ghadafi, Jens Groth, Christophe Petit:
Short Accountable Ring Signatures Based on DDH. ESORICS (1) 2015: 243-265 - [i1]Jonathan Bootle, Andrea Cerulli, Pyrros Chaidos, Essam Ghadafi, Jens Groth, Christophe Petit:
Short Accountable Ring Signatures Based on DDH. IACR Cryptol. ePrint Arch. 2015: 643 (2015)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
