Ariel Gabizon
Artificial Intelligence · 2013–2019
A researcher in the Science corpus: 6 papers; trusts 14 researchers and is trusted by 4 researchers here, as inferred from the citation graph.
Subfields
- Artificial Intelligence — 61 citations into it; #23,356 of 35,345 by trust here, #12,761 by citations
- Computational Theory and Mathematics — 37 citations into it
- Information Systems — 20 citations into it; #6,732 of 8,771 by trust here, #3,198 by citations
- Privacy & Security — 17 citations into it
- Algorithms & Complexity — 6 citations into it
Whom Ariel Gabizon trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Eli Ben-Sasson
- Eike Kiltz
- Alessandro Chiesa
- Jens Groth
- Rosario Gennaro
- Julian Loss
- Craig Gentry
- Ittay Eyal
- Srinath T. V. Setty
- Sanjeev Arora
Who trusts Ariel Gabizon overall
- Srinath T. V. Setty
- Eli Ben-Sasson
- Giang-Truong Nguyen
- Alessandro Chiesa
- Matteo Campanelli
- Yang Xiao
- Arka Rai Choudhuri
Papers from Ariel Gabizon's perspective
Ordered by how strongly the researchers Ariel Gabizon trusts endorse each paper. Same corpus, a different order for every researcher.
- Quadratic Span Programs and Succinct NIZKs without PCPs
- The Knowledge Complexity of Interactive Proof Systems
- Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers
- Recursive composition and bootstrapping for SNARKS and proof-carrying data
- Making argument systems for outsourced computation practical (sometimes)
- A note on efficient zero-knowledge proofs and arguments (extended abstract)
- From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
- Computationally Sound Proofs
- Delegating computation: interactive proofs for muggles
- Proof verification and hardness of approximation problems
Their papers
- Computational Integrity with a Public Random String from Quasi-Linear PCPs (2017) — 74 citations
- PLONK: Permutations over Lagrange-bases for Oecumenical Noninteractive arguments of Knowledge (2019) — 793 citations
- A multi-party protocol for constructing the public parameters of the Pinocchio zk-SNARK (2018) — 156 citations
- Interactive Oracle Proofs with Constant Rate and Query Complexity (2017) — 49 citations
- Cryptocurrencies Without Proof of Work (2014) — 399 citations
- Extractors for Polynomial Sources over Fields of Constant Order and Small Characteristic (2013) — 12 citations