Blog Posts

The Espresso Market Design by B. Bünz, B. Fisch, and E. Davidson. May 6, 2024.

Based Espresso: ad-hoc shared sequencing for all L2s, from based rollups to validiums by Ben Fisch. March 8, 2024. 

The Espresso Sequencer. March 20, 2023. 

Configurable Privacy Case Study: Partitioned Privacy Pools by Ben Fisch. Sep 11, 2022. 

A Simple Range Proof from Polynomial Commitments by D. Boneh, B. Fisch, A. Gabizon, and Z. Williamson. Feb 20, 2020. 

Publications

See my Google Scholar page. 

A. Biryukov, B. Fisch, G. Herold, D. Khovratovich, G. Leurent, M. Naya-Plasencia, B. Wesolowski. Cryptanalysis of Algebraic Verifiable Delay Functions.  CRYPTO 2024. 

D. Boneh, B. Bünz, and B. Fisch. A Survey of Two Verifiable Delay Functions. IACR Communications in Cryptology (Journal), Volume 1, Issue 1, 2024. 

B. Fisch, A. Lazzaretti, Z. Liu, C. Papamanthou. Single Server PIR via Homomorphic Thorp Shuffles. Cryptology ePrint Archive Report 2024. 

W. Wang, L. Zhou, A. Yaish, F. Zhang, B. Fisch, and B. Livshits. Mechanism Design for ZK-Rollup Prover Markets. Arxiv 2024. 

H. Zeilberger, B. Chen, and B. Fisch. BaseFold: Efficient Field-Agnostic Polynomial Commitment Schemes from Foldable Codes. CRYPTO 2024. 

B. Bünz and B. Fisch. Multilinear Schwartz-Zippel mod N and Lattice-Based Succinct Arguments. TCC 2023. 

B. Fisch, Z. Liu, and P. Vesely. Orbweaver: Succinct Linear Functional Commitments from Lattices. CRYPTO 2023.. 

J. Beal and B. Fisch. Derecho: Privacy Pools with Proof-Carrying Disclosures.  CCS 2024.  

A.L. Xiong, B. Chen, Z. Zhang, B. Bünz, B. Fisch, F. Krell, P. Camacho. VERI-ZEXE: Decentralized Private Computation with Universal Setup. USENIX Security 2023. 

N. Tyagi, B. Fisch, J. Bonneau, S. Tessaro. VeRSA: Verifiable Registries with Efficient Client Audits from RSA Authenticated Dictionaries, ACM CCS 2022.

D. Boneh, J. Drake, B. Fisch, A. Gabizon. Halo Infinite: Recursive SNARKs from any Additive Polynomial Commitment Scheme. CRYPTO 2021. 

D. Boneh, J. Drake, B. Fisch, A. Gabizon. Efficient polynomial commitment schemes for multiple polynomials at multiple points. Cryptology ePrint Archive, 2020. 

B. Bünz, B. Fisch, A. Szepieniec. Transparent SNARKS from DARK Compilers. Eurocrypt 2020. 

D. Boneh, B. Bünz, B. Fisch. Batching Techniques for Accumulators with Applications to IOPs and Stateless Blockchains. CRYPTO 2019.  

E. Cecchetti, B. Fisch, I. Miers, A. Juels. PIEs: Public Incompressible Encodings for Decentralized Storage. ACM CCS 2019.  

B. Fisch. Tight Proofs of Space and Replication. Eurocrypt 2019. 

B. Fisch. PoReps: Proofs of Space on Useful Data. Cryptology ePrint Archive Report 2018/678.

B. Fisch and S. Silas. Weak Compression and (In)security of Rational Proofs of Storage.  Cryptology ePrint Archive Report 2018/514.

D. Boneh, B. Bünz, and B. Fisch. A Survey of Two Verifiable Delay Functions. Cryptology ePrint Archive Report 2018/712.

D. Boneh, J. Bonneau, B. Bünz, and B. Fisch. Verifiable Delay Functions.  CRYPTO 2018. 

D. Boneh, S. Eskandarian, and B. Fisch. Post-Quantum EPID Group Signatures from Symmetric Primitives. CT-RSA 2019. 

B.A. Fisch, D. Vinayagamurthy, D. Boneh, and S. Gorbunov. Iron: Functional Encryption using Intel SGX. ACM CCS 2017. *Best Paper Finalist.*

B.A. Fisch, R. Pass, A. Shelat. Socially Optimal Mining Pools. In Web and Internet Economics (WINE) 2017.  

B.A. Fisch, B. Vo, F. Krell, A. Kumarasubramanian, V. Kolesnikov, T. Malkin, S.M. Bellovin. Malicious-Client Security in Blind Seer: A Scalable Private DBMS. IEEE Security and Privacy 2015. 

B. Fisch, D. Freund, and M. Naor. Physical Zero-Knowledge Proofs of Physical Properties. CRYPTO 2014.

B.A. Fisch, D. Freund., and M. Naor. Secure Physical Computation using Disposable Circuits. In Theory of Cryptography Conference (TCC) 2015.

Program Committees

ACM CCS: 2021, 2023. 

IACR CRYPTO: 2022, 2023.

Financial Cryptography 2021. 

Science of Blockchain Conference: 2020, 2023. 

Select Presentations

Transparent SNARKs from DARK Compilers 

Stanford Blockchain Conference, 2020, https://www.youtube.com/watch?v=XqC67jboOdA&ab_channel=Findora

Supersonic SNARKs: Trustless with Logarithmic Verification 

Zero Knowledge Summit, San Francisco, 2019, https://www.youtube.com/watch?v=nJPS_SWoplI&t=5s&ab_channel=ZeroKnowledge

A Survey of Progress in Succinct Zero Knowledge Proofs: Towards Trustless SNARKs  

Keynote Invited Talk at Scaling Bitcoin, Tel Aviv 2019,  https://www.youtube.com/watch?v=-gdfxNalDIc&ab_channel=ScalingBitcoin  (starts 29:15)

An Authenticated Datastructure for Blockchain Consensus with Minimal Storage

Stanford Security Forum, 2019: https://www.youtube.com/watch?v=9TMoB1q9LSI&t=3s&ab_channel=StanfordComputerForum

Tight Proofs of Space and Replication 

 Eurocrypt, Darmstadt, 2019: https://www.youtube.com/watch?v=84kHVqvTVcw

Verifiable Delay Functions

Crypto, Santa Barbara, 2019: https://www.youtube.com/watch?v=_-feyaZZjEw&ab_channel=TheIACR

Proofs of Replication: A New Proof of Storage for Decentralized Storage Networks

Stanford Security Forum, 2018:  https://www.youtube.com/watch?v=3GaOhvitlRg

Iron: Functional Encryption using Intel SGX 

ACM CCS 2017, Dallas,  2017: https://www.youtube.com/watch?v=PeNnKwBXCPU&t=62s&ab_channel=AssociationofComputingMachinery2017

BLIND SEER:  Bloom Filter Index Search of Encrypted Results

IEEE Security and Privacy Conference, San Jose, 2015: https://www.youtube.com/watch?v=tcBWZ09OvSg

Physical Zero-Knowledge Proofs of Physical Properties

Crypto, Santa Barbara, 2014: https://www.youtube.com/watch?v=7k258SjCtUk 

Podcast Interviews

Towards a Decentralized Storage Network for the Blockchain Computer 

Andreesen Horowitz Podcast Series, Posted April 19, 2019: https://www.youtube.com/watch?v=ZZIheiQ9IoE&t=165s&ab_channel=a16z

Interview with Finance Magnates

Jan 14, 2020: https://www.youtube.com/watch?v=QslKUnIyhRA&ab_channel=FinanceMagnates

Zero Knowledge Podcast: Accumulators 

Aug 5, 2019: https://www.youtube.com/watch?v=dppM_Pzxzp8&ab_channel=ZeroKnowledge