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 | 1344 | 2018 |
Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting J Bootle, A Cerulli, P Chaidos, J Groth, C Petit Advances in Cryptology–EUROCRYPT 2016: 35th Annual International Conference …, 2016 | 431 | 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 | 151 | 2015 |
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 | 130 | 2016 |
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 | 109 | 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 | 97 | 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 | 95 | 2019 |
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 | 72 | 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 | 65 | 2020 |
Linear-time arguments with sublinear verification from tensor codes J Bootle, A Chiesa, J Groth Theory of Cryptography: 18th International Conference, TCC 2020, Durham, NC …, 2020 | 55 | 2020 |
Efficient batch zero-knowledge arguments for low degree polynomials J Bootle, J Groth IACR International Workshop on Public Key Cryptography, 561-588, 2018 | 53 | 2018 |
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 | 52 | 2018 |
Gemini: Elastic SNARKs for diverse environments J Bootle, A Chiesa, Y Hu, M Orru Annual International Conference on the Theory and Applications of …, 2022 | 43 | 2022 |
Sumcheck arguments and their applications J Bootle, A Chiesa, K Sotiraki Advances in Cryptology–CRYPTO 2021: 41st Annual International Cryptology …, 2021 | 36 | 2021 |
Efficient zero-knowledge proof systems J Bootle, A Cerulli, P Chaidos, J Groth Foundations of Security Analysis and Design VIII: FOSAD 2014/2015/2016 …, 2016 | 31 | 2016 |
Zero-knowledge IOPs with linear-time prover and polylogarithmic-time verifier J Bootle, A Chiesa, S Liu Annual International Conference on the Theory and Applications of …, 2022 | 27 | 2022 |
Foundations of fully dynamic group signatures J Bootle, A Cerulli, P Chaidos, E Ghadafi, J Groth Journal of Cryptology 33, 1822-1870, 2020 | 19 | 2020 |
Zero-Knowledge Succinct Arguments with a Linear-Time Prover. J Bootle, A Chiesa, S Liu IACR Cryptol. ePrint Arch. 2020, 1527, 2020 | 19 | 2020 |
A framework for practical anonymous credentials from lattices J Bootle, V Lyubashevsky, NK Nguyen, A Sorniotti Annual International Cryptology Conference, 384-417, 2023 | 15 | 2023 |
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 | 13 | 2021 |