Senior Research Scientist
1600 Amphitheatre Pkwy
Mountain View, CA, 94043
email: ananthr (at) cs (dot) [PhD university] (dot) edu
I am a computer scientist broadly interested in cryptography, security, and machine learning. At Google, I work in the security and privacy research team under Google Brain with Úlfar Erlingsson on differential privacy (RAPPOR), applied crypto (incl. post-quantum crypto), and topics at the intersection of security and machine learning.
I received my Ph.D. from the Department of Computer Science at Stanford University advised by Prof. Dan Boneh. My thesis focused on modeling and building secure deterministic and searchable encryption schemes. I also worked on building lattice-based cryptographic primitives, among other topics in cryptography.
During my Ph.D., I spent summers with Dirk Balfanz and the security engineering team doing research on the Security Key at Google, and at Microsoft Research (Silicon Valley) working with Gil Segev and Ilya Mironov. Earlier, I graduated from the Computer Science and Engineering Department at IIT Madras with a Bachelors of Technology in Computer Science.
Protecting accounts from credential stuffing with password
With Kurt Thomas, Jennifer Pullman, Kevin Yeo, Patrick Gage Kelley, Luca Invernizzi, Borbala Benko,
Sarvar Patel, Dan Boneh, and Elie Burzstein
Distinguished Paper Award Winner
USENIX Security 2019
Amplification by Shuffling: From Local to Central Differential Privacy via Anonymity
With Úlfar Erlingsson, Vitaly Feldman, Ilya Mironov, Kunal Talwar, and Abhradeep Guha Thakurta
Scalable Private Learning with PATE |
With Nicolas Papernot, Shuang Song, Ilya Mironov, Kunal Talwar, and Úlfar Erlingsson
Prochlo: Strong Privacy for Analytics in the Crowd |
With Andrea Bittau, Úlfar Erlingsson, Petros Maniatis, Ilya Mironov, David Lie, Mitch Rudominer, Ushasree Kode,
Julien Tinnes, and Bernhard Seefeld
ACM SOSP 2017
Frodo: Take off the ring! Practical, Quantum-Secure Key Exchange from
With Joppe Bos, Craig Costello, Léo Ducas, Ilya Mironov, Michael Naehrig, Valeria Nikolaenko, and Douglas Stebila
ACM CCS 2016
Improved Constructions of PRFs Secure Against Related-Key
With Kevin Lewi and Hart Montgomery
Function-Private Subspace-Membership Encryption and Its
With Dan Boneh and Gil Segev
Function-Private Identity-Based Encryption: Hiding the Function in
With Dan Boneh and Gil Segev
Message-Locked Encryption for Lock-Dependent Messages
With Martín Abadi, Dan Boneh, Ilya Mironov, and Gil Segev
Key-Homomorphic PRFs and Their Applications
With Dan Boneh, Kevin Lewi, and Hart Montgomery
Deterministic Public-Key Encryption for Adaptively Chosen Plaintext
With Gil Segev and Salil Vadhan
Journal of Cryptology 2018
Algebraic PRFs with Improved Efficiency from the Augmented
With Dan Boneh, Hart Montgomery
ACM CCS 2010
Obfuscating Straight Line Arithmetic Programs |
With Srivatsan Narayanan, Ramarathnam Venkatesan
DRM Workshop at ACM CCS 2009
In the past, I have reviewed papers for the following conferences: CRYPTO, EUROCRYPT, IEEE S&P (Oakland), Usenix Security, PKC, TCC, PODS, ICALP, Financial Crypto, and ICISC.
A short write-up on the Gödel prize-winning Toda's theorem—one of my favorite results in complexity theory—as a project report for Prof. Luca Trevisan's CS254.
Website design inspired by Philipp Krähenbühl.