Private Set Intersection with Linear Communication from General Assumptions. - Brett Hemenway Falk; Daniel Noble; Rafail Ostrovsky (IACR Cryptol. ePrint Arch., 2018)

Honeycrisp: large-scale differentially private aggregation without a trusted core. - Edo Roth; Daniel Noble; Brett Hemenway Falk; Andreas Haeberlen (SOSP, 2019)

SoK: General Purpose Compilers for Secure Multi-Party Computation. - Marcella Hastings; Brett Hemenway; Daniel Noble; Steve Zdancewic (IEEE Symposium on Security and Privacy, 2019)

Secure Computation over Lattices and Elliptic Curves. - Brett Hemenway Falk; Daniel Noble (IACR Cryptol. ePrint Arch., 2020)

Alibi: A Flaw in Cuckoo-Hashing based Hierarchical ORAM Schemes and a Solution. - Brett Hemenway Falk; Daniel Noble; Rafail Ostrovsky (IACR Cryptol. ePrint Arch., 2020)

3-Party Distributed ORAM from Oblivious Set Membership. - Brett Hemenway Falk; Daniel Noble; Rafail Ostrovsky (IACR Cryptol. ePrint Arch., 2021)

An Intimate Analysis of Cuckoo Hashing with a Stash. - Daniel Noble (IACR Cryptol. ePrint Arch., 2021)

DORAM revisited: Maliciously secure RAM-MPC with logarithmic overhead. - Brett Hemenway Falk; Daniel Noble; Rafail Ostrovsky; Matan Shtepel; Jacob Zhang (IACR Cryptol. ePrint Arch., 2023)

Proactive Secret Sharing with Constant Communication. - Brett Hemenway Falk; Daniel Noble; Tal Rabin (IACR Cryptol. ePrint Arch., 2023)

MetaDORAM: Breaking the Log-Overhead Information Theoretic Barrier. - Daniel Noble; Brett Hemenway; Rafail Ostrovsky (Electron. Colloquium Comput. Complex., 2024)

MetaDORAM: Info-Theoretic Distributed ORAM with Less Communication. - Brett Hemenway Falk; Daniel Noble; Rafail Ostrovsky (ITC, 2025)