Brett Hemenway

Proceedings of the 6th Conference on Information-Theoretic Cryptography, 2025

2024

Malicious Security for PIR (almost) for Free.

[BibT_eX]

[DOI]

Pratyush Mishra

Matan Shtepel

IACR Cryptol. ePrint Arch., 2024

MetaDORAM: Breaking the Log-Overhead Information Theoretic Barrier.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2024

2023

Scaling Blockchains: Can Committee-Based Consensus Help?

[BibT_eX]

[DOI]

Alon Benhaim

Manag. Sci., November, 2023

Linear-time 2-party secure merge from additively homomorphic encryption.

[BibT_eX]

[DOI]

Rohit Nema

J. Comput. Syst. Sci., November, 2023

Privacy-Preserving Network Analytics.

[BibT_eX]

[DOI]

Marcella Hastings

Manag. Sci., September, 2023

Crypto Wash Trading: Direct vs. Indirect Estimation.

[BibT_eX]

[DOI]

Niuniu Zhang

CoRR, 2023

GigaDORAM: Breaking the Billion Address Barrier.

[BibT_eX]

[DOI]

Proceedings of the 32nd USENIX Security Symposium, 2023

DORAM Revisited: Maliciously Secure RAM-MPC with Logarithmic Overhead.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 21st International Conference, 2023

Proactive Secret Sharing with Constant Communication.

[BibT_eX]

[DOI]

Tal Rabin

Proceedings of the Theory of Cryptography - 21st International Conference, 2023

2022

Economics of NFTs: The Value of Creator Royalties.

[BibT_eX]

[DOI]

Niuniu Zhang

CoRR, 2022

3-Party Distributed ORAM from Oblivious Set Membership.

[BibT_eX]

[DOI]

Proceedings of the Security and Cryptography for Networks - 13th International Conference, 2022

A Linear-Time 2-Party Secure Merge Protocol.

[BibT_eX]

[DOI]

Rohit Nema

Proceedings of the Cyber Security, Cryptology, and Machine Learning, 2022

2021

Scaling Blockchains: Can Elected Committees Help?

[BibT_eX]

[DOI]

Alon Benhaim

CoRR, 2021

Alibi: A Flaw in Cuckoo-Hashing Based Hierarchical ORAM Schemes and a Solution.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2021, 2021

Secure Merge with O(n log log n) Secure Operations.

[BibT_eX]

[DOI]

Proceedings of the 2nd Conference on Information-Theoretic Cryptography, 2021

2020

Local List Recovery of High-Rate Tensor Codes and Applications.

[BibT_eX]

[DOI]

Noga Ron-Zewi

SIAM J. Comput., 2020

Token-Weighted Crowdsourcing.

[BibT_eX]

[DOI]

Manag. Sci., 2020

Secure merge with O(n log log n) secure operation.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2020

Secure Computation over Lattices and Elliptic Curves.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2020

Properties of constacyclic codes under the Schur product.

[BibT_eX]

[DOI]

Nadia Heninger

Michael Rudow

Des. Codes Cryptogr., 2020

2019

Private Set Intersection with Linear Communication from General Assumptions.

[BibT_eX]

[DOI]

Proceedings of the 18th ACM Workshop on Privacy in the Electronic Society, 2019

DURASIFT: A Robust, Decentralized, Encrypted Database Supporting Private Searches with Complex Policy Controls.

[BibT_eX]

[DOI]

Steve Lu

Proceedings of the 18th ACM Workshop on Privacy in the Electronic Society, 2019

SoK: General Purpose Compilers for Secure Multi-Party Computation.

[BibT_eX]

[DOI]

Proceedings of the 2019 IEEE Symposium on Security and Privacy, 2019

Honeycrisp: large-scale differentially private aggregation without a trusted core.

[BibT_eX]

[DOI]

Proceedings of the 27th ACM Symposium on Operating Systems Principles, 2019

2018

Computing Statistics from Private Data.

[BibT_eX]

[DOI]

Data Sci. J., 2018

ETERNAL: Encrypted Transmission With an Error-correcting, Real-time, Noise-resilient Apparatus on Lightweight Devices.

[BibT_eX]

[DOI]

Proceedings of the 2nd International Workshop on Multimedia Privacy and Security, 2018

2017

Local List Recovery of High-Rate Tensor Codes & Applications.

[BibT_eX]

[DOI]

Noga Ron-Zewi

Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science, 2017

2016

Efficient Robust Secret Sharing from Expander Graphs.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2016

Sensitivity and computational complexity in financial networks.

[BibT_eX]

[DOI]

Sanjeev Khanna

Algorithmic Finance, 2016

Adaptive Security with Quasi-Optimal Rate.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 13th International Conference, 2016

High-Precision Secure Computation of Satellite Collision Probabilities.

[BibT_eX]

[DOI]

Proceedings of the Security and Cryptography for Networks - 10th International Conference, 2016

Adaptively Secure Garbled Circuits from One-Way Functions.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2016, 2016

Cryptographic Applications of Capacity Theory: On the Optimality of Coppersmith's Method for Univariate Polynomials.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - ASIACRYPT 2016, 2016

2015

Non-committing Encryption from Φ-hiding.

[BibT_eX]

[DOI]

Alon Rosen

Proceedings of the Theory of Cryptography - 12th Theory of Cryptography Conference, 2015

Linear-Time List Recovery of High-Rate Expander Codes.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

2013

Local Correctability of Expander Codes.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

Building Lossy Trapdoor Functions from Lossy Encryption.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - ASIACRYPT 2013, 2013

2012

Reusable low-error compressive sampling schemes through privacy.

[BibT_eX]

[DOI]

Proceedings of the IEEE Statistical Signal Processing Workshop, 2012

Extended-DDH and Lossy Trapdoor Functions.

[BibT_eX]

[DOI]

Proceedings of the Public Key Cryptography - PKC 2012, 2012

On Homomorphic Encryption and Chosen-Ciphertext Security.

[BibT_eX]

[DOI]

Proceedings of the Public Key Cryptography - PKC 2012, 2012

Correlated Product Security from Any One-Way Function.

[BibT_eX]

[DOI]

Steve Lu

Proceedings of the Public Key Cryptography - PKC 2012, 2012

Recovering simple signals.

[BibT_eX]

[DOI]

Proceedings of the 2012 Information Theory and Applications Workshop, 2012

2011

Lossy Encryption: Constructions from General Assumptions and Efficient Selective Opening Chosen Ciphertext Security.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - ASIACRYPT 2011, 2011

Public Key Locally Decodable Codes with Short Keys.

[BibT_eX]

[DOI]

Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2011

2010

Homomorphic Encryption Over Cyclic Groups Implies Chosen-Ciphertext Security.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2010

Correlated Product Security From Any One-Way Function and the New Notion of Decisional Correlated Product Security.

[BibT_eX]

[DOI]

Steve Lu

IACR Cryptol. ePrint Arch., 2010

Building Injective Trapdoor Functions From Oblivious Transfer.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2010

2009

Lossy Trapdoor Functions from Smooth Homomorphic Hash Proof Systems.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2009

2008

Public-Key Locally-Decodable Codes.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2008

2007

Public Key Encryption Which is Simultaneously a Locally-Decodable Error-Correcting Code.

[BibT_eX]

[DOI]