Public Key Encryption Which is Simultaneously a Locally-Decodable Error-Correcting Code. - Brett Hemenway; Rafail Ostrovsky (Electron. Colloquium Comput. Complex., 2007)

Public-Key Locally-Decodable Codes. - Brett Hemenway; Rafail Ostrovsky (CRYPTO, 2008)

Lossy Trapdoor Functions from Smooth Homomorphic Hash Proof Systems. - Brett Hemenway; Rafail Ostrovsky (Electron. Colloquium Comput. Complex., 2009)

Lossy Encryption: Constructions from General Assumptions and Efficient Selective Opening Chosen Ciphertext Security. - Brett Hemenway; Benoît Libert; Rafail Ostrovsky; Damien Vergnaud (IACR Cryptol. ePrint Arch., 2009)

Building Injective Trapdoor Functions From Oblivious Transfer. - Brett Hemenway; Rafail Ostrovsky (Electron. Colloquium Comput. Complex., 2010)

Correlated Product Security From Any One-Way Function and the New Notion of Decisional Correlated Product Security. - Brett Hemenway; Steve Lu 001; Rafail Ostrovsky (IACR Cryptol. ePrint Arch., 2010)

Homomorphic Encryption Over Cyclic Groups Implies Chosen-Ciphertext Security. - Brett Hemenway; Rafail Ostrovsky (IACR Cryptol. ePrint Arch., 2010)

Public Key Locally Decodable Codes with Short Keys. - Brett Hemenway; Rafail Ostrovsky; Martin Strauss 001; Mary Wootters (Electron. Colloquium Comput. Complex., 2011)

Recovering simple signals. - Anna C. Gilbert; Brett Hemenway; Atri Rudra; Martin J. Strauss; Mary Wootters (ITA, 2012)

Correlated Product Security from Any One-Way Function. - Brett Hemenway; Steve Lu 001; Rafail Ostrovsky (Public Key Cryptography, 2012)

On Homomorphic Encryption and Chosen-Ciphertext Security. - Brett Hemenway; Rafail Ostrovsky (Public Key Cryptography, 2012)

Extended-DDH and Lossy Trapdoor Functions. - Brett Hemenway; Rafail Ostrovsky (Public Key Cryptography, 2012)

Reusable low-error compressive sampling schemes through privacy. - Anna C. Gilbert; Brett Hemenway; Martin J. Strauss; David P. Woodruff; Mary Wootters (SSP, 2012)

Adaptively Secure Garbled Circuits from One-Way Functions. - Brett Hemenway; Zahra Jafargholi; Rafail Ostrovsky; Alessandra Scafuro; Daniel Wichs (IACR Cryptol. ePrint Arch., 2015)

Building Lossy Trapdoor Functions from Lossy Encryption. - Brett Hemenway; Rafail Ostrovsky (IACR Cryptol. ePrint Arch., 2015)

Non-committing encryption from Φ-hiding. - Brett Hemenway; Rafail Ostrovsky; Alon Rosen (IACR Cryptol. ePrint Arch., 2015)

Local correctability of expander codes. - Brett Hemenway; Rafail Ostrovsky; Mary Wootters (Inf. Comput., 2015)

Adaptive Security with Quasi-Optimal Rate. - Brett Hemenway; Rafail Ostrovsky; Silas Richelson; Alon Rosen (TCC (A1), 2016)

Sensitivity and computational complexity in financial networks. - Brett Hemenway; Sanjeev Khanna (Algorithmic Finance, 2016)

Cryptographic applications of capacity theory: On the optimality of Coppersmith's method for univariate polynomials. - Ted Chinburg; Brett Hemenway; Nadia Heninger; Zachary Scherr (IACR Cryptol. ePrint Arch., 2016)

High-precision Secure Computation of Satellite Collision Probabilities. - Brett Hemenway; Steve Lu 001; Rafail Ostrovsky; William Welser IV (IACR Cryptol. ePrint Arch., 2016)

Local List Recovery of High-rate Tensor Codes & Applications. - Brett Hemenway; Noga Ron-Zewi; Mary Wootters (Electron. Colloquium Comput. Complex., 2017)

ETERNAL: Encrypted Transmission With an Error-correcting, Real-time, Noise-resilient Apparatus on Lightweight Devices. - Quinn Grier; Brett Hemenway Falk; Steve Lu 001; Rafail Ostrovsky (MPS@CCS, 2018)

Efficient robust secret sharing from expander graphs. - Brett Hemenway; Rafail Ostrovsky (Cryptogr. Commun., 2018)

Computing Statistics from Private Data. - George Alter; Brett Hemenway Falk; Steve Lu 001; Rafail Ostrovsky (Data Sci. J., 2018)

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

Linear-time list recovery of high-rate expander codes. - Brett Hemenway; Mary Wootters (Inf. Comput., 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)

DURASIFT: A Robust, Decentralized, Encrypted Database Supporting Private Searches with Complex Policy Controls. - Brett Hemenway Falk; Steve Lu 001; Rafail Ostrovsky (WPES@CCS, 2019)

Properties of constacyclic codes under the Schur product. - Brett Hemenway Falk; Nadia Heninger; Michael Rudow (Des. Codes Cryptogr., 2020)

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)

Secure merge with O(n log log n) secure operation. - Brett Hemenway Falk; Rafail Ostrovsky (IACR Cryptol. ePrint Arch., 2020)

Token-Weighted Crowdsourcing. - Gerry Tsoukalas; Brett Hemenway Falk (Manag. Sci., 2020)

Local List Recovery of High-Rate Tensor Codes and Applications. - Brett Hemenway; Noga Ron-Zewi; Mary Wootters (SIAM J. Comput., 2020)

Secure Merge with O(n log log n) Secure Operations. - Brett Hemenway Falk; Rafail Ostrovsky (ITC, 2021)

Scaling Blockchains: Can Elected Committees Help? - Alon Benhaim; Brett Hemenway Falk; Gerry Tsoukalas (CoRR, 2021)

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

Economics of NFTs: The Value of Creator Royalties. - Brett Hemenway Falk; Gerry Tsoukalas; Niuniu Zhang (CoRR, 2022)

A Linear-Time 2-Party Secure Merge Protocol. - Brett Hemenway Falk; Rohit Nema; Rafail Ostrovsky (IACR Cryptol. ePrint Arch., 2022)

Crypto Wash Trading: Direct vs. Indirect Estimation. - Brett Hemenway Falk; Gerry Tsoukalas; Niuniu Zhang (CoRR, 2023)

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)

GigaDORAM: Breaking the Billion Address Barrier. - Brett Hemenway Falk; Rafail Ostrovsky; Matan Shtepel; Jacob Zhang (IACR Cryptol. ePrint Arch., 2023)

Privacy-Preserving Network Analytics. - Marcella Hastings; Brett Hemenway Falk; Gerry Tsoukalas (Manag. Sci., 2023)

Linear-time 2-party secure merge from additively homomorphic encryption. - Brett Hemenway Falk; Rohit Nema; Rafail Ostrovsky (J. Comput. Syst. Sci., 2023)

Scaling Blockchains: Can Committee-Based Consensus Help? - Alon Benhaim; Brett Hemenway Falk; Gerry Tsoukalas (Manag. Sci., 2023)

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

Malicious Security for PIR (almost) for Free. - Brett Hemenway Falk; Pratyush Mishra; Matan Shtepel (IACR Cryptol. ePrint Arch., 2024)

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