| 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 | 882 | 2018 |
| Verifiable delay functions D Boneh, J Bonneau, B Bünz, B Fisch Advances in Cryptology–CRYPTO 2018: 38th Annual International Cryptology …, 2018 | 389 | 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 | 364 | 2018 |
| Zether: Towards privacy in a smart contract world B Bünz, S Agrawal, M Zamani, D Boneh Financial Cryptography and Data Security: 24th International Conference, FC …, 2020 | 249 | 2020 |
| 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 | 216 | 2019 |
| Transparent SNARKs from DARK compilers B Bünz, B Fisch, A Szepieniec Advances in Cryptology–EUROCRYPT 2020: 39th Annual International Conference …, 2020 | 177 | 2020 |
| A survey of two verifiable delay functions D Boneh, B Bünz, B Fisch Cryptology ePrint Archive, 2018 | 122 | 2018 |
| 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 | 97* | 2020 |
| 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 | 85 | 2015 |
| 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 | 71 | 2017 |
| Proofs for inner pairing products and applications B Bünz, M Maller, P Mishra, N Tyagi, P Vesely Advances in Cryptology–ASIACRYPT 2021: 27th International Conference on the …, 2021 | 53 | 2021 |
| Proof-carrying data from accumulation schemes B Bünz, A Chiesa, P Mishra, N Spooner Cryptology ePrint Archive, 2020 | 31 | 2020 |
| Designing core-selecting payment rules: A computational search approach B Bünz, B Lubin, S Seuken Information Systems Research 33 (4), 1157-1173, 2022 | 26 | 2022 |
| Recursive proof composition from accumulation schemes B Bünz, A Chiesa, P Mishra, N Spooner Theory of Cryptography: 18th International Conference, TCC 2020, Durham, NC …, 2020 | 26 | 2020 |
| Proof-carrying data without succinct arguments B Bünz, A Chiesa, W Lin, P Mishra, N Spooner Advances in Cryptology–CRYPTO 2021: 41st Annual International Cryptology …, 2021 | 25 | 2021 |
| 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 | 20 | 2020 |
| Graph Neural Networks and Boolean Satisfiability M Lamm, B Bünz | 17* | |
| Computing Bayes-Nash equilibria in combinatorial auctions with continuous value and action spaces V Bosshard, B Bünz, B Lubin, S Seuken International Joint Conferences on Artificial Intelligence Organization, 2017 | 16 | 2017 |
| A Faster Core Constraint Generation Algorithm for Combinatorial Auctions B Bünz, S Seuken, B Lubin AAAI 2015, 2015 | 16 | 2015 |
| New core-selecting payment rules with better fairness and incentive properties B Lubin, B Bünz, S Seuken ACM, 2015 | 10 | 2015 |
Dan BonehProfessor of Computer Science, Stanford UniversityVerified email at cs.stanford.edu
