Srinath T. V. Setty
Artificial Intelligence · 2010–2020
A researcher in the Science corpus: 12 papers; trusts 148 researchers and is trusted by 42 researchers here, as inferred from the citation graph.
Subfields
- Artificial Intelligence — 261 citations into it; #4,822 of 35,345 by trust here, #6,378 by citations
- Computational Theory and Mathematics — 131 citations into it; #2,018 of 12,182 by trust here, #1,890 by citations
- Computer Networks and Communications — 86 citations into it; #1,070 of 9,886 by trust here, #925 by citations
- Privacy & Security — 81 citations into it; #286 of 709 by trust here, #217 by citations
- Information Systems — 51 citations into it
- Algorithms & Complexity — 26 citations into it
- Program Analysis & Verification — 20 citations into it; #216 of 301 by trust here, #102 by citations
- Hardware and Architecture — 17 citations into it
Whom Srinath T. V. Setty trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Craig Gentry
- Jens Groth
- Sanjeev Arora
- Eli Ben-Sasson
- Silvio Micali
- Bryan Parno
- Shafi Goldwasser
- Yuval Ishai
- Rosario Gennaro
- Joe Kilian
Who trusts Srinath T. V. Setty overall
- Eli Ben-Sasson
- Justin Thaler
- Michael Walfish
- Riad S. Wahby
- Arjun Narayan
- Andrew Justin Blumberg
- Bryan Parno
- Iddo Bentov
- Alessandro Chiesa
- Victor Vu
Papers from Srinath T. V. Setty's perspective
Ordered by how strongly the researchers Srinath T. V. Setty trusts endorse each paper. Same corpus, a different order for every researcher.
- Random oracles are practical: a paradigm for designing efficient protocols
- How to Prove Yourself: Practical Solutions to Identification and Signature Problems
- The Knowledge Complexity of Interactive Proof Systems
- Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers
- ImageNet classification with deep convolutional neural networks
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Recursive composition and bootstrapping for SNARKS and proof-carrying data
- Fully homomorphic encryption using ideal lattices
- Quadratic Span Programs and Succinct NIZKs without PCPs
- A note on efficient zero-knowledge proofs and arguments (extended abstract)
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
- PIR with Compressed Queries and Amortized Query Processing (2018) — 364 citations
- Spartan: Efficient and general-purpose zkSNARKs without trusted setup (2020) — 421 citations
- Scalable and Private Media Consumption with Popcorn (2016) — 127 citations
- IronFleet: proving practical distributed systems correct (2015) — 434 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
- Airavat: Security and Privacy for MapReduce (2010) — 558 citations
- Depot: Cloud Storage with Minimal Trust (2010) — 336 citations