Benedikt Bünz
Artificial Intelligence · 2015–2020
A researcher in the Science corpus: 8 papers; trusts 55 researchers and is trusted by 5 researchers here, as inferred from the citation graph.
Subfields
- Artificial Intelligence — 145 citations into it; #18,543 of 35,345 by trust here, #15,542 by citations
- Information Systems — 73 citations into it; #3,206 of 8,771 by trust here, #1,220 by citations
- Computational Theory and Mathematics — 56 citations into it
- Privacy & Security — 35 citations into it; #640 of 709 by trust here, #552 by citations
- Computer Networks and Communications — 26 citations into it; #5,885 of 9,886 by trust here, #1,955 by citations
- Computer Vision and Pattern Recognition — 12 citations into it
- Algorithms & Complexity — 10 citations into it
- Automated Theorem Proving & Formal Methods — 6 citations into it
Whom Benedikt Bünz trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Eli Ben-Sasson
- Jens Groth
- Alessandro Chiesa
- Dan Boneh
- Helger Lipmaa
- Amos Fiat
- Claus-Peter Schnorr
- Shafi Goldwasser
- Benjamin Wesolowski
- Joseph Bonneau
Who trusts Benedikt Bünz overall
- Srinath T. V. Setty
- Benjamin Wesolowski
- César Sabater
- Eli Ben-Sasson
- Dan Boneh
- Tiancheng Xie
- William L. Hamilton
- Mary Maller
- Jonathan Bootle
- Aurélien Bellet
Papers from Benedikt Bünz's perspective
Ordered by how strongly the researchers Benedikt Bünz trusts endorse each paper. Same corpus, a different order for every researcher.
- How to Prove Yourself: Practical Solutions to Identification and Signature Problems
- Random oracles are practical: a paradigm for designing efficient protocols
- Blind Signatures for Untraceable Payments
- Bitcoin: A Peer-to-Peer Electronic Cash System
- Efficient signature generation by smart cards
- Recursive composition and bootstrapping for SNARKS and proof-carrying data
- Pinocchio: Nearly Practical Verifiable Computation
- Quadratic Span Programs and Succinct NIZKs without PCPs
- Succinct Non-Interactive Zero Knowledge for a von Neumann Architecture
- The Knowledge Complexity of Interactive Proof Systems
Their papers
- Learning a SAT Solver from Single-Bit Supervision (2018) — 517 citations
- Bulletproofs: Short Proofs for Confidential Transactions and More (2018) — 1,327 citations
- Verifiable Delay Functions (2018) — 504 citations
- Zether: Towards Privacy in a Smart Contract World (2020) — 378 citations
- Transparent SNARKs from DARK Compilers (2020) — 352 citations
- Batching Techniques for Accumulators with Applications to IOPs and Stateless Blockchains (2019) — 338 citations
- Proofs-of-delay and randomness beacons in Ethereum (2017)
- Provisions: Privacy-preserving Proofs of Solvency for Bitcoin Exchanges (2015) — 109 citations