Nicholas Spooner
Artificial Intelligence · 2016–2019
A researcher in the Science corpus: 3 papers; trusts 13 researchers and is trusted by 19 researchers here, as inferred from the citation graph.
Subfields
- Artificial Intelligence — 55 citations into it; #9,112 of 35,345 by trust here, #16,771 by citations
- Computational Theory and Mathematics — 39 citations into it; #3,058 of 12,182 by trust here, #4,059 by citations
- Privacy & Security — 16 citations into it
- Algorithms & Complexity — 9 citations into it
- Program Analysis & Verification — 7 citations into it
- Automated Theorem Proving & Formal Methods — 5 citations into it
Whom Nicholas Spooner trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Eli Ben-Sasson
- Silvio Micali
- Shafi Goldwasser
- Sanjeev Arora
- Lance Fortnow
- László Babai
- Oded Goldreich
- Yuval Ishai
- Adi Shamir
- Alessandro Chiesa
Who trusts Nicholas Spooner overall
Papers from Nicholas Spooner's perspective
Ordered by how strongly the researchers Nicholas Spooner trusts endorse each paper. Same corpus, a different order for every researcher.
- The Knowledge Complexity of Interactive Proof Systems
- The random oracle methodology, revisited (JACM)
- Delegating computation: interactive proofs for muggles
- Resolving the conflict between generality and plausibility in verified computation
- Succinct Non-Interactive Zero Knowledge for a von Neumann Architecture
- Pinocchio: Nearly Practical Verifiable Computation
- Efficient Arguments without Short PCPs
- Separating succinct non-interactive arguments from all falsifiable assumptions
- On the (In)security of the Fiat-Shamir paradigm (44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings.)
- Geppetto: Versatile Verifiable Computation
Their papers
- Interactive Oracle Proofs (2016) — 359 citations
- Aurora: Transparent Succinct Arguments for R1CS (2019) — 447 citations
- Interactive Oracle Proofs with Constant Rate and Query Complexity (2017) — 49 citations