Eli Ben-Sasson

Artificial Intelligence · 2001–2019

A researcher in the Science corpus: 21 papers; trusts 75 researchers and is trusted by 57 researchers here, as inferred from the citation graph.

Subfields

• Artificial Intelligence — 354 citations into it; #2,853 of 35,345 by trust here, #2,759 by citations
• Computational Theory and Mathematics — 220 citations into it; #507 of 12,182 by trust here, #330 by citations
• Information Systems — 94 citations into it; #1,118 of 8,771 by trust here, #614 by citations
• Privacy & Security — 91 citations into it; #248 of 709 by trust here, #125 by citations
• Computer Networks and Communications — 56 citations into it
• Program Analysis & Verification — 45 citations into it
• Geometry and Topology — 36 citations into it
• Automated Theorem Proving & Formal Methods — 35 citations into it

Whom Eli Ben-Sasson trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

1. Alessandro Chiesa
2. Silvio Micali
3. Helger Lipmaa
4. Srinath T. V. Setty
5. Craig Gentry
6. Sanjeev Arora
7. Bryan Parno
8. Jens Groth
9. Rosario Gennaro
10. Justin Thaler

Who trusts Eli Ben-Sasson overall

1. Dan Boneh
2. Iddo Bentov
3. Srinath T. V. Setty
4. Benedikt Bünz
5. Alessandro Chiesa
6. Henry Corrigan-Gibbs
7. Riad S. Wahby
8. Michael Riabzev
9. Michael Walfish
10. Yinon Horesh

Papers from Eli Ben-Sasson's perspective

Ordered by how strongly the researchers Eli Ben-Sasson trusts endorse each paper. Same corpus, a different order for every researcher.

1. The Knowledge Complexity of Interactive Proof Systems
2. Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers
3. How to Prove Yourself: Practical Solutions to Identification and Signature Problems
4. A note on efficient zero-knowledge proofs and arguments (extended abstract)
5. Checking computations in polylogarithmic time
6. Fully homomorphic encryption using ideal lattices
7. From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
8. Random oracles are practical: a paradigm for designing efficient protocols
9. Probabilistic checking of proofs: a new characterization of NP
10. Recursive composition and bootstrapping for SNARKS and proof-carrying data

Their papers

• Zerocash: Decentralized Anonymous Payments from Bitcoin (2014) — 2,121 citations
• Interactive Oracle Proofs (2016) — 359 citations
• Short PCPs verifiable in polylogarithmic time (2005) — 118 citations
• SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge (2013) — 719 citations
• Robust pcps of proximity, shorter pcps and applications to coding (2004) — 339 citations
• Scalable Zero Knowledge with No Trusted Setup (2019) — 252 citations
• Fast reductions from RAMs to delegatable succinct constraint satisfaction problems: extended abstract (2013) — 106 citations
• Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority (2012) — 120 citations
• On the concrete efficiency of probabilistically-checkable proofs (2013) — 80 citations
• Aurora: Transparent Succinct Arguments for R1CS (2019) — 447 citations
• Computational Integrity with a Public Random String from Quasi-Linear PCPs (2017) — 74 citations
• Fast Reed-Solomon Interactive Oracle Proofs of Proximity (2017) — 303 citations
• Short proofs are narrow—resolution made simple (2001) — 575 citations
• Scalable, transparent, and post-quantum secure computational integrity (2018) — 708 citations
• Interactive Oracle Proofs with Constant Rate and Query Complexity (2017) — 49 citations
• Scalable Zero Knowledge Via Cycles of Elliptic Curves (2014) — 356 citations
• SNARKs for C : Verifying Program Executions Succinctly and in Zero Knowledge (2014)
• Succinct Non-Interactive Zero Knowledge for a von Neumann Architecture (2014) — 739 citations
• Extractors for Polynomial Sources over Fields of Constant Order and Small Characteristic (2013) — 12 citations
• Succinct Non-Interactive Arguments for a von Neumann Architecture (2013) — 39 citations