Michael Riabzev
Artificial Intelligence · 2017–2019
A researcher in the Science corpus: 6 papers; trusts 39 researchers and is trusted by 13 researchers here, as inferred from the citation graph.
Subfields
- Artificial Intelligence — 135 citations into it; #12,017 of 35,345 by trust here, #14,181 by citations
- Computational Theory and Mathematics — 94 citations into it; #4,120 of 12,182 by trust here, #3,033 by citations
- Privacy & Security — 39 citations into it
- Information Systems — 27 citations into it; #5,306 of 8,771 by trust here, #4,885 by citations
- Computer Networks and Communications — 21 citations into it
- Program Analysis & Verification — 17 citations into it
- Algorithms & Complexity — 15 citations into it
- Automated Theorem Proving & Formal Methods — 11 citations into it
Whom Michael Riabzev trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Eli Ben-Sasson
- Alessandro Chiesa
- Srinath T. V. Setty
- Silvio Micali
- Jens Groth
- Bryan Parno
- Joe Kilian
- Sanjeev Arora
- Craig Gentry
- Yuval Ishai
Who trusts Michael Riabzev overall
Papers from Michael Riabzev's perspective
Ordered by how strongly the researchers Michael Riabzev 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
- A note on efficient zero-knowledge proofs and arguments (extended abstract)
- Delegating computation: interactive proofs for muggles
- Making argument systems for outsourced computation practical (sometimes)
- Resolving the conflict between generality and plausibility in verified computation
- Pinocchio: Nearly Practical Verifiable Computation
- Succinct Non-Interactive Zero Knowledge for a von Neumann Architecture
- From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
- Recursive composition and bootstrapping for SNARKS and proof-carrying data
Their papers
- Scalable Zero Knowledge with No Trusted Setup (2019) — 252 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
- Scalable, transparent, and post-quantum secure computational integrity (2018) — 708 citations
- Interactive Oracle Proofs with Constant Rate and Query Complexity (2017) — 49 citations