Alessandro Chiesa
Artificial Intelligence · 2012–2020
A researcher in the Science corpus: 15 papers; trusts 69 researchers and is trusted by 70 researchers here, as inferred from the citation graph.
Subfields
- Artificial Intelligence — 329 citations into it; #3,259 of 36,961 by trust here, #3,166 by citations
- Computational Theory and Mathematics — 217 citations into it; #430 of 12,489 by trust here, #332 by citations
- Information Systems — 98 citations into it; #1,559 of 9,233 by trust here, #889 by citations
- Privacy & Security — 80 citations into it; #117 of 710 by trust here, #96 by citations
- Computer Networks and Communications — 73 citations into it
- Program Analysis & Verification — 38 citations into it
- Geometry and Topology — 36 citations into it
- Algorithms & Complexity — 31 citations into it
Whom Alessandro Chiesa trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Eli Ben-Sasson
- Helger Lipmaa
- Craig Gentry
- Silvio Micali
- Shafi Goldwasser
- Rosario Gennaro
- Jens Groth
- Sanjeev Arora
- Justin Thaler
- Oded Goldreich
Who trusts Alessandro Chiesa overall
- Eli Ben-Sasson
- Dan Boneh
- Iddo Bentov
- Benedikt Bünz
- Riad S. Wahby
- Srinath T. V. Setty
- Michael Walfish
- Eran Tromer
- Henry Corrigan-Gibbs
- Michael Riabzev
Papers from Alessandro Chiesa's perspective
Ordered by how strongly the researchers Alessandro Chiesa trusts endorse each paper. Same corpus, a different order for every researcher.
- The Knowledge Complexity of Interactive Proof Systems
- Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers
- Fully homomorphic encryption using ideal lattices
- A note on efficient zero-knowledge proofs and arguments (extended abstract)
- How to Prove Yourself: Practical Solutions to Identification and Signature Problems
- From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
- Checking computations in polylogarithmic time
- Non-interactive zero-knowledge and its applications
- Random oracles are practical: a paradigm for designing efficient protocols
- Pinocchio: Nearly Practical Verifiable Computation
Their papers
- From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again (2012) — 588 citations
- Zerocash: Decentralized Anonymous Payments from Bitcoin (2014) — 2,121 citations
- Recursive composition and bootstrapping for SNARKS and proof-carrying data (2013) — 364 citations
- Interactive Oracle Proofs (2016) — 359 citations
- SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge (2013) — 719 citations
- Fast reductions from RAMs to delegatable succinct constraint satisfaction problems: extended abstract (2013) — 106 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
- Marlin: Preprocessing zkSNARKs with Universal and Updatable SRS (2020) — 499 citations
- Interactive Oracle Proofs with Constant Rate and Query Complexity (2017) — 49 citations
- Scalable Zero Knowledge Via Cycles of Elliptic Curves (2014) — 356 citations
- Succinct Non-Interactive Zero Knowledge for a von Neumann Architecture (2014) — 739 citations
- Succinct Non-Interactive Arguments for a von Neumann Architecture (2013) — 39 citations
- Fast Reductions from RAMs to Delegatable Succinct Constraint Satisfaction Problems (full version) (2013) — 3 citations