Andrew Justin Blumberg
Artificial Intelligence · 2002–2017
A researcher in the Science corpus: 26 papers; trusts 116 researchers and is trusted by 62 researchers here, as inferred from the citation graph.
Subfields
- Artificial Intelligence — 189 citations into it; #4,317 of 35,345 by trust here, #5,924 by citations
- Mathematical Physics — 179 citations into it; #772 of 8,562 by trust here, #505 by citations
- Geometry and Topology — 172 citations into it; #705 of 7,422 by trust here, #483 by citations
- Computational Theory and Mathematics — 125 citations into it; #1,367 of 12,182 by trust here, #1,269 by citations
- Algebra and Number Theory — 105 citations into it; #646 of 2,864 by trust here, #420 by citations
- Privacy & Security — 65 citations into it
- Computer Networks and Communications — 50 citations into it; #1,113 of 9,886 by trust here, #1,395 by citations
- Information Systems — 47 citations into it
Whom Andrew Justin Blumberg trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Michael A. Mandell
- Craig Gentry
- B. Shipley
- Jacob Lurie
- Jon P. May
- M. Hill
- Clark Barwick
- André Joyal
- Julia E. Bergner
- Srinath T. V. Setty
Who trusts Andrew Justin Blumberg overall
- Clark Barwick
- D. Gepner
- L. Cohn
- Srinath T. V. Setty
- Eli Ben-Sasson
- Agelos Georgakopoulos
- Robert Ghrist
- Gonçalo Tabuada
- Riad S. Wahby
- Michael Walfish
Papers from Andrew Justin Blumberg's perspective
Ordered by how strongly the researchers Andrew Justin Blumberg trusts endorse each paper. Same corpus, a different order for every researcher.
- Model categories and their localizations
- Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers
- The Knowledge Complexity of Interactive Proof Systems
- A note on efficient zero-knowledge proofs and arguments (extended abstract)
- Random oracles are practical: a paradigm for designing efficient protocols
- How to Prove Yourself: Practical Solutions to Identification and Signature Problems
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Checking computations in polylogarithmic time
- From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
- Probabilistic checking of proofs: a new characterization of NP
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
- Verifying computations without reexecuting them (2015) — 190 citations
- An ∞‐categorical approach to R‐line bundles, R‐module Thom spectra, and twisted R‐homology (2014) — 101 citations
- Full Accounting for Verifiable Outsourcing (2017) — 80 citations
- Clonal Evolution of Glioblastoma under Therapy (2016) — 667 citations
- Incomplete Tambara functors (2016) — 57 citations
- Efficient RAM and control flow in verifiable outsourced computation (2015) — 190 citations
- Units of ring spectra, orientations, and Thom spectra via rigid infinite loop space theory (2014) — 81 citations
- Topological Cyclic Homology Via the Norm (2014) — 50 citations
- Verifying computations with state (2013) — 209 citations
- The homotopy theory of cyclotomic spectra (2013) — 47 citations
- Operadic multiplications in equivariant spectra, norms, and transfers (2013) — 154 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
- Uniqueness of the multiplicative cyclotomic trace (2011) — 64 citations
- Privacy and accountability for location-based aggregate statistics (2011) — 110 citations
- Parametrized spectra, multiplicative Thom spectra and the twisted Umkehr map (2011) — 76 citations
- Twists of K-theory and TMF (2010) — 66 citations
- A universal characterization of higher algebraic K-theory (2010) — 347 citations