Madars Virza
Artificial Intelligence · 2013–2019
A researcher in the Science corpus: 10 papers; trusts 62 researchers and is trusted by 30 researchers here, as inferred from the citation graph.
Subfields
- Artificial Intelligence — 249 citations into it; #5,670 of 35,345 by trust here, #4,577 by citations
- Computational Theory and Mathematics — 141 citations into it; #2,936 of 12,182 by trust here, #1,291 by citations
- Information Systems — 85 citations into it; #1,369 of 8,771 by trust here, #737 by citations
- Privacy & Security — 59 citations into it; #246 of 709 by trust here, #127 by citations
- Computer Networks and Communications — 39 citations into it
- Geometry and Topology — 28 citations into it
- Program Analysis & Verification — 25 citations into it
- Sociology and Political Science — 21 citations into it; #19,604 of 22,756 by trust here, #9,254 by citations
Whom Madars Virza trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Eli Ben-Sasson
- Helger Lipmaa
- Jens Groth
- Craig Gentry
- Alessandro Chiesa
- Rosario Gennaro
- Justin Thaler
- Silvio Micali
- Bryan Parno
- Oded Goldreich
Who trusts Madars Virza overall
- Eli Ben-Sasson
- Dan Boneh
- Riad S. Wahby
- Iddo Bentov
- Henry Corrigan-Gibbs
- Benedikt Bünz
- Alessandro Chiesa
- Srinath T. V. Setty
- Momin M. Malik
- Michael Walfish
Papers from Madars Virza's perspective
Ordered by how strongly the researchers Madars Virza trusts endorse each paper. Same corpus, a different order for every researcher.
- How to Prove Yourself: Practical Solutions to Identification and Signature Problems
- Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers
- The Knowledge Complexity of Interactive Proof Systems
- Fully homomorphic encryption using ideal lattices
- Checking computations in polylogarithmic time
- Non-interactive zero-knowledge and its applications
- A note on efficient zero-knowledge proofs and arguments (extended abstract)
- Recursive composition and bootstrapping for SNARKS and proof-carrying data
- Making argument systems for outsourced computation practical (sometimes)
- Quadratic Span Programs and Succinct NIZKs without PCPs
Their papers
- Zerocash: Decentralized Anonymous Payments from Bitcoin (2014) — 2,121 citations
- SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge (2013) — 719 citations
- Aurora: Transparent Succinct Arguments for R1CS (2019) — 447 citations
- Computational Integrity with a Public Random String from Quasi-Linear PCPs (2017) — 74 citations
- Interventions over Predictions: Reframing the Ethical Debate for Actuarial Risk Assessment (2017) — 156 citations
- zkLedger: Privacy-Preserving Auditing for Distributed Ledgers (2018) — 184 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
- Succinct Non-Interactive Arguments for a von Neumann Architecture (2013) — 39 citations