Benedikt Bünz

Orcid: 0000-0003-2082-4480

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

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Accumulation without Homomorphism.
IACR Cryptol. ePrint Arch., 2024

Proofs for Deep Thought: Accumulation for large memories and deterministic computations.
IACR Cryptol. ePrint Arch., 2024

2023
Threshold Signatures from Inner Product Argument: Succinct, Weighted, and Multi-threshold.
IACR Cryptol. ePrint Arch., 2023

ProtoStar: Generic Efficient Accumulation/Folding for Special Sound Protocols.
IACR Cryptol. ePrint Arch., 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

2022
Designing Core-Selecting Payment Rules: A Computational Search Approach.
Inf. Syst. Res., December, 2022

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

HyperPlonk: Plonk with Linear-Time Prover and High-Degree Custom Gates.
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

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

Proof-Carrying Data without Succinct Arguments.
IACR Cryptol. ePrint Arch., 2020

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

2019
Flyclient: Super-Light Clients for Cryptocurrencies.
IACR Cryptol. ePrint Arch., 2019

Transparent SNARKs from DARK Compilers.
IACR Cryptol. ePrint Arch., 2019

Zether: Towards Privacy in a Smart Contract World.
IACR Cryptol. ePrint Arch., 2019

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

2018
Batching Techniques for Accumulators with Applications to IOPs and Stateless Blockchains.
IACR Cryptol. ePrint Arch., 2018

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

Verifiable Delay Functions.
IACR Cryptol. ePrint Arch., 2018

2017
Bulletproofs: Short Proofs for Confidential Transactions and More.
IACR Cryptol. ePrint Arch., 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.
IACR Cryptol. ePrint Arch., 2015

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


  Loading...