| Bulletproofs: Short proofs for confidential transactions and more B Bünz, J Bootle, D Boneh, A Poelstra, P Wuille, G Maxwell 2018 IEEE Symposium on Security and Privacy (SP), 315-334, 2018 | 398 | 2018 |
| Verifiable delay functions D Boneh, J Bonneau, B Bünz, B Fisch Annual international cryptology conference, 757-788, 2018 | 175 | 2018 |
| Learning a SAT solver from single-bit supervision D Selsam, M Lamm, B Bünz, P Liang, L de Moura, DL Dill arXiv preprint arXiv:1802.03685, 2018 | 174 | 2018 |
| Batching Techniques for Accumulators with Applications to IOPs and Stateless Blockchains D Boneh, B Bünz, B Fisch Annual International Cryptology Conference, 561-586, 2019 | 78 | 2019 |
| Zether: Towards privacy in a smart contract world B Bünz, S Agrawal, M Zamani, D Boneh International Conference on Financial Cryptography and Data Security, 423-443, 2020 | 77 | 2020 |
| A Survey of Two Verifiable Delay Functions. D Boneh, B Bünz, B Fisch IACR Cryptol. ePrint Arch. 2018, 712, 2018 | 67 | 2018 |
| Provisions: Privacy-preserving proofs of solvency for bitcoin exchanges GG Dagher, B Bünz, J Bonneau, J Clark, D Boneh Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications …, 2015 | 58 | 2015 |
| Transparent SNARKs from DARK compilers B Bünz, B Fisch, A Szepieniec Annual International Conference on the Theory and Applications of …, 2020 | 55 | 2020 |
| Flyclient: Super-light clients for cryptocurrencies B Bünz, L Kiffer, L Luu, M Zamani 2020 IEEE Symposium on Security and Privacy (SP), 928-946, 2020 | 38* | 2020 |
| Proofs-of-delay and randomness beacons in ethereum B Bünz, S Goldfeder, J Bonneau IEEE Security and Privacy on the blockchain (IEEE S&B), 2017 | 38 | 2017 |
| Designing core-selecting payment rules: A computational search approach B Bünz, B Lubin, S Seuken Available at SSRN 3178454, 2020 | 17 | 2020 |
| Proofs for inner pairing products and applications B Bünz, M Maller, P Mishra, N Vesely IACR Cryptol. ePrint Arch 1177, 2019, 2019 | 14 | 2019 |
| A Faster Core Constraint Generation Algorithm for Combinatorial Auctions B Bünz, S Seuken, B Lubin AAAI 2015, 2015 | 13 | 2015 |
| Computing Bayes-Nash Equilibria in Combinatorial Auctions with Continuous Value and Action Spaces. V Bosshard, B Bünz, B Lubin, S Seuken IJCAI, 119-127, 2017 | 11 | 2017 |
| New core-selecting payment rules with better fairness and incentive properties B Lubin, B Bünz, S Seuken ACM, 2015 | 10 | 2015 |
| Proof-Carrying Data from Accumulation Schemes. B Bünz, A Chiesa, P Mishra, N Spooner IACR Cryptol. ePrint Arch. 2020, 499, 2020 | 9 | 2020 |
| Graph Neural Networks and Boolean Satisfiability M Lamm, B Bünz | 7* | |
| Computing bayes-nash equilibria in combinatorial auctions with verification V Bosshard, B Bünz, B Lubin, S Seuken Journal of Artificial Intelligence Research 69, 531-570, 2020 | 6 | 2020 |
| Proof-Carrying Data without Succinct Arguments B Bünz, A Chiesa, W Lin, P Mishra, N Spooner | 1 | 2020 |
| Recursive Proof Composition from Accumulation Schemes B Bünz, A Chiesa, P Mishra, N Spooner Theory of Cryptography Conference, 1-18, 2020 | 1 | 2020 |
Dan BonehProfessor of Computer Science, Stanford UniversityVerified email at cs.stanford.edu
