Bryan Parno
Artificial Intelligence · 2005–2017
A researcher in the Science corpus: 14 papers; trusts 84 researchers and is trusted by 105 researchers here, as inferred from the citation graph.
Subfields
- Artificial Intelligence — 191 citations into it; #2,780 of 36,961 by trust here, #2,830 by citations
- Computational Theory and Mathematics — 88 citations into it; #1,084 of 12,489 by trust here, #839 by citations
- Computer Networks and Communications — 87 citations into it; #1,159 of 9,996 by trust here, #774 by citations
- Information Systems — 77 citations into it; #480 of 9,233 by trust here, #352 by citations
- Privacy & Security — 36 citations into it; #49 of 710 by trust here, #55 by citations
- Signal Processing — 32 citations into it; #3,232 of 7,592 by trust here, #1,487 by citations
- Algorithms & Complexity — 16 citations into it
- Hardware and Architecture — 16 citations into it; #147 of 1,731 by trust here, #295 by citations
Whom Bryan Parno trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Craig Gentry
- Rosario Gennaro
- Srinath T. V. Setty
- Silvio Micali
- Dan Boneh
- Sanjeev Arora
- Amit Sahai
- Brent Waters
- Arvind Seshadri
- Adrian Perrig
Who trusts Bryan Parno overall
- Eli Ben-Sasson
- Srinath T. V. Setty
- Michael Walfish
- Rosario Gennaro
- Andrew Justin Blumberg
- Justin Thaler
- Jean-Pierre Hubaux
- Riad S. Wahby
- Arjun Narayan
- Alessandro Chiesa
Papers from Bryan Parno's perspective
Ordered by how strongly the researchers Bryan Parno 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
- Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers
- Fully homomorphic encryption using ideal lattices
- New Directions in Cryptography
- The Knowledge Complexity of Interactive Proof Systems
- A note on efficient zero-knowledge proofs and arguments (extended abstract)
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Protocols for secure computations
- From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
Their papers
- IronFleet: proving practical distributed systems correct (2015) — 434 citations
- Quadratic Span Programs and Succinct NIZKs without PCPs (2013) — 917 citations
- Resolving the conflict between generality and plausibility in verified computation (2013) — 157 citations
- Pinocchio coin: building zerocoin from a succinct pairing-based proof system (2013) — 127 citations
- Komodo: Using verification to disentangle secure-enclave hardware from software (2017) — 217 citations
- Geppetto: Versatile Verifiable Computation (2015) — 241 citations
- Permacoin: Repurposing Bitcoin Work for Data Preservation (2014) — 300 citations
- Pinocchio: Nearly Practical Verifiable Computation (2013) — 1,238 citations
- How to Delegate and Verify in Public: Verifiable Computation from Attribute-based Encryption (2012) — 379 citations
- Bootstrapping Trust in Modern Computers (2011) — 85 citations
- Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers (2010) — 1,221 citations
- Flicker: an execution infrastructure for tcb minimization (2008) — 792 citations
- Distributed detection of node replication attacks in sensor networks (2005) — 836 citations
- Challenges in Securing Vehicular Networks (2005) — 568 citations