Kevin Yeo
Applied Cryptography Group (Google NYC)
Personal Information
I am a software engineer in the Applied Cryptography Group in Google NYC. I am also a part-time student at Columbia University where I am lucky to be supervised by Tal Malkin. My research interests lie in the intersection of cryptography and algorithms with a focus on both the theory and practice of privacy-preserving storage protocols.
I graduated from the University of Waterloo in Canada with a Bachelor of Mathematics in both Computer Science and Combinatorics & Optimization. I also competed in algorithm contests where I received a gold medal in the Canadian Computing Competition and a bronze medal at the International Olympiad in Informatics.
Contact
Email: [first name]wl[last name]@gmail.com
Publications
Note: For theory, authors are listed alphabetically by last name. All publications not following this rule are denoted with an asterisk(*).
2022
SoK: SCT Auditing in Certificate Transparency*
Sarah Meiklejohn, Joe DeBlasio, Devon O'Brien, Chris Thompson, Kevin Yeo and Emily StarkPETS 2022Limits of Preprocessing for Single-Server PIR
Giuseppe Persiano and Kevin YeoSODA 20222021
Forward Secret Encrypted RAMs: Lower Bounds and Applications
Alex Bienstock, Yevgeniy Dodis and Kevin YeoTCC 2021Efficient Boolean Search over Encrypted Data with Reduced Leakage
Sarvar Patel, Giuseppe Persiano, Joon Young Seo and Kevin YeoASIACRYPT 2021Communication-Computation Trade-offs in PIR
Asra Ali, Tancrède Lepoint, Sarvar Patel, Mariana Raykova, Phillipp Schoppmann, Karn Seth and Kevin YeoUSENIX Security 2021Doubly-Affine Extractors, and Their Applications
Yevgeniy Dodis and Kevin YeoITC 20212020
Lower Bounds for Multi-Server Oblivious RAMs
Kasper Green Larsen, Mark Simkin and Kevin YeoTCC 2020Lower Bounds for Encrypted Multi-Maps and Searchable Encryption in the Leakage Cell Probe Model
Sarvar Patel, Giuseppe Persiano and Kevin YeoCRYPTO 2020Lower Bounds for Oblivious Near-Neighbor Search
Kasper Green Larsen, Tal Malkin, Omri Weinstein and Kevin YeoSODA 20202019
Mitigating Leakage in Secure Cloud-Hosted Data Structures: Volume-Hiding for Multi-Maps via Hashing
Sarvar Patel, Giuseppe Persiano, Kevin Yeo and Moti YungCCS 2019Protecting accounts from credential stuffing with password breach alerting*
Kurt Thomas, Jennifer Pullman, Kevin Yeo, Ananth Raghunathan, Patrick Gage Kelley, Luca Invernizzi, Borbala Benko, Tadek Pietraszek, Sarvar Patel, Dan Boneh and Elie BurszteinUSENIX Security 2019 (Distinguished Paper Award)What Storage Access Privacy is Achievable with Small Overhead?
Sarvar Patel, Giuseppe Persiano and Kevin YeoPODS 2019Lower Bounds for Differentially Private RAMs
Giuseppe Persiano and Kevin YeoEUROCRYPT 20192018
Private Stateful Information Retrieval
Sarvar Patel, Giuseppe Persiano and Kevin YeoCCS 2018PanORAMa: Oblivious RAM with Logarithmic Overhead
Sarvar Patel, Giuseppe Persiano, Mariana Raykova and Kevin YeoFOCS 2018Symmetric Searchable Encryption with Sharing and Unsharing
Sarvar Patel, Giuseppe Persiano and Kevin YeoESORICS 2018CacheShuffle: A Family of Oblivious Shuffles
Sarvar Patel, Giuseppe Persiano and Kevin YeoICALP 2018Manuscripts
Dynamic Volume-Hiding Encrypted Multi-Maps with Applications to Searchable Encryption
Ghous Amjad, Sarvar Patel, Giuseppe Persiano, Kevin Yeo and Moti YungStatic Lower Bounds for Non-Adaptive Data Structures
Giuseppe Persiano and Kevin YeoRecursive ORAMs with Practical Constructions
Sarvar Patel, Giuseppe Persiano and Kevin YeoTalks
Limits of Preprocessing for Single-Server PIR
Crypto Seminar, Carnegie Mellon University, April 2022Cryptographic Data Structures: Limitations and Possibilities
Crypto Seminar, New York University, February 2022Limits of Preprocessing for Single-Server PIR
SODA, Virtual, January 2022Protecting accounts from credential stuffing with password breach alerting
Seminar, Carnegie Mellon University, October 2021Communication-Computation Trade-offs in PIR
USENIX Security, Virtual, July 2021Doubly-Affine Extractors, and Their Applications
ITC, Virtual, July 2021Cryptographic Data Structures: Limitations and Possibilities
Security Seminar, MIT, February 2021Lower Bounds for Multi-Server Oblivious RAMs
TCC, Virtual, November 2020Lower Bounds for Encrypted Multi-Maps and Searchable Encryption in the Leakage Cell Probe Model
CRYPTO, Virtual, August 2020Protecting accounts from credential stuffing with password breach alerting
Real World Crypto Symposium, New York City, New York, January 2020Lower Bounds for Oblivious Near-Neighbor Search
SODA, Salt Lake City, Utah, January 2020Cell Probe Lower Bounds in Cryptography
Crypto Seminar, University of Washington, November 2019Mitigating Leakage in Secure Cloud-Hosted Data Structures: Volume Hiding for Multi-Maps via Hashing
CCS, London, United Kingdom, November 2019Leakage Cell Probe Model: Lower Bounds for Key-Equality Mitigation in Encrypted Multi-Maps
Crypto Seminar, Cornell Tech, October 2019Private Stateful Information Retrieval
Crypto Seminar, New York University, October 2019Private Stateful Information Retrieval
Crypto Seminar, Columbia University, October 2019Private Stateful Information Retrieval
Oblivious Data Structures and Algorithms Workshop, Bertinoro, Italy, July 2019Lower Bounds for Differentially Private RAMs
Lower Bounds in Cryptography Workshop, Bertinoro, Italy, July 2019What Storage Access Privacy is Achievable with Small Overhead?
PODS, Amsterdam, Netherlands, July 2019Lower Bounds for Differentially Private RAMs
HALG, Copenhagen, Denmark, June 2019Lower Bounds for Differentially Private RAMs
EUROCRYPT, Darmstadt, Germany, May 2019Lower Bounds for Oblivious Near-Neighbor Search
Seminar at Department of Computer Science (Algorithms & Complexity Group), University of Waterloo, May 2019Private Stateful Information Retrieval
Seminar at Department of Computer Science, Boston University, February 2019Private Stateful Information Retrieval
Xi'an International Workshop on Blockchain, Xi'an, China, December 2018PanORAMa: Oblivious RAM with Logarithmic Overhead
Theory Seminar at Department of Computer Science, Columbia University, November 2018Private Stateful Information Retrieval
CCS, Toronto, Canada, October 2018PanORAMa: Oblivious RAM with Logarithmic Overhead
NYC Crypto Day, Columbia University, October 2018PanORAMa: Oblivious RAM with Logarithmic Overhead
FOCS, Paris France, October 2018Symmetric Searchable Encryption with Sharing and Unsharing
ESORICS, Barcelona, Spain, September 2018PanORAMa: Oblivious RAM with Logarithmic Overhead
Seminar at Department of Computer Science, Northeastern University, July 2018CacheShuffle: A Family of Oblivious Shuffles
ICALP, Prague, Czechia, July 2018Symmetric Searchable Encryption with Sharing and Unsharing
Seminar at Department of Computer Science, Brown University, February 2018Service
Program Committee: CRYPTO 2022, AsiaCCS 2022, AsiaCCS 2021, PPML (CCS Workshop) 2019