I am a PhD candidate in the area of cryptography, working under the supervision of Dr Jens Groth and Dr Sarah Meiklejohn. I am currently working on efficient zero-knowledge proofs. More specifically, I am looking at zero-knowledge membership proofs. I am also interested in lattices and post-quantum cryptography, game theory, and both classical and quantum information theory.

Before coming to UCL, I studied Mathematics to Part III at Clare College, University of Cambridge.

I help to organise UCL's ACE-CSR and Information Security Seminars. Please don't hesitate to get in touch if you would like to get more information or join our mailing list.

Jonathan Bootle

jonathan dot bootle dot 14 at ucl dot ac dot uk

Department of Computer Science
University College London
Gower Street
London WC1E 6BT


- I will be serving on the program committee for APKC 2018, 4-8th June, Incheon, Korea. Consider submitting your papers!


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.

  • Bulletproofs: Efficient Range Proofs for Confidential Transactions.
    Benedikt Bünz and Jonathan Bootle and Dan Boneh and Andrew Poelstra and Pieter Wuille and Greg Maxwell
    IEEE S&P 2018, To Appear.
    IACR ePrint
  • Efficient Batch Zero-Knowledge Arguments for Low-Degree Polynomials.
    Jonathan Bootle and Jens Groth
    PKC 2018, To Appear.
  • Cryptanalysis of Compact-LWE.
    Jonathan Bootle, Mehdi Tibouchi and Keita Xagawa
    CT-RSA 2018, To Appear.
    IACR ePrint
  • Linear-Time Zero-Knowledge Proofs for Arithmetic Circuit Satisfiability.
    Jonathan Bootle, Andrea Cerulli, Essam Ghadafi, Jens Groth, Mohammad Hajiabadi and Sune K. Jacobsen
    Advances in Cryptology - ASIACRYPT 2017 LNCS 10626, pages 336-365.
    IACR ePrint Slides
  • Efficient Zero-Knowledge Proof Systems
    Jonathan Bootle, Andrea Cerulli, Pyrros Chaidos and Jens Groth
    Foundations of Security Analysis and Design VIII - FOSAD 2015 LNCS 9808, pages 1-31.
  • Foundations of Fully Dynamic Group Signatures
    Jonathan Bootle, Andrea Cerulli, Pyrros Chaidos, Essam Ghadafi and Jens Groth
    Applied Cryptography and Network Security - ACNS 2016 LNCS 9696, pages 117-136.
    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
    Advances in Cryptology - EUROCRYPT 2016 LNCS 9666, pages 327-357.
    IACR ePrint Slides
  • Short Accountable Ring Signatures Based on DDH.
    Jonathan Bootle, Andrea Cerulli, Pyrros Chaidos, Essam Ghadafi, Jens Groth and Christophe Petit
    Computer Security - ESORICS 2015 LNCS 9326, pages 243-265.
    IACR ePrint Slides


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


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

Plain Academic