Kevin Yeo

Joon Young Seo

IACR Cryptol. ePrint Arch., 2025

Plinko: Single-Server PIR with Efficient Updates via Invertible PRFs.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2025, 2025

Weakly Super-Invertible Matrices and Constant Communication Dishonest Majority MPC.

[BibT_eX]

[DOI]

Alexander Bienstock

Proceedings of the Advances in Cryptology - EUROCRYPT 2025, 2025

Fine-Grained Complexity in a World Without Cryptography.

[BibT_eX]

[DOI]

Josh Alman

Yizhi Huang

Proceedings of the Advances in Cryptology - EUROCRYPT 2025, 2025

2024

Two Levels are Better than One: Dishonest Majority MPC with $\widetilde{O}(|C|)$ Total Communication.

[BibT_eX]

[DOI]

Alexander Bienstock

IACR Cryptol. ePrint Arch., 2024

Batch PIR and Labeled PSI with Oblivious Ciphertext Compression.

[BibT_eX]

[DOI]

Proceedings of the 33rd USENIX Security Symposium, 2024

Differentially Private Set Representations.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 38: Annual Conference on Neural Information Processing Systems 2024, 2024

Optimal Non-Adaptive Cell Probe Dictionaries and Hashing.

[BibT_eX]

[DOI]

Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

Efficient Secret Sharing for Large-Scale Applications.

[BibT_eX]

[DOI]

Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security, 2024

2023

RSA Blind Signatures with Public Metadata.

[BibT_eX]

[DOI]

Ghous Amjad

Moti Yung

IACR Cryptol. ePrint Arch., 2023

Don't be Dense: Efficient Keyword PIR for Sparse Databases.

[BibT_eX]

[DOI]

Joon Young Seo

Proceedings of the 32nd USENIX Security Symposium, 2023

Near-Optimal Oblivious Key-Value Stores for Efficient PSI, PSU and Volume-Hiding Multi-Maps.

[BibT_eX]

[DOI]

Proceedings of the 32nd USENIX Security Symposium, 2023

Lower Bounds for (Batch) PIR with Private Preprocessing.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2023, 2023

Lower Bound Framework for Differentially Private and Oblivious Data Structures.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2023, 2023

Cuckoo Hashing in Cryptography: Optimal Parameters, Robustness and Applications.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2023, 2023

Limits of Breach-Resistant and Snapshot-Oblivious RAMs.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2023, 2023

2022

SoK: SCT Auditing in Certificate Transparency.

[BibT_eX]

[DOI]

Proc. Priv. Enhancing Technol., 2022

Limits of Preprocessing for Single-Server PIR.

[BibT_eX]

[DOI]

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

2021

Dynamic Volume-Hiding Encrypted Multi-Maps with Applications to Searchable Encryption.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2021

Communication-Computation Trade-offs in PIR.

[BibT_eX]

[DOI]

Proceedings of the 30th USENIX Security Symposium, 2021

Forward Secret Encrypted RAM: Lower Bounds and Applications.

[BibT_eX]

[DOI]

Alexander Bienstock

Yevgeniy Dodis

Proceedings of the Theory of Cryptography - 19th International Conference, 2021

Doubly-Affine Extractors, and Their Applications.

[BibT_eX]

[DOI]

Yevgeniy Dodis

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

Efficient Boolean Search over Encrypted Data with Reduced Leakage.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - ASIACRYPT 2021, 2021

2020

Tight Static Lower Bounds for Non-Adaptive Data Structures.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2020

Lower Bounds for Multi-server Oblivious RAMs.

[BibT_eX]

[DOI]

Kasper Green Larsen

Mark Simkin

Proceedings of the Theory of Cryptography - 18th International Conference, 2020

Lower Bounds for Oblivious Near-Neighbor Search.

[BibT_eX]

[DOI]

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Lower Bounds for Encrypted Multi-Maps and Searchable Encryption in the Leakage Cell Probe Model.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2020, 2020

2019

Leakage Cell Probe Model: Lower Bounds for Key-Equality Mitigation in Encrypted Multi-Maps.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2019

Protecting accounts from credential stuffing with password breach alerting.

[BibT_eX]

[DOI]

Proceedings of the 28th USENIX Security Symposium, 2019

What Storage Access Privacy is Achievable with Small Overhead?

[BibT_eX]

[DOI]

Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2019

Lower Bounds for Differentially Private RAMs.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2019, 2019

Mitigating Leakage in Secure Cloud-Hosted Data Structures: Volume-Hiding for Multi-Maps via Hashing.

[BibT_eX]

[DOI]

Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, 2019

2018

CacheShuffle: A Family of Oblivious Shuffles.

[BibT_eX]

[DOI]

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

PanORAMa: Oblivious RAM with Logarithmic Overhead.

[BibT_eX]

[DOI]

Proceedings of the 59th IEEE Annual Symposium on Foundations of Computer Science, 2018

Symmetric Searchable Encryption with Sharing and Unsharing.

[BibT_eX]

[DOI]

Proceedings of the Computer Security, 2018

Private Stateful Information Retrieval.

[BibT_eX]

[DOI]

Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, 2018

2017

Recursive ORAMs with Practical Constructions.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2017

CacheShuffle: An Oblivious Shuffle Algorithm Using Caches.

[BibT_eX]

[DOI]