SecretMatch: inventory matching from fully homomorphic encryption. - Tucker Balch; Benjamin E. Diamond; Antigoni Polychroniadou (ICAIF, 2020)

"Many-out-of-Many" Proofs with Applications to Anonymous Zether. - Benjamin E. Diamond (IACR Cryptol. ePrint Arch., 2020)

Many-out-of-Many Proofs and Applications to Anonymous Zether. - Benjamin E. Diamond (SP, 2021)

Explicit Exponential Lower Bounds for Exact Hyperplane Covers. - Benjamin E. Diamond; Amir Yehudayoff (Electron. Colloquium Comput. Complex., 2021)

Boolean Functions from Hyperplane Coverings. - Benjamin E. Diamond (IACR Cryptol. ePrint Arch., 2021)

On the Security of KOS. - Benjamin E. Diamond (IACR Cryptol. ePrint Arch., 2022)

Succinct Arguments over Towers of Binary Fields. - Benjamin E. Diamond; Jim Posen (IACR Cryptol. ePrint Arch., 2023)

Prime Match: A Privacy-Preserving Inventory Matching System. - Antigoni Polychroniadou; Gilad Asharov; Benjamin E. Diamond; Tucker Balch; Hans Buehler; Richard Hua; Suwen Gu; Greg Gimler; Manuela Veloso (IACR Cryptol. ePrint Arch., 2023)

An Efficient Data-Independent Priority Queue and its Application to Dark Pools. - Sahar Mazloom; Benjamin E. Diamond; Antigoni Polychroniadou; Tucker Balch (Proc. Priv. Enhancing Technol., 2023)

Proximity Gaps in Interleaved Codes. - Benjamin E. Diamond; Angus Gruen (IACR Commun. Cryptol., 2024)

Proximity Testing with Logarithmic Randomness. - Benjamin E. Diamond; Jim Posen (IACR Commun. Cryptol., 2024)

Polylogarithmic Proofs for Multilinears over Binary Towers. - Benjamin E. Diamond; Jim Posen (IACR Cryptol. ePrint Arch., 2024)

Zero-Knowledge Polynomial Commitment in Binary Fields. - Benjamin E. Diamond (IACR Cryptol. ePrint Arch., 2025)