Ananth Raghunathan
About Me
I am a fourth year graduate student in the Department of Computer Science at Stanford University. I am broadly interested in cryptography, security, and theoretical computer science. I work with Prof. Dan Boneh.
My recent research focuses on modeling and building secure deterministic and searchable encryption schemes. I also work on building encryption and signature schemes from lattice-based cryptography, among other topics in cryptography.
I graduated from the Computer Science and Engineering Department at IIT Madras with a Bachelors of Technology in Computer Science with a minor in Physics in July 2009.
Contact Info
Department of Computer Science
353 Serra Mall
#492 GATES
Stanford University
Stanford CA 94305-5008
Email address:
(can you guess this
famous font?)
Teaching
I helped my advisor with this excellent online course! in the Winter of 2012.
CS255: Introduction to Cryptography, Winter 2012
CS255: Introduction to Cryptography, Winter 2011
Handout on proofs in Crypto
Simple exercises to begin with
(very prelimiary rough drafts, comments are welcome)
Publications and Manuscripts
Function-Private Identity-Based Encryption: Hiding the
Function in Functional Encryption
With Dan Boneh and
Gil Segev
CRYPTO 2013
[IACR ePrint
archive]
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
[IACR ePrint
archive]
[Slides]
Algebraic Pseudorandom Functions with Improved Efficiency from the Augmented Cascade
With Dan Boneh, Hart Montgomery
ACM CCS 2010
[IACR ePrint
archive]
Obfuscating Straight Line Arithmetic Programs
With Srivatsan Narayanan, Ramarathnam
Venkatesan
ACM DRM 2009
[PDF]
Privately Identifying Location Hotspots
With Dan Boneh and Peter Chien
[PDF]
Lower Bounds for Round and Communication Complexities of Unconditional Verifiable Secret Sharing
With Srivatsan Narayanan, Pandu Rangan
[PDF]
A short write-up on Toda's theorem
(one of my favorite results in complexity theory)
Project report for CS254
[PDF]