Michael Walfish
Artificial Intelligence · 2007–2018
A researcher in the Science corpus: 14 papers; trusts 82 researchers and is trusted by 42 researchers here, as inferred from the citation graph.
Subfields
- Artificial Intelligence — 269 citations into it; #3,984 of 35,345 by trust here, #5,317 by citations
- Computational Theory and Mathematics — 139 citations into it; #1,200 of 12,182 by trust here, #1,101 by citations
- Privacy & Security — 86 citations into it; #612 of 709 by trust here, #526 by citations
- Computer Networks and Communications — 80 citations into it; #1,112 of 9,886 by trust here, #1,064 by citations
- Information Systems — 73 citations into it
- Algorithms & Complexity — 37 citations into it
- Hardware and Architecture — 36 citations into it; #1,363 of 1,551 by trust here, #1,220 by citations
- Program Analysis & Verification — 30 citations into it; #120 of 301 by trust here, #74 by citations
Whom Michael Walfish trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Craig Gentry
- Srinath T. V. Setty
- Justin Thaler
- Eli Ben-Sasson
- Bryan Parno
- Shafi Goldwasser
- Sanjeev Arora
- Rosario Gennaro
- Joe Kilian
- Adi Shamir
Who trusts Michael Walfish overall
- Srinath T. V. Setty
- Eli Ben-Sasson
- Henry Corrigan-Gibbs
- Riad S. Wahby
- Justin Thaler
- Dan Boneh
- Arjun Narayan
- Andrew Justin Blumberg
- Iddo Bentov
- Bryan Parno
Papers from Michael Walfish's perspective
Ordered by how strongly the researchers Michael Walfish trusts endorse each paper. Same corpus, a different order for every researcher.
- Random oracles are practical: a paradigm for designing efficient protocols
- A note on efficient zero-knowledge proofs and arguments (extended abstract)
- 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
- 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
- Probabilistic checking of proofs: a new characterization of NP
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
Their papers
- Resolving the conflict between generality and plausibility in verified computation (2013) — 157 citations
- A Hybrid Architecture for Interactive Verifiable Computation (2013) — 177 citations
- Doubly-Efficient zkSNARKs Without Trusted Setup (2018) — 362 citations
- Verifying computations without reexecuting them (2015) — 190 citations
- Full Accounting for Verifiable Outsourcing (2017) — 80 citations
- The Efficient Server Audit Problem, Deduplicated Re-execution, and the Web (2017) — 25 citations
- Scalable and Private Media Consumption with Popcorn (2016) — 127 citations
- Verifiable ASICs (2016) — 78 citations
- Efficient RAM and control flow in verifiable outsourced computation (2015) — 190 citations
- Verifying computations with state (2013) — 209 citations
- Taking Proof-Based Verified Computation a Few Steps Closer to Practicality (2012) — 195 citations
- Making argument systems for outsourced computation practical (sometimes) (2012) — 188 citations
- Depot: Cloud Storage with Minimal Trust (2010) — 336 citations
- Evaluating discourse-based answer extraction for why-question answering (2007) — 402 citations