Benedikt Bünz

Orcid: 0000-0003-2082-4480

According to our database1, Benedikt Bünz authored at least 43 papers between 2015 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
zkPHIRE: A Programmable Accelerator for ZKPs over HIgh-degRee, Expressive Gates.
CoRR, August, 2025

MTU: The Multifunction Tree Unit in zkSpeed for Accelerating HyperPlonk.
CoRR, July, 2025

IronDict: Transparent Dictionaries from Polynomial Commitments.
IACR Cryptol. ePrint Arch., 2025

Golden: Lightweight Non-Interactive Distributed Key Generation.
IACR Cryptol. ePrint Arch., 2025

Linear-Time Accumulation Schemes.
IACR Cryptol. ePrint Arch., 2025

Linear*-Time Permutation Check.
IACR Cryptol. ePrint Arch., 2025

Context-Dependent Threshold Decryption and its Applications.
IACR Cryptol. ePrint Arch., 2025

Need for zkSpeed: Accelerating HyperPlonk for Zero-Knowledge Proofs.
Proceedings of the 52nd Annual International Symposium on Computer Architecture, 2025

Accumulation Without Homomorphism.
Proceedings of the 16th Innovations in Theoretical Computer Science Conference, 2025

Good Things Come to Those Who Wait - Dishonest-Majority Coin-Flipping Requires Delay Functions.
Proceedings of the Advances in Cryptology - EUROCRYPT 2025, 2025

DewTwo: A Transparent PCS with Quasi-Linear Prover, Logarithmic Verifier and 4.5KB Proofs from Falsifiable Assumptions.
Proceedings of the Advances in Cryptology - CRYPTO 2025, 2025

Arc: Accumulation for Reed-Solomon Codes.
Proceedings of the Advances in Cryptology - CRYPTO 2025, 2025

KZH-Fold: Accountable Voting from Sublinear Accumulation.
Proceedings of the 2025 ACM SIGSAC Conference on Computer and Communications Security, 2025

How Much Public Randomness Do Modern Consensus Protocols Need?
Proceedings of the 7th Conference on Advances in Financial Technologies, 2025

2024
The Espresso Sequencing Network: HotShot Consensus, Tiramisu Data-Availability, and Builder-Exchange.
IACR Cryptol. ePrint Arch., 2024

A Survey of Two Verifiable Delay Functions Using Proof of Exponentiation.
IACR Commun. Cryptol., 2024

Proofs for Deep Thought: Accumulation for Large Memories and Deterministic Computations.
Proceedings of the Advances in Cryptology - ASIACRYPT 2024, 2024

2023
VeriZexe: Decentralized Private Computation with Universal Setup.
Proceedings of the 32nd USENIX Security Symposium, 2023

Multilinear Schwartz-Zippel Mod N and Lattice-Based Succinct Arguments.
Proceedings of the Theory of Cryptography - 21st International Conference, 2023

HyperPlonk: Plonk with Linear-Time Prover and High-Degree Custom Gates.
Proceedings of the Advances in Cryptology - EUROCRYPT 2023, 2023

Threshold Signatures from Inner Product Argument: Succinct, Weighted, and Multi-threshold.
Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security, 2023

Protostar: Generic Efficient Accumulation/Folding for Special-Sound Protocols.
Proceedings of the Advances in Cryptology - ASIACRYPT 2023, 2023

2022
VERI-ZEXE: Decentralized Private Computation with Universal Setup.
IACR Cryptol. ePrint Arch., 2022

Schwartz-Zippel for multilinear polynomials mod N.
IACR Cryptol. ePrint Arch., 2022

2021
Non-Interactive Differentially Anonymous Router.
IACR Cryptol. ePrint Arch., 2021

Proof-Carrying Data Without Succinct Arguments.
Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

Proofs for Inner Pairing Products and Applications.
Proceedings of the Advances in Cryptology - ASIACRYPT 2021, 2021

2020
Computing Bayes-Nash Equilibria in Combinatorial Auctions with Verification.
J. Artif. Intell. Res., 2020

Proof-Carrying Data from Accumulation Schemes.
IACR Cryptol. ePrint Arch., 2020

Recursive Proof Composition from Accumulation Schemes.
Proceedings of the Theory of Cryptography - 18th International Conference, 2020

FlyClient: Super-Light Clients for Cryptocurrencies.
Proceedings of the 2020 IEEE Symposium on Security and Privacy, 2020

Zether: Towards Privacy in a Smart Contract World.
Proceedings of the Financial Cryptography and Data Security, 2020

Transparent SNARKs from DARK Compilers.
Proceedings of the Advances in Cryptology - EUROCRYPT 2020, 2020

2019
Learning a SAT Solver from Single-Bit Supervision.
Proceedings of the 7th International Conference on Learning Representations, 2019

Batching Techniques for Accumulators with Applications to IOPs and Stateless Blockchains.
Proceedings of the Advances in Cryptology - CRYPTO 2019, 2019

2018
A Survey of Two Verifiable Delay Functions.
IACR Cryptol. ePrint Arch., 2018

Bulletproofs: Short Proofs for Confidential Transactions and More.
Proceedings of the 2018 IEEE Symposium on Security and Privacy, 2018

Designing Core-selecting Payment Rules: A Computational Search Approach.
Proceedings of the 2018 ACM Conference on Economics and Computation, 2018

Verifiable Delay Functions.
Proceedings of the Advances in Cryptology - CRYPTO 2018, 2018

2017
Graph Neural Networks and Boolean Satisfiability.
CoRR, 2017

Computing Bayes-Nash Equilibria in Combinatorial Auctions with Continuous Value and Action Spaces.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

2015
Provisions: Privacy-preserving Proofs of Solvency for Bitcoin Exchanges.
Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, 2015

A Faster Core Constraint Generation Algorithm for Combinatorial Auctions.
Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015


  Loading...