default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAriel Gabizon
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i45]Liam Eagen, Ariel Gabizon, Marek Sefranek, Patrick Towa, Zachary J. Williamson:
Stackproofs: Private proofs of stack and contract execution using Protogalaxy. IACR Cryptol. ePrint Arch. 2024: 1281 (2024)- 2023
- [i44]Liam Eagen, Ariel Gabizon:
cqlin: Efficient linear operations on KZG commitments with cached quotients. IACR Cryptol. ePrint Arch. 2023: 393 (2023) - [i43]Liam Eagen, Ariel Gabizon:
ProtoGalaxy: Efficient ProtoStar-style folding of multiple instances. IACR Cryptol. ePrint Arch. 2023: 1106 (2023) - 2022
- [c26]Psi Vesely, Kobi Gurkan, Michael Straka, Ariel Gabizon, Philipp Jovanovic, Georgios Konstantopoulos, Asa Oines, Marek Olszewski, Eran Tromer:
Plumo: An Ultralight Blockchain Client. Financial Cryptography 2022: 597-614 - [i42]Ariel Gabizon, Dmitry Khovratovich:
flookup: Fractional decomposition-based lookups in quasi-linear time independent of table size. IACR Cryptol. ePrint Arch. 2022: 1447 (2022) - [i41]Arantxa Zapico, Ariel Gabizon, Dmitry Khovratovich, Mary Maller, Carla Ràfols:
Baloo: Nearly Optimal Lookup Arguments. IACR Cryptol. ePrint Arch. 2022: 1565 (2022) - [i40]Liam Eagen, Dario Fiore, Ariel Gabizon:
cq: Cached quotients for fast lookups. IACR Cryptol. ePrint Arch. 2022: 1763 (2022) - 2021
- [c25]Dan Boneh, Justin Drake, Ben Fisch, Ariel Gabizon:
Halo Infinite: Proof-Carrying Data from Additive Polynomial Commitments. CRYPTO (1) 2021: 649-680 - [i39]Ariel Gabizon, Zachary J. Williamson:
fflonk: a Fast-Fourier inspired verifier efficient version of PlonK. IACR Cryptol. ePrint Arch. 2021: 1167 (2021) - [i38]Psi Vesely, Kobi Gurkan, Michael Straka, Ariel Gabizon, Philipp Jovanovic, Georgios Konstantopoulos, Asa Oines, Marek Olszewski, Eran Tromer:
Plumo: An Ultralight Blockchain Client. IACR Cryptol. ePrint Arch. 2021: 1361 (2021) - 2020
- [i37]Dan Boneh, Justin Drake, Ben Fisch, Ariel Gabizon:
Efficient polynomial commitment schemes for multiple points and polynomials. IACR Cryptol. ePrint Arch. 2020: 81 (2020) - [i36]Ariel Gabizon, Zachary J. Williamson:
plookup: A simplified polynomial protocol for lookup tables. IACR Cryptol. ePrint Arch. 2020: 315 (2020) - [i35]Dan Boneh, Justin Drake, Ben Fisch, Ariel Gabizon:
Halo Infinite: Recursive zk-SNARKs from any Additive Polynomial Commitment Scheme. IACR Cryptol. ePrint Arch. 2020: 1536 (2020)
2010 – 2019
- 2019
- [j8]Yuval Dagan, Yuval Filmus, Ariel Gabizon, Shay Moran:
Twenty (Short) Questions. Comb. 39(3): 597-626 (2019) - [i34]Ariel Gabizon:
On the security of the BCTV Pinocchio zk-SNARK variant. IACR Cryptol. ePrint Arch. 2019: 119 (2019) - [i33]Ariel Gabizon:
On the efficiency of pairing-based proofs under the d-PKE. IACR Cryptol. ePrint Arch. 2019: 148 (2019) - [i32]Ariel Gabizon:
Improved prover efficiency and SRS size in a Sonic-like system. IACR Cryptol. ePrint Arch. 2019: 601 (2019) - [i31]Ariel Gabizon, Zachary J. Williamson, Oana Ciobotaru:
PLONK: Permutations over Lagrange-bases for Oecumenical Noninteractive arguments of Knowledge. IACR Cryptol. ePrint Arch. 2019: 953 (2019) - 2018
- [c24]Sean Bowe, Ariel Gabizon, Matthew D. Green:
A Multi-party Protocol for Constructing the Public Parameters of the Pinocchio zk-SNARK. Financial Cryptography Workshops 2018: 64-77 - [i30]Sean Bowe, Ariel Gabizon:
Making Groth's zk-SNARK Simulation Extractable in the Random Oracle Model. IACR Cryptol. ePrint Arch. 2018: 187 (2018) - 2017
- [c23]Nader H. Bshouty, Ariel Gabizon:
Almost Optimal Cover-Free Families. CIAC 2017: 140-151 - [c22]Eli Ben-Sasson, Iddo Bentov, Alessandro Chiesa, Ariel Gabizon, Daniel Genkin, Matan Hamilis, Evgenya Pergament, Michael Riabzev, Mark Silberstein, Eran Tromer, Madars Virza:
Computational Integrity with a Public Random String from Quasi-Linear PCPs. EUROCRYPT (3) 2017: 551-579 - [c21]Eli Ben-Sasson, Alessandro Chiesa, Ariel Gabizon, Michael Riabzev, Nicholas Spooner
:
Interactive Oracle Proofs with Constant Rate and Query Complexity. ICALP 2017: 40:1-40:15 - [c20]Yuval Dagan, Yuval Filmus, Ariel Gabizon, Shay Moran:
Twenty (simple) questions. STOC 2017: 9-21 - [c19]Eli Ben-Sasson, Alessandro Chiesa, Michael A. Forbes, Ariel Gabizon, Michael Riabzev, Nicholas Spooner:
Zero Knowledge Protocols from Succinct Constraint Detection. TCC (2) 2017: 172-206 - [i29]Sean Bowe, Ariel Gabizon, Matthew D. Green:
A multi-party protocol for constructing the public parameters of the Pinocchio zk-SNARK. IACR Cryptol. ePrint Arch. 2017: 602 (2017) - [i28]Sean Bowe, Ariel Gabizon, Ian Miers:
Scalable Multi-party Computation for zk-SNARK Parameters in the Random Beacon Model. IACR Cryptol. ePrint Arch. 2017: 1050 (2017) - 2016
- [j7]Ran Ben-Basat, Ariel Gabizon, Meirav Zehavi:
The k-distinct language: Parameterized automata constructions. Theor. Comput. Sci. 622: 1-15 (2016) - [j6]Eli Ben-Sasson, Tuvi Etzion, Ariel Gabizon, Netanel Raviv:
Subspace Polynomials and Cyclic Subspace Codes. IEEE Trans. Inf. Theory 62(3): 1157-1165 (2016) - [c18]Iddo Bentov, Ariel Gabizon, Alex Mizrahi:
Cryptocurrencies Without Proof of Work. Financial Cryptography Workshops 2016: 142-157 - [c17]Amos Beimel, Ariel Gabizon, Yuval Ishai, Eyal Kushilevitz:
Distribution Design. ITCS 2016: 81-92 - [c16]Eli Ben-Sasson, Alessandro Chiesa, Ariel Gabizon, Madars Virza:
Quasi-Linear Size Zero Knowledge from Linear-Algebraic PCPs. TCC (A2) 2016: 33-64 - [i27]Iddo Bentov, Ariel Gabizon, David Zuckerman:
Bitcoin Beacon. CoRR abs/1605.04559 (2016) - [i26]Eli Ben-Sasson, Alessandro Chiesa, Michael A. Forbes, Ariel Gabizon, Michael Riabzev, Nicholas Spooner:
On Probabilistic Checking in Perfect Zero Knowledge. CoRR abs/1610.03798 (2016) - [i25]Yuval Dagan, Yuval Filmus, Ariel Gabizon, Shay Moran:
Twenty (simple) questions. CoRR abs/1611.01655 (2016) - [i24]Eli Ben-Sasson, Iddo Bentov, Ariel Gabizon, Michael Riabzev:
Improved concrete efficiency and security analysis of Reed-Solomon PCPPs. Electron. Colloquium Comput. Complex. TR16 (2016) - [i23]Eli Ben-Sasson, Iddo Bentov, Ariel Gabizon, Michael Riabzev:
A security analysis of Probabilistically Checkable Proofs. Electron. Colloquium Comput. Complex. TR16 (2016) - [i22]Eli Ben-Sasson, Alessandro Chiesa, Michael A. Forbes, Ariel Gabizon, Michael Riabzev, Nicholas Spooner:
On Probabilistic Checking in Perfect Zero Knowledge. Electron. Colloquium Comput. Complex. TR16 (2016) - [i21]Eli Ben-Sasson, Alessandro Chiesa, Ariel Gabizon, Michael Riabzev, Nicholas Spooner:
Short Interactive Oracle Proofs with Constant Query Complexity, via Composition and Sumcheck. Electron. Colloquium Comput. Complex. TR16 (2016) - [i20]Eli Ben-Sasson, Alessandro Chiesa, Ariel Gabizon, Madars Virza:
Quasi-Linear Size Zero Knowledge from Linear-Algebraic PCPs. Electron. Colloquium Comput. Complex. TR16 (2016) - [i19]Eli Ben-Sasson, Alessandro Chiesa, Ariel Gabizon, Madars Virza:
Quasi-Linear Size Zero Knowledge from Linear-Algebraic PCPs. IACR Cryptol. ePrint Arch. 2016: 21 (2016) - [i18]Eli Ben-Sasson, Alessandro Chiesa, Ariel Gabizon, Michael Riabzev, Nicholas Spooner:
Short Interactive Oracle Proofs with Constant Query Complexity, via Composition and Sumcheck. IACR Cryptol. ePrint Arch. 2016: 324 (2016) - [i17]Eli Ben-Sasson, Iddo Bentov, Alessandro Chiesa, Ariel Gabizon, Daniel Genkin, Matan Hamilis, Evgenya Pergament, Michael Riabzev, Mark Silberstein, Eran Tromer, Madars Virza:
Computational integrity with a public random string from quasi-linear PCPs. IACR Cryptol. ePrint Arch. 2016: 646 (2016) - [i16]Eli Ben-Sasson, Alessandro Chiesa, Michael A. Forbes, Ariel Gabizon, Michael Riabzev, Nicholas Spooner:
On Probabilistic Checking in Perfect Zero Knowledge. IACR Cryptol. ePrint Arch. 2016: 988 (2016) - 2015
- [c15]Ariel Gabizon, Daniel Lokshtanov, Michal Pilipczuk:
Fast Algorithms for Parameterized Problems with Relaxed Disjointness Constraints. ESA 2015: 545-556 - [c14]Abhishek Bhowmick, Ariel Gabizon, Thái Hoàng Lê, David Zuckerman:
Deterministic Extractors for Additive Sources: Extended Abstract. ITCS 2015: 277-286 - [c13]Eli Ben-Sasson, Tuvi Etzion, Ariel Gabizon, Netanel Raviv:
Subspace polynomials and cyclic subspace codes. ISIT 2015: 586-590 - [i15]Nader H. Bshouty, Ariel Gabizon:
Almost Optimal Cover-Free Families. CoRR abs/1507.07368 (2015) - 2014
- [c12]Amos Beimel, Ariel Gabizon, Yuval Ishai, Eyal Kushilevitz, Sigurd Meldgaard, Anat Paskin-Cherniavsky:
Non-Interactive Secure Multiparty Computation. CRYPTO (2) 2014: 387-404 - [c11]Ran Ben-Basat, Ariel Gabizon, Meirav Zehavi:
The k -Distinct Language: Parameterized Automata Constructions. IPEC 2014: 85-96 - [c10]Hasan Abasi, Nader H. Bshouty, Ariel Gabizon, Elad Haramaty:
On r-Simple k-Path. MFCS (2) 2014: 1-12 - [i14]Ran Ben-Basat, Ariel Gabizon:
Relations between automata and the simple k-path problem. CoRR abs/1401.5707 (2014) - [i13]Eli Ben-Sasson, Tuvi Etzion, Ariel Gabizon, Netanel Raviv:
Subspace Polynomials and Cyclic Subspace Codes. CoRR abs/1404.7739 (2014) - [i12]Iddo Bentov, Ariel Gabizon, Alex Mizrahi:
Cryptocurrencies without Proof of Work. CoRR abs/1406.5694 (2014) - [i11]Abhishek Bhowmick, Ariel Gabizon, Thái Hoàng Lê, David Zuckerman:
Deterministic Extractors for Additive Sources. CoRR abs/1410.7253 (2014) - [i10]Ariel Gabizon, Daniel Lokshtanov, Michal Pilipczuk:
Representative sets for multisets. CoRR abs/1411.6756 (2014) - [i9]Hasan Abasi, Nader H. Bshouty, Ariel Gabizon, Elad Haramaty:
On r-Simple k-Path. Electron. Colloquium Comput. Complex. TR14 (2014) - [i8]Amos Beimel, Ariel Gabizon, Yuval Ishai, Eyal Kushilevitz, Sigurd Meldgaard, Anat Paskin-Cherniavsky:
Non-Interactive Secure Multiparty Computation. IACR Cryptol. ePrint Arch. 2014: 960 (2014) - 2013
- [j5]Eli Ben-Sasson, Ariel Gabizon:
Extractors for Polynomial Sources over Fields of Constant Order and Small Characteristic. Theory Comput. 9: 665-683 (2013) - [c9]Eli Ben-Sasson, Ariel Gabizon, Yohay Kaplan, Swastik Kopparty, Shubhangi Saraf:
A new family of locally correctable codes based on degree-lifted algebraic geometry codes. STOC 2013: 833-842 - [i7]Hasan Abasi, Nader H. Bshouty, Ariel Gabizon, Elad Haramaty:
On $r$-Simple $k$-Path. CoRR abs/1312.4863 (2013) - 2012
- [j4]Ariel Gabizon, Ronen Shaltiel:
Increasing the output length of zero-error dispersers. Random Struct. Algorithms 40(1): 74-104 (2012) - [c8]Eli Ben-Sasson, Ariel Gabizon:
Extractors for Polynomials Sources over Constant-Size Fields of Small Characteristic. APPROX-RANDOM 2012: 399-410 - [c7]Ariel Gabizon, Ronen Shaltiel:
Invertible Zero-Error Dispersers and Defective Memory with Stuck-At Errors. APPROX-RANDOM 2012: 553-564 - [i6]Eli Ben-Sasson, Ariel Gabizon, Yohay Kaplan, Swastik Kopparty, Shubhangi Saraf:
A new family of locally correctable codes based on degree-lifted algebraic geometry codes. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [b1]Ariel Gabizon:
Deterministic Extraction from Weak Random Sources. Monographs in Theoretical Computer Science. An EATCS Series, Springer 2011, ISBN 978-3-642-14902-3, pp. i-xi, 1-148 - [i5]Eli Ben-Sasson, Ariel Gabizon:
Extractors for Polynomials Sources over Constant-Size Fields of Small Characteristic. Electron. Colloquium Comput. Complex. TR11 (2011) - 2010
- [c6]Matt DeVos, Ariel Gabizon:
Simple Affine Extractors Using Dimension Expansion. CCC 2010: 50-57 - [c5]Ariel Gabizon, Avinatan Hassidim:
Derandomizing Algorithms on Product Distributions and Other Applications of Order-Based Extraction. ICS 2010: 397-405
2000 – 2009
- 2009
- [j3]Zeev Dvir, Ariel Gabizon, Avi Wigderson:
Extractors And Rank Extractors For Polynomial Sources. Comput. Complex. 18(1): 1-58 (2009) - [i4]Matt DeVos, Ariel Gabizon:
Simple Affine Extractors using Dimension Expansion. Electron. Colloquium Comput. Complex. TR09 (2009) - 2008
- [j2]Ariel Gabizon, Ran Raz:
Deterministic extractors for affine sources over large fields. Comb. 28(4): 415-440 (2008) - [c4]Ariel Gabizon, Ronen Shaltiel:
Increasing the Output Length of Zero-Error Dispersers. APPROX-RANDOM 2008: 430-443 - 2007
- [c3]Zeev Dvir, Ariel Gabizon, Avi Wigderson:
Extractors and Rank Extractors for Polynomial Sources. FOCS 2007: 52-62 - [i3]Zeev Dvir, Ariel Gabizon, Avi Wigderson:
Extractors and Rank Extractors for Polynomial Sources. Electron. Colloquium Comput. Complex. TR07 (2007) - 2006
- [j1]Ariel Gabizon, Ran Raz, Ronen Shaltiel:
Deterministic Extractors for Bit-Fixing Sources by Obtaining an Independent Seed. SIAM J. Comput. 36(4): 1072-1094 (2006) - 2005
- [c2]Ariel Gabizon, Ran Raz:
Deterministic Extractors for Affine Sources over Large Fields. FOCS 2005: 407-418 - [i2]Ariel Gabizon, Ran Raz:
Deterministic Extractors for Affine Sources over Large Fields. Electron. Colloquium Comput. Complex. TR05 (2005) - [i1]Ariel Gabizon, Ran Raz, Ronen Shaltiel:
Deterministic Extractors for Bit-fixing Sources by Obtaining an Independent Seed. Electron. Colloquium Comput. Complex. TR05 (2005) - 2004
- [c1]Ariel Gabizon, Ran Raz, Ronen Shaltiel:
Deterministic Extractors for Bit-Fixing Sources by Obtaining an Independent Seed. FOCS 2004: 394-403
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-02 21:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
