Get started
Author

Ariel Gabizon

Cryptocurrencies Without Proof of Work
2016 · Iddo Bentov, Ariel Gabizon, et al. · Lecture notes in computer science · 357
PLONK: Permutations over Lagrange-bases for Oecumenical Noninteractive arguments of Knowledge.
2019 · Ariel Gabizon, Zachary J. Williamson, et al. · IACR Cryptology ePrint Archive · 187
A Multi-party Protocol for Constructing the Public Parameters of the Pinocchio zk-SNARK
2019 · Sean Bowe, Ariel Gabizon, et al. · Lecture notes in computer science · 106
Non-Interactive Secure Multiparty Computation
2014 · Amos Beimel, Ariel Gabizon, et al. · Lecture notes in computer science · 78
Deterministic Extractors for Bit‐Fixing Sources by Obtaining an Independent Seed
2006 · Ariel Gabizon, Ran Raz, et al. · SIAM Journal on Computing · 76
Scalable Multi-party Computation for zk-SNARK Parameters in the Random Beacon Model.
2017 · Sean Bowe, Ariel Gabizon, et al. · IACR Cryptology ePrint Archive · 73
Subspace Polynomials and Cyclic Subspace Codes
2016 · Eli Ben-Sasson, Tuvi Etzion, et al. · IEEE Transactions on Information Theory · 72
Halo Infinite: Proof-Carrying Data from Additive Polynomial Commitments
2021 · Dan Boneh, Justin Drake, et al. · Lecture notes in computer science · 64
Deterministic extractors for affine sources over large fields
2008 · Ariel Gabizon, Ran Raz · COMBINATORICA · 52
Extractors And Rank Extractors For Polynomial Sources
2009 · Zeev Dvir, Ariel Gabizon, et al. · Computational Complexity · 51
Computational Integrity with a Public Random String from Quasi-Linear PCPs
2017 · Eli Ben-Sasson, Iddo Bentov, et al. · Lecture notes in computer science · 50
Deterministic Extractors for Affine Sources over Large Fields
2005 · A. Gabizon, R. Raz · Annual Symposium on Foundations of Computer Science · 39
Interactive Oracle Proofs with Constant Rate and Query Complexity
2017 · Ben-Sasson, Eli, Chiesa, Alessandro, et al. · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 26
PDF
Deterministic Extractors for Bit-Fixing Sources by Obtaining an Independent Seed
2004 · A. Gabizon, Ran Raz, et al. · Annual Symposium on Foundations of Computer Science · 25
Efficient polynomial commitment schemes for multiple points and polynomials.
2020 · Dan Boneh, Justin Drake, et al. · IACR Cryptology ePrint Archive · 24
Quasi-Linear Size Zero Knowledge from Linear-Algebraic PCPs
2015 · Eli Ben-Sasson, Alessandro Chiesa, et al. · Lecture notes in computer science · 24
Cryptocurrencies without Proof of Work
2014 · Bentov, Iddo, Gabizon, Ariel, et al. · arXiv (Cornell University) · 24
PDF
Zero Knowledge Protocols from Succinct Constraint Detection
2017 · Eli Ben-Sasson, Alessandro Chiesa, et al. · Lecture notes in computer science · 21
plookup: A simplified polynomial protocol for lookup tables.
2020 · Ariel Gabizon, Zachary J. Williamson · IACR Cryptology ePrint Archive · 20
Invertible Zero-Error Dispersers and Defective Memory with Stuck-At Errors
2012 · Ariel Gabizon, Ronen Shaltiel · Lecture notes in computer science · 19
Simple Affine Extractors Using Dimension Expansion
2010 · Matt DeVos, Ariel Gabizon · Proceedings - IEEE Conference on Computational Complexity/Proceedings · 18
A new family of locally correctable codes based on degree-lifted algebraic geometry codes
2013 · Eli Ben-Sasson, Ariel Gabizon, et al. · ACM Symposium on Theory of Computing (STOC) · 17
Extractors and Rank Extractors for Polynomial Sources
2007 · Zeev Dvir, Ariel Gabizon, et al. · Annual Symposium on Foundations of Computer Science · 16
Almost Optimal Cover-Free Families
2017 · Nader H. Bshouty, Ariel Gabizon · Lecture notes in computer science · 14
PDF
Plumo: An Ultralight Blockchain Client
2022 · Psi Vesely, Kobi Gurkan, et al. · Lecture notes in computer science · 13
Works count: 66
Citation count: 1,598
H-index: 19
I10-index: 30
Year
Topic
Type