Brett Hemenway

Orcid: 0000-0002-4344-7406

Affiliations:
  • University of Pennsylvania, Department of Computer and Information Science, Philadelphia, PA, USA
  • University of Michigan, Department of Mathematics, Ann Arbor, MI, USA (2010 - 2013)
  • University of California Los Angeles, Department of Mathematics, CA, USA (PhD 2010)


According to our database1, Brett Hemenway authored at least 50 papers between 2007 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Malicious Security for PIR (almost) for Free.
IACR Cryptol. ePrint Arch., 2024

MetaDORAM: Breaking the Log-Overhead Information Theoretic Barrier.
Electron. Colloquium Comput. Complex., 2024

2023
Scaling Blockchains: Can Committee-Based Consensus Help?
Manag. Sci., November, 2023

Linear-time 2-party secure merge from additively homomorphic encryption.
J. Comput. Syst. Sci., November, 2023

Privacy-Preserving Network Analytics.
Manag. Sci., September, 2023

GigaDORAM: Breaking the Billion Address Barrier.
IACR Cryptol. ePrint Arch., 2023

Proactive Secret Sharing with Constant Communication.
IACR Cryptol. ePrint Arch., 2023

DORAM revisited: Maliciously secure RAM-MPC with logarithmic overhead.
IACR Cryptol. ePrint Arch., 2023

Crypto Wash Trading: Direct vs. Indirect Estimation.
CoRR, 2023

2022
A Linear-Time 2-Party Secure Merge Protocol.
IACR Cryptol. ePrint Arch., 2022

Economics of NFTs: The Value of Creator Royalties.
CoRR, 2022

2021
3-Party Distributed ORAM from Oblivious Set Membership.
IACR Cryptol. ePrint Arch., 2021

Scaling Blockchains: Can Elected Committees Help?
CoRR, 2021

Secure Merge with O(n log log n) Secure Operations.
Proceedings of the 2nd Conference on Information-Theoretic Cryptography, 2021

2020
Local List Recovery of High-Rate Tensor Codes and Applications.
SIAM J. Comput., 2020

Token-Weighted Crowdsourcing.
Manag. Sci., 2020

Secure merge with O(n log log n) secure operation.
IACR Cryptol. ePrint Arch., 2020

Alibi: A Flaw in Cuckoo-Hashing based Hierarchical ORAM Schemes and a Solution.
IACR Cryptol. ePrint Arch., 2020

Secure Computation over Lattices and Elliptic Curves.
IACR Cryptol. ePrint Arch., 2020

Properties of constacyclic codes under the Schur product.
Des. Codes Cryptogr., 2020

2019
DURASIFT: A Robust, Decentralized, Encrypted Database Supporting Private Searches with Complex Policy Controls.
Proceedings of the 18th ACM Workshop on Privacy in the Electronic Society, 2019

SoK: General Purpose Compilers for Secure Multi-Party Computation.
Proceedings of the 2019 IEEE Symposium on Security and Privacy, 2019

Honeycrisp: large-scale differentially private aggregation without a trusted core.
Proceedings of the 27th ACM Symposium on Operating Systems Principles, 2019

2018
Linear-time list recovery of high-rate expander codes.
Inf. Comput., 2018

Private Set Intersection with Linear Communication from General Assumptions.
IACR Cryptol. ePrint Arch., 2018

Computing Statistics from Private Data.
Data Sci. J., 2018

Efficient robust secret sharing from expander graphs.
Cryptogr. Commun., 2018

ETERNAL: Encrypted Transmission With an Error-correcting, Real-time, Noise-resilient Apparatus on Lightweight Devices.
Proceedings of the 2nd International Workshop on Multimedia Privacy and Security, 2018

2017
Local List Recovery of High-rate Tensor Codes & Applications.
Electron. Colloquium Comput. Complex., 2017

2016
High-precision Secure Computation of Satellite Collision Probabilities.
IACR Cryptol. ePrint Arch., 2016

Cryptographic applications of capacity theory: On the optimality of Coppersmith's method for univariate polynomials.
IACR Cryptol. ePrint Arch., 2016

Sensitivity and computational complexity in financial networks.
Algorithmic Finance, 2016

Adaptive Security with Quasi-Optimal Rate.
Proceedings of the Theory of Cryptography - 13th International Conference, 2016

2015
Local correctability of expander codes.
Inf. Comput., 2015

Non-committing encryption from Φ-hiding.
IACR Cryptol. ePrint Arch., 2015

Building Lossy Trapdoor Functions from Lossy Encryption.
IACR Cryptol. ePrint Arch., 2015

Adaptively Secure Garbled Circuits from One-Way Functions.
IACR Cryptol. ePrint Arch., 2015

2012
Reusable low-error compressive sampling schemes through privacy.
Proceedings of the IEEE Statistical Signal Processing Workshop, 2012

Extended-DDH and Lossy Trapdoor Functions.
Proceedings of the Public Key Cryptography - PKC 2012, 2012

On Homomorphic Encryption and Chosen-Ciphertext Security.
Proceedings of the Public Key Cryptography - PKC 2012, 2012

Correlated Product Security from Any One-Way Function.
Proceedings of the Public Key Cryptography - PKC 2012, 2012

Recovering simple signals.
Proceedings of the 2012 Information Theory and Applications Workshop, 2012

2011
Public Key Locally Decodable Codes with Short Keys.
Electron. Colloquium Comput. Complex., 2011

2010
Homomorphic Encryption Over Cyclic Groups Implies Chosen-Ciphertext Security.
IACR Cryptol. ePrint Arch., 2010

Correlated Product Security From Any One-Way Function and the New Notion of Decisional Correlated Product Security.
IACR Cryptol. ePrint Arch., 2010

Building Injective Trapdoor Functions From Oblivious Transfer.
Electron. Colloquium Comput. Complex., 2010

2009
Lossy Encryption: Constructions from General Assumptions and Efficient Selective Opening Chosen Ciphertext Security.
IACR Cryptol. ePrint Arch., 2009

Lossy Trapdoor Functions from Smooth Homomorphic Hash Proof Systems.
Electron. Colloquium Comput. Complex., 2009

2008
Public-Key Locally-Decodable Codes.
Proceedings of the Advances in Cryptology, 2008

2007
Public Key Encryption Which is Simultaneously a Locally-Decodable Error-Correcting Code.
Electron. Colloquium Comput. Complex., 2007


  Loading...