| 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 | 656 | 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 | 226 | 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 | 95 | 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 | 93 | 2015 |
| Sub-linear lattice-based zero-knowledge arguments for arithmetic circuits C Baum, J Bootle, A Cerulli, R Pino, J Groth, V Lyubashevsky Annual International Cryptology Conference, 669-699, 2018 | 73 | 2018 |
| 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 | 56 | 2017 |
| Algebraic techniques for short (er) exact lattice-based zero-knowledge proofs J Bootle, V Lyubashevsky, G Seiler Annual International Cryptology Conference, 176-202, 2019 | 47 | 2019 |
| 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 | 32 | 2018 |
| Efficient batch zero-knowledge arguments for low degree polynomials J Bootle, J Groth IACR International Workshop on Public Key Cryptography, 561-588, 2018 | 30 | 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 | 23 | 2018 |
| Efficient zero-knowledge proof systems J Bootle, A Cerulli, P Chaidos, J Groth Foundations of security analysis and design VIII, 1-31, 2016 | 23 | 2016 |
| 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 | 22 | 2020 |
| Linear-time arguments with sublinear verification from tensor codes J Bootle, A Chiesa, J Groth Theory of Cryptography Conference, 19-46, 2020 | 15 | 2020 |
| Cryptanalysis of compact-LWE J Bootle, M Tibouchi, K Xagawa Cryptographers’ Track at the RSA Conference, 80-97, 2018 | 11 | 2018 |
| Zero-Knowledge Succinct Arguments with a Linear-Time Prover. J Bootle, A Chiesa, S Liu IACR Cryptol. ePrint Arch. 2020, 1527, 2020 | 8 | 2020 |
| Sumcheck arguments and their applications J Bootle, A Chiesa, K Sotiraki Annual International Cryptology Conference, 742-773, 2021 | 7 | 2021 |
| Foundations of fully dynamic group signatures J Bootle, A Cerulli, P Chaidos, E Ghadafi, J Groth Journal of Cryptology 33 (4), 1822-1870, 2020 | 5 | 2020 |
| Nearly linear-time zero-knowledge proofs for correct program execution J Bootle, A Cerulli, J Groth, S Jakobsen, M Maller Cryptology ePrint Archive, 2018 | 4 | 2018 |
| More efficient amortization of exact zero-knowledge proofs for LWE J Bootle, V Lyubashevsky, NK Nguyen, G Seiler European Symposium on Research in Computer Security, 608-627, 2021 | 3 | 2021 |
| 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 | 2 | 2020 |
Jens GrothPrincipal Researcher, DFINITYVerified email at ucl.ac.uk
