| Bulletproofs: Short proofs for confidential transactions and more B Bünz, J Bootle, D Boneh, A Poelstra, P Wuille, G Maxwell 2018 IEEE Symposium on Security and Privacy (SP), 315-334, 2018 | 266 | 2018 |
| Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting J Bootle, A Cerulli, P Chaidos, J Groth, C Petit Annual International Conference on the Theory and Applications of …, 2016 | 102 | 2016 |
| Foundations of fully dynamic group signatures J Bootle, A Cerulli, P Chaidos, E Ghadafi, J Groth International Conference on Applied Cryptography and Network Security, 117-136, 2016 | 62 | 2016 |
| Short accountable ring signatures based on DDH J Bootle, A Cerulli, P Chaidos, E Ghadafi, J Groth, C Petit European Symposium on Research in Computer Security, 243-265, 2015 | 56 | 2015 |
| Sub-linear lattice-based zero-knowledge arguments for arithmetic circuits C Baum, J Bootle, A Cerulli, R Del Pino, J Groth, V Lyubashevsky Annual International Cryptology Conference, 669-699, 2018 | 38 | 2018 |
| Bulletproofs: Efficient range proofs for confidential transactions B Bünz, J Bootle, D Boneh, A Poelstra, P Wuille, G Maxwell IACR Cryptology ePrint Archive 2017, 1066, 2017 | 34 | 2017 |
| Linear-time zero-knowledge proofs for arithmetic circuit satisfiability J Bootle, A Cerulli, E Ghadafi, J Groth, M Hajiabadi, SK Jakobsen International Conference on the Theory and Application of Cryptology and …, 2017 | 28 | 2017 |
| LWE without modular reduction and improved side-channel attacks against BLISS J Bootle, C Delaplace, T Espitau, PA Fouque, M Tibouchi International Conference on the Theory and Application of Cryptology and …, 2018 | 18 | 2018 |
| Efficient batch zero-knowledge arguments for low degree polynomials J Bootle, J Groth IACR International Workshop on Public Key Cryptography, 561-588, 2018 | 17 | 2018 |
| Algebraic techniques for short (er) exact lattice-based zero-knowledge proofs J Bootle, V Lyubashevsky, G Seiler Annual International Cryptology Conference, 176-202, 2019 | 16 | 2019 |
| Efficient zero-knowledge proof systems J Bootle, A Cerulli, P Chaidos, J Groth Foundations of security analysis and design VIII, 1-31, 2016 | 15 | 2016 |
| Cryptanalysis of compact-LWE J Bootle, M Tibouchi, K Xagawa Cryptographers’ Track at the RSA Conference, 80-97, 2018 | 10 | 2018 |
| Arya: Nearly linear-time zero-knowledge proofs for correct program execution J Bootle, A Cerulli, J Groth, S Jakobsen, M Maller International Conference on the Theory and Application of Cryptology and …, 2018 | 8 | 2018 |
| Nearly Linear-Time Zero-Knowledge Proofs for Correct Program Execution. J Bootle, A Cerulli, J Groth, SK Jakobsen, M Maller IACR Cryptol. ePrint Arch. 2018, 380, 2018 | 2 | 2018 |
| A non-PCP approach to succinct quantum-safe zero-knowledge J Bootle, V Lyubashevsky, NK Nguyen, G Seiler Annual International Cryptology Conference, 441-469, 2020 | 1 | 2020 |
| Compact Privacy Protocols from Post-quantum and Timed Classical Assumptions J Bootle, A Lehmann, V Lyubashevsky, G Seiler International Conference on Post-Quantum Cryptography, 226-246, 2020 | | 2020 |
| Designing Efficient Zero-Knowledge Proofs in the Ideal Linear Commitment Model J Bootle UCL (University College London), 2019 | | 2019 |
Jens GrothPrincipal Researcher, DFINITYVerified email at ucl.ac.uk
