Kevin Yeo
Applied Cryptography Group (Google NYC)
Personal Information
Kevin Yeo is a software engineer in the Applied Cryptography Group in Google NYC. His research interests lie in the intersection of cryptography and algorithms with a focus on both the theory and practice of privacy-preserving storage protocols.
Kevin holds two B.Math. in both Computer Science and Combinatorics & Optimization from the University of Waterloo in Canada. He also competed in algorithm contests where he received a gold medal in the Canadian Computing Competition and received a bronze medal at the International Olympiad in Informatics.
Contact
Email: [first name]wl[last name]@gmail.com
Publications
2019
Protecting 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 2019What 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
Lower Bounds for Oblivious Near-Neighbor Search
Kasper Green Larsen, Tal Malkin, Omri Weinstein and Kevin YeoRecursive ORAMs with Practical Constructions
Sarvar Patel, Giuseppe Persiano and Kevin YeoTalks
Lower Bounds for Differentially Private RAMs
Contributed talk at Highlights of Algorithms (HALG), Copenhagen, Denmark, June 2019Lower Bounds for Differentially Private RAMs
The 38th Annual International Conference on the Theory and Applications of Cryptographic Techniques (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
The 25th ACM Conference on Computer and Communications Security (CCS), Toronto, Canada, October 2018PanORAMa: Oblivious RAM with Logarithmic Overhead
NYC Crypto Day, Columbia University, October 2018PanORAMa: Oblivious RAM with Logarithmic Overhead
The 59th Annual IEEE Symposium on Foundations of Computer Science (FOCS), Paris France, October 2018Symmetric Searchable Encryption with Sharing and Unsharing
The 23rd European Symposium on Research in Computer Security (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
The 45th International Colloquium on Automata, Languages, and Programming (ICALP), Prague, Czechia, July 2018Symmetric Searchable Encryption with Sharing and Unsharing
Seminar at Department of Computer Science, Brown University, February 2018Service
Workshop Co-organizer: ODSA: Oblivious Data Structures and Algorithms
External Reviews 2019: STOC, USENIX Security, SPAA, Crypto, FOCS, S&P, TCC
External Reviews 2018: Asiacrypt, TCC