Kevin Yeo

According to our database1, Kevin Yeo authored at least 35 papers between 2015 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
RSA Blind Signatures with Public Metadata.
Proc. Priv. Enhancing Technol., 2025

2024
Efficient Secret Sharing for Large-Scale Applications.
IACR Cryptol. ePrint Arch., 2024

Plinko: Single-Server PIR with Efficient Updates via Invertible PRFs.
IACR Cryptol. ePrint Arch., 2024

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

Batch PIR and Labeled PSI with Oblivious Ciphertext Compression.
IACR Cryptol. ePrint Arch., 2024

Optimal Non-Adaptive Cell Probe Dictionaries and Hashing.
Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

2023
Dynamic Volume-Hiding Encrypted Multi-Maps with Applications to Searchable Encryption.
Proc. Priv. Enhancing Technol., January, 2023

Limits of Breach-Resistant and Snapshot-Oblivious RAMs.
IACR Cryptol. ePrint Arch., 2023

Don't be Dense: Efficient Keyword PIR for Sparse Databases.
IACR Cryptol. ePrint Arch., 2023

Near-Optimal Oblivious Key-Value Stores for Efficient PSI, PSU and Volume-Hiding Multi-Maps.
IACR Cryptol. ePrint Arch., 2023

2022
SoK: SCT Auditing in Certificate Transparency.
Proc. Priv. Enhancing Technol., 2022

Cuckoo Hashing in Cryptography: Optimal Parameters, Robustness and Applications.
IACR Cryptol. ePrint Arch., 2022

Lower Bounds for (Batch) PIR with Private Preprocessing.
IACR Cryptol. ePrint Arch., 2022

Lower Bound Framework for Differentially Private and Oblivious Data Structures.
IACR Cryptol. ePrint Arch., 2022

Limits of Preprocessing for Single-Server PIR.
IACR Cryptol. ePrint Arch., 2022

2021
Efficient Boolean Search over Encrypted Data with Reduced Leakage.
IACR Cryptol. ePrint Arch., 2021

Doubly-Affine Extractors, and their Applications.
IACR Cryptol. ePrint Arch., 2021

Forward Secret Encrypted RAM: Lower Bounds and Applications.
IACR Cryptol. ePrint Arch., 2021

2020
Tight Static Lower Bounds for Non-Adaptive Data Structures.
Electron. Colloquium Comput. Complex., 2020

Lower Bounds for Encrypted Multi-Maps and Searchable Encryption in the Leakage Cell Probe Model.
Proceedings of the Advances in Cryptology - CRYPTO 2020, 2020

2019
Mitigating Leakage in Secure Cloud-Hosted Data Structures: Volume-Hiding for Multi-Maps via Hashing.
IACR Cryptol. ePrint Arch., 2019

Leakage Cell Probe Model: Lower Bounds for Key-Equality Mitigation in Encrypted Multi-Maps.
IACR Cryptol. ePrint Arch., 2019

What Storage Access Privacy is Achievable with Small Overhead?
IACR Cryptol. ePrint Arch., 2019

Lower Bounds for Multi-Server Oblivious RAMs.
IACR Cryptol. ePrint Arch., 2019

Communication-Computation Trade-offs in PIR.
IACR Cryptol. ePrint Arch., 2019

Lower Bounds for Oblivious Near-Neighbor Search.
Electron. Colloquium Comput. Complex., 2019

Protecting accounts from credential stuffing with password breach alerting.
Proceedings of the 28th USENIX Security Symposium, 2019

2018
Private Stateful Information Retrieval.
IACR Cryptol. ePrint Arch., 2018

PanORAMa: Oblivious RAM with Logarithmic Overhead.
IACR Cryptol. ePrint Arch., 2018

Lower Bounds for Differentially Private RAMs.
Electron. Colloquium Comput. Complex., 2018

CacheShuffle: A Family of Oblivious Shuffles.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2017
Symmetric Searchable Encryption with Sharing and Unsharing.
IACR Cryptol. ePrint Arch., 2017

Recursive ORAMs with Practical Constructions.
IACR Cryptol. ePrint Arch., 2017

CacheShuffle: An Oblivious Shuffle Algorithm Using Caches.
CoRR, 2017

2015
Real time mobile application of in-air signature with Fast Dynamic Time Warping (FastDTW).
Proceedings of the 2015 IEEE International Conference on Signal and Image Processing Applications, 2015


  Loading...