Abhi Shelat

Artificial Intelligence · 2002–2018

A researcher in the Science corpus: 10 papers; trusts 62 researchers and is trusted by 24 researchers here, as inferred from the citation graph.

Subfields

• Artificial Intelligence — 166 citations into it; #10,580 of 35,345 by trust here, #8,619 by citations
• Computational Theory and Mathematics — 86 citations into it; #10,099 of 12,182 by trust here, #3,339 by citations
• Information Systems — 49 citations into it; #3,747 of 8,771 by trust here, #4,188 by citations
• Privacy & Security — 45 citations into it; #268 of 709 by trust here, #351 by citations
• Computer Networks and Communications — 34 citations into it; #3,646 of 9,886 by trust here, #3,523 by citations
• Hardware and Architecture — 22 citations into it; #1,364 of 1,551 by trust here, #1,220 by citations
• Computer Vision and Pattern Recognition — 19 citations into it
• Electrical and Electronic Engineering — 14 citations into it

Whom Abhi Shelat trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

1. Jens Groth
2. Justin Thaler
3. Ivan Bjerre Damgård
4. Yehuda Lindell
5. Dan Boneh
6. Eli Ben-Sasson
7. Benny Pinkas
8. Daniel J. Bernstein
9. Helger Lipmaa
10. Srinath T. V. Setty

Who trusts Abhi Shelat overall

1. Srinath T. V. Setty
2. Yehuda Lindell
3. Samee Zahur
4. Mihir Bellare
5. Dan Boneh
6. David E. Evans
7. Viet Tung Hoang
8. Valeria Nikolaenko
9. Rafael Pass
10. Shay Gueron

Papers from Abhi Shelat's perspective

Ordered by how strongly the researchers Abhi Shelat trusts endorse each paper. Same corpus, a different order for every researcher.

1. Random oracles are practical: a paradigm for designing efficient protocols
2. How to Prove Yourself: Practical Solutions to Identification and Signature Problems
3. Fairplay - Secure Two-Party Computation System
4. The Knowledge Complexity of Interactive Proof Systems
5. Protocols for secure computations
6. Fair exchange with a semi-trusted third party (extended abstract)
7. Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers
8. Quadratic Span Programs and Succinct NIZKs without PCPs
9. A note on efficient zero-knowledge proofs and arguments (extended abstract)
10. Recursive composition and bootstrapping for SNARKS and proof-carrying data

Their papers

• Doubly-Efficient zkSNARKs Without Trusted Setup (2018) — 362 citations
• Additive Combinatorics and Discrete Logarithm Based Range Protocols (2010) — 43 citations
• Efficient Secure Computation with Garbled Circuits (2011) — 135 citations
• Analysis of the Blockchain Protocol in Asynchronous Networks (2017) — 734 citations
• Full Accounting for Verifiable Outsourcing (2017) — 80 citations
• Verifiable ASICs (2016) — 78 citations
• ANONIZE: A Large-Scale Anonymous Survey System (2014) — 45 citations
• Billion-Gate Secure Computation with Malicious Adversaries (2012) — 243 citations
• Efficient Protocols for Set Membership and Range Proofs (2008) — 324 citations
• Approximation algorithms for grammar-based compression (2002) — 103 citations