Benjamin Braun

Artificial Intelligence · with Blumberg · 2012–2013

A researcher in the Science corpus: 3 papers; trusts 25 researchers and is trusted by 14 researchers here, as inferred from the citation graph.

Subfields

• Artificial Intelligence — 67 citations into it; #9,642 of 35,345 by trust here, #11,490 by citations
• Computational Theory and Mathematics — 38 citations into it; #5,604 of 12,182 by trust here, #3,562 by citations
• Computer Networks and Communications — 20 citations into it; #6,668 of 9,886 by trust here, #3,993 by citations
• Privacy & Security — 18 citations into it
• Information Systems — 13 citations into it
• Algorithms & Complexity — 10 citations into it
• Program Analysis & Verification — 8 citations into it; #167 of 301 by trust here, #102 by citations
• Hardware and Architecture — 6 citations into it

Whom Benjamin Braun trusts overall

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

1. Craig Gentry
2. Srinath T. V. Setty
3. Bryan Parno
4. Shafi Goldwasser
5. Sanjeev Arora
6. Joe Kilian
7. Oded Regev
8. Torben P. Pedersen
9. Silvio Micali
10. Rosario Gennaro

Who trusts Benjamin Braun overall

1. Srinath T. V. Setty
2. Eli Ben-Sasson
3. Riad S. Wahby
4. Arjun Narayan
5. Justin Thaler
6. Michael Walfish
7. Bryan Parno
8. Alessandro Chiesa
9. Andrew Justin Blumberg
10. Yupeng Zhang

Papers from Benjamin Braun's perspective

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

1. Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers
2. The Knowledge Complexity of Interactive Proof Systems
3. Checking computations in polylogarithmic time
4. A note on efficient zero-knowledge proofs and arguments (extended abstract)
5. Improved Delegation of Computation using Fully Homomorphic Encryption
6. Fairplay - Secure Two-Party Computation System
7. Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
8. Probabilistic checking of proofs: a new characterization of NP
9. From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
10. Computationally Sound Proofs

Their papers

• Resolving the conflict between generality and plausibility in verified computation (2013) — 157 citations
• Verifying computations with state (2013) — 209 citations
• Taking Proof-Based Verified Computation a Few Steps Closer to Practicality (2012) — 195 citations