| Plonk: Permutations over lagrange-bases for oecumenical noninteractive arguments of knowledge A Gabizon, ZJ Williamson, O Ciobotaru Cryptology ePrint Archive, 2019 | 667 | 2019 |
| Cryptocurrencies without proof of work I Bentov, A Gabizon, A Mizrahi International conference on financial cryptography and data security, 142-157, 2016 | 556 | 2016 |
| Scalable multi-party computation for zk-SNARK parameters in the random beacon model S Bowe, A Gabizon, I Miers Cryptology ePrint Archive, 2017 | 219 | 2017 |
| A multi-party protocol for constructing the public parameters of the Pinocchio zk-SNARK S Bowe, A Gabizon, MD Green Financial Cryptography and Data Security: FC 2018 International Workshops …, 2019 | 199 | 2019 |
| Deterministic extractors for affine sources over large fields A Gabizon, R Raz Combinatorica 28 (4), 415-440, 2008 | 129 | 2008 |
| Non-interactive secure multiparty computation A Beimel, A Gabizon, Y Ishai, E Kushilevitz, S Meldgaard, ... Advances in Cryptology–CRYPTO 2014: 34th Annual Cryptology Conference, Santa …, 2014 | 122 | 2014 |
| Deterministic extractors for bit-fixing sources by obtaining an independent seed A Gabizon, R Raz, R Shaltiel SIAM Journal on Computing 36 (4), 1072-1094, 2006 | 119 | 2006 |
| plookup: A simplified polynomial protocol for lookup tables A Gabizon, ZJ Williamson Cryptology ePrint Archive, 2020 | 118 | 2020 |
| Computational integrity with a public random string from quasi-linear PCPs E Ben-Sasson, I Bentov, A Chiesa, A Gabizon, D Genkin, M Hamilis, ... Advances in Cryptology–EUROCRYPT 2017: 36th Annual International Conference …, 2017 | 98 | 2017 |
| Subspace polynomials and cyclic subspace codes E Ben-Sasson, T Etzion, A Gabizon, N Raviv IEEE Transactions on Information Theory 62 (3), 1157-1165, 2016 | 85 | 2016 |
| Halo Infinite: Proof-Carrying Data from Additive Polynomial Commitments D Boneh, J Drake, B Fisch, A Gabizon Advances in Cryptology–CRYPTO 2021: 41st Annual International Cryptology …, 2021 | 84 | 2021 |
| Extractors and rank extractors for polynomial sources Z Dvir, A Gabizon, A Wigderson Computational Complexity 18, 1-58, 2009 | 79 | 2009 |
| Efficient polynomial commitment schemes for multiple points and polynomials D Boneh, J Drake, B Fisch, A Gabizon Cryptology ePrint Archive, 2020 | 70 | 2020 |
| Interactive oracle proofs with constant rate and query complexity E Ben-Sasson, A Chiesa, A Gabizon, M Riabzev, N Spooner Cryptology ePrint Archive, 2016 | 58 | 2016 |
| Making groth's zk-snark simulation extractable in the random oracle model S Bowe, A Gabizon Cryptology ePrint Archive, 2018 | 55 | 2018 |
| Quasi-linear size zero knowledge from linear-algebraic PCPs E Ben-Sasson, A Chiesa, A Gabizon, M Virza Theory of Cryptography: 13th International Conference, TCC 2016-A, Tel Aviv …, 2016 | 54 | 2016 |
| cq: Cached quotients for fast lookups L Eagen, D Fiore, A Gabizon Cryptology ePrint Archive, 2022 | 52 | 2022 |
| Bitcoin beacon I Bentov, A Gabizon, D Zuckerman arXiv preprint arXiv:1605.04559, 2016 | 50 | 2016 |
| Halo infinite: Recursive zk-SNARKs from any additive polynomial commitment scheme D Boneh, J Drake, B Fisch, A Gabizon Cryptology ePrint Archive, 2020 | 49 | 2020 |
| Baloo: Nearly optimal lookup arguments A Zapico, A Gabizon, D Khovratovich, M Maller, C Ràfols Cryptology ePrint Archive, 2022 | 40 | 2022 |
