Ariel Gabizon

According to our database1, Ariel Gabizon authored at least 54 papers between 2005 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Stackproofs: Private proofs of stack and contract execution using Protogalaxy.
IACR Cryptol. ePrint Arch., 2024

2023
ProtoGalaxy: Efficient ProtoStar-style folding of multiple instances.
IACR Cryptol. ePrint Arch., 2023

cqlin: Efficient linear operations on KZG commitments with cached quotients.
IACR Cryptol. ePrint Arch., 2023

2022
Baloo: Nearly Optimal Lookup Arguments.
IACR Cryptol. ePrint Arch., 2022

flookup: Fractional decomposition-based lookups in quasi-linear time independent of table size.
IACR Cryptol. ePrint Arch., 2022

cq: Cached quotients for fast lookups.
IACR Cryptol. ePrint Arch., 2022

2021
Plumo: An Ultralight Blockchain Client.
IACR Cryptol. ePrint Arch., 2021

fflonk: a Fast-Fourier inspired verifier efficient version of PlonK.
IACR Cryptol. ePrint Arch., 2021

Halo Infinite: Proof-Carrying Data from Additive Polynomial Commitments.
Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

2020
plookup: A simplified polynomial protocol for lookup tables.
IACR Cryptol. ePrint Arch., 2020

Halo Infinite: Recursive zk-SNARKs from any Additive Polynomial Commitment Scheme.
IACR Cryptol. ePrint Arch., 2020

Efficient polynomial commitment schemes for multiple points and polynomials.
IACR Cryptol. ePrint Arch., 2020

2019
PLONK: Permutations over Lagrange-bases for Oecumenical Noninteractive arguments of Knowledge.
IACR Cryptol. ePrint Arch., 2019

Improved prover efficiency and SRS size in a Sonic-like system.
IACR Cryptol. ePrint Arch., 2019

On the efficiency of pairing-based proofs under the d-PKE.
IACR Cryptol. ePrint Arch., 2019

On the security of the BCTV Pinocchio zk-SNARK variant.
IACR Cryptol. ePrint Arch., 2019

Twenty (Short) Questions.
Comb., 2019

2018
Making Groth's zk-SNARK Simulation Extractable in the Random Oracle Model.
IACR Cryptol. ePrint Arch., 2018

2017
Scalable Multi-party Computation for zk-SNARK Parameters in the Random Beacon Model.
IACR Cryptol. ePrint Arch., 2017

A multi-party protocol for constructing the public parameters of the Pinocchio zk-SNARK.
IACR Cryptol. ePrint Arch., 2017

Zero Knowledge Protocols from Succinct Constraint Detection.
Proceedings of the Theory of Cryptography - 15th International Conference, 2017

Twenty (simple) questions.
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017

Interactive Oracle Proofs with Constant Rate and Query Complexity.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

Almost Optimal Cover-Free Families.
Proceedings of the Algorithms and Complexity - 10th International Conference, 2017

2016
Subspace Polynomials and Cyclic Subspace Codes.
IEEE Trans. Inf. Theory, 2016

The k-distinct language: Parameterized automata constructions.
Theor. Comput. Sci., 2016

Computational integrity with a public random string from quasi-linear PCPs.
IACR Cryptol. ePrint Arch., 2016

Quasi-Linear Size Zero Knowledge from Linear-Algebraic PCPs.
Electron. Colloquium Comput. Complex., 2016

Short Interactive Oracle Proofs with Constant Query Complexity, via Composition and Sumcheck.
Electron. Colloquium Comput. Complex., 2016

On Probabilistic Checking in Perfect Zero Knowledge.
Electron. Colloquium Comput. Complex., 2016

A security analysis of Probabilistically Checkable Proofs.
Electron. Colloquium Comput. Complex., 2016

Improved concrete efficiency and security analysis of Reed-Solomon PCPPs.
Electron. Colloquium Comput. Complex., 2016

Bitcoin Beacon.
CoRR, 2016

Distribution Design.
Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science, 2016

Cryptocurrencies Without Proof of Work.
Proceedings of the Financial Cryptography and Data Security, 2016

2015
Deterministic Extractors for Additive Sources: Extended Abstract.
Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science, 2015

Fast Algorithms for Parameterized Problems with Relaxed Disjointness Constraints.
Proceedings of the Algorithms - ESA 2015, 2015

2014
Non-Interactive Secure Multiparty Computation.
IACR Cryptol. ePrint Arch., 2014

On <i>r</i>-Simple <i>k</i>-Path.
Electron. Colloquium Comput. Complex., 2014

Representative sets for multisets.
CoRR, 2014

Deterministic Extractors for Additive Sources.
CoRR, 2014

Relations between automata and the simple k-path problem.
CoRR, 2014

On r-Simple k-Path.
Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

2013
Extractors for Polynomial Sources over Fields of Constant Order and Small Characteristic.
Theory Comput., 2013

2012
Increasing the output length of zero-error dispersers.
Random Struct. Algorithms, 2012

A new family of locally correctable codes based on degree-lifted algebraic geometry codes.
Electron. Colloquium Comput. Complex., 2012

Invertible Zero-Error Dispersers and Defective Memory with Stuck-At Errors.
Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2012

2011
Deterministic Extraction from Weak Random Sources
Monographs in Theoretical Computer Science. An EATCS Series, Springer, ISBN: 978-3-642-14903-0, 2011

Extractors for Polynomials Sources over Constant-Size Fields of Small Characteristic.
Electron. Colloquium Comput. Complex., 2011

2010
Derandomizing Algorithms on Product Distributions and Other Applications of Order-Based Extraction.
Proceedings of the Innovations in Computer Science, 2010

2009
Simple Affine Extractors using Dimension Expansion.
Electron. Colloquium Comput. Complex., 2009

Extractors And Rank Extractors For Polynomial Sources.
Comput. Complex., 2009

2006
Deterministic Extractors for Bit-Fixing Sources by Obtaining an Independent Seed.
SIAM J. Comput., 2006

2005
Deterministic Extractors for Affine Sources over Large Fields
Electron. Colloquium Comput. Complex., 2005


  Loading...