Riad S. Wahby
Artificial Intelligence · 2006–2018
A researcher in the Science corpus: 6 papers; trusts 42 researchers and is trusted by 11 researchers here, as inferred from the citation graph.
Subfields
- Artificial Intelligence — 109 citations into it; #12,653 of 35,345 by trust here, #12,244 by citations
- Computational Theory and Mathematics — 64 citations into it; #11,194 of 12,182 by trust here, #6,798 by citations
- Information Systems — 33 citations into it
- Privacy & Security — 32 citations into it; #622 of 709 by trust here, #608 by citations
- Computer Networks and Communications — 28 citations into it; #6,726 of 9,886 by trust here, #4,594 by citations
- Hardware and Architecture — 25 citations into it; #1,365 of 1,551 by trust here, #1,220 by citations
- Electrical and Electronic Engineering — 17 citations into it; #15,294 of 16,539 by trust here, #14,379 by citations
- Program Analysis & Verification — 17 citations into it; #263 of 301 by trust here, #196 by citations
Whom Riad S. Wahby trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Justin Thaler
- Eli Ben-Sasson
- Srinath T. V. Setty
- Daniel J. Bernstein
- Jens Groth
- Alessandro Chiesa
- Rosario Gennaro
- Bryan Parno
- Craig Gentry
- Shafi Goldwasser
Who trusts Riad S. Wahby overall
- Srinath T. V. Setty
- Eli Ben-Sasson
- Dan Boneh
- Tiancheng Xie
- Michael Walfish
- Henry Corrigan-Gibbs
- Iddo Bentov
- Arjun Narayan
- Jiaheng Zhang
- Andrew Justin Blumberg
Papers from Riad S. Wahby's perspective
Ordered by how strongly the researchers Riad S. Wahby trusts endorse each paper. Same corpus, a different order for every researcher.
- The Knowledge Complexity of Interactive Proof Systems
- Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers
- A note on efficient zero-knowledge proofs and arguments (extended abstract)
- Quadratic Span Programs and Succinct NIZKs without PCPs
- Random oracles are practical: a paradigm for designing efficient protocols
- How to Prove Yourself: Practical Solutions to Identification and Signature Problems
- Delegating computation: interactive proofs for muggles
- Recursive composition and bootstrapping for SNARKS and proof-carrying data
- From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
- Resolving the conflict between generality and plausibility in verified computation
Their papers
- Doubly-Efficient zkSNARKs Without Trusted Setup (2018) — 362 citations
- New Architectures for Radio-Frequency DC–DC Power Conversion (2006) — 148 citations
- Full Accounting for Verifiable Outsourcing (2017) — 80 citations
- Encoding, Fast and Slow: Low-Latency Video Processing Using Thousands of Tiny Threads (2017) — 374 citations
- Verifiable ASICs (2016) — 78 citations
- Efficient RAM and control flow in verifiable outsourced computation (2015) — 190 citations