Ananth Raghunathan

Senior Research Scientist
Google Brain
1600 Amphitheatre Pkwy
Mountain View, CA, 94043

email: ananthr (at) cs (dot) [PhD university] (dot) edu

Google Scholar  Google Research  DBLP

Bio

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 am also part of the FrodoKEM team that designed and submitted the Frodo Key Encapsulation Mechanism to the NIST post-quantum crypto candidates competition.

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.

I spent Summer 2013 with Dirk Balfanz and the security engineering team doing research on the Security Key at Google. I spent Summer 2012 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 in 2009.

Publications

Scalable Private Learning with PATE  With Nicolas Papernot, Shuang Song, Ilya Mironov, Kunal Talwar, and Úlfar Erlingsson ICLR 2018

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 LWE  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 Attacks  With Kevin Lewi and Hart Montgomery ACNS 2014

Function-Private Subspace-Membership Encryption and Its Applications  With Dan Boneh and Gil Segev ASIACRYPT 2013

Function-Private Identity-Based Encryption: Hiding the Function in Functional Encryption  With Dan Boneh and Gil Segev CRYPTO 2013

Message-Locked Encryption for Lock-Dependent Messages  With Martín Abadi, Dan Boneh, Ilya Mironov, and Gil Segev CRYPTO 2013

Key-Homomorphic PRFs and Their Applications  With Dan Boneh, Kevin Lewi, and Hart Montgomery CRYPTO 2013

Deterministic Public-Key Encryption for Adaptively Chosen Plaintext Distributions  With Gil Segev and Salil Vadhan EUROCRYPT 2013  Journal of Cryptology 2018

Algebraic PRFs with Improved Efficiency from the Augmented Cascade  With Dan Boneh, Hart Montgomery ACM CCS 2010

Obfuscating Straight Line Arithmetic Programs  With Srivatsan Narayanan, Ramarathnam Venkatesan DRM Workshop at ACM CCS 2009

Service

I have served or am serving on the program committees for the following conferences: IEEE S&P (Oakland) 2019, PETS 2019, CRYPTO 2018, and PETS 2018.

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.

Teaching

I helped my advisor with this excellent online course! in the Winter of 2012.
I was a Course Assistant (CA) for CS255: Introduction to Cryptography in Winter 2012 and 2011.

Personal

My sister Aditi Raghunathan.

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.