13 citations · 16 across the 3 of their papers we have counts for
3 papers
cs.CR2026
Flock: Fast Proving for Batch Boolean Computations
Benedikt Bünz, Ron D. Rothblum, William Wang
For many applications of SNARKs, a key bottleneck is proving large batches of standard cryptographic hash evaluations, such as SHA-256, Keccak, or BLAKE3. We introduce Flock, a has…
cs.DM2022★ 3 cited
Schwartz-Zippel for multilinear polynomials mod N
Benedikt Bünz, Ben Fisch
We derive a tight upper bound on the probability over uniformly distributed in that for any …
cs.GT2018★ 13 cited
Computing Bayes-Nash Equilibria in Combinatorial Auctions with Verification
Vitor Bosshard, Benedikt Bünz, Benjamin Lubin +1
We present a new algorithm for computing pure-strategy -Bayes-Nash equilibria (-BNEs) in combinatorial auctions with continuous value and action spaces. A…