I am a third 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.
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.
Privately Identifying Location Hotspots
With Dan Boneh, Peter Chien
(under submission)
[pdf]
Algebraic Pseudorandom Functions with Improved Efficiency from the Augmented Cascade
With Dan Boneh, Hart Montgomery
ACM CCS 2010
[eprint] [pdf] [slides/keynote] [slides/pdf]
Lower Bounds for Round and Communication Complexities of Unconditional Verifiable Secret Sharing
With Srivatsan Narayanan, Pandu Rangan
[pdf]
Obfuscating Straight Line Arithmetic Programs
With Srivatsan Narayanan, Ramarathnam
Venkatesan
ACM DRM 2009
[pdf] [slides]
A short write-up on Toda's theorem
(one of my favorite results in complexity theory)
Project report for CS254
[tex] [pdf]
Department of Computer Science
353 Serra Mall
#492 GATES
Stanford University
Stanford CA 94305-5008

(can you guess this
famous font?)
I am helping my advisor with this excellent online course!
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)
CS259C: Elliptic Curves in Cryptography, Fall 2011
CS354: Topics in Circuit Complexity, Fall 2011
CS294S: The Tor project class, Spring 2011
CS364A: Algorithmic Game Theory, Winter 2011 (audit)
CS355: Advanced Topics in Cryptography, Spring 2010
CS254: Computational Complexity, Spring 2010
CS241: Secure Web Programming, Spring 2010 (audit)
CS155: Computer and Network Security, Spring 2010 (audit)
CS255: Introduction to Cryptography, Winter 2010 (audit)
MATH155: Analytical Number Theory, Winter 2010 (audit)
CS369N: Beyond Worst-case Analysis, Autumn 2009