photo by Jacob Appelbaum
I'm a fifth-year graduate student in theoretical computer science at Princeton University. My research interests include algorithms, graph theory, and the mathematics of cryptography.
I was an undergraduate at UC Berkeley, where I studied electrical engineering and computer science. I spent time as an intern at the World Wide Web Consortium in France, a summer in Anant Godbole's math REU at East Tennessee State University, a semester in the Budapest Semesters in Mathematics program, and a summer as an intern at AT&T Labs as part of their fellowship program.
Defeating Vanish with Low-Cost Sybil Attacks Against Large DHTs, Scott Wolchok, Owen S. Hofmann, Nadia Heninger, Edward W. Felten, J. Alex Halderman, Christopher J. Rossbach, Brent Waters, Emmett Witchel
Reconstructing RSA Private Keys from Random Key Bits, Nadia Heninger and Hovav Shacham, Proc. Crypto 2009, Santa Barbara, CA, August 2009. (slides)
Fingerprinting Blank Paper Using Commodity Scanners, William Clarkson, Tim Weyrich, Adam Finkelstein, Nadia Heninger, J. Alex Halderman, and Edward W. Felten, Proc. IEEE Symposium on Security and Privacy, Oakland, CA, May 2009.
Lest We Remember: Cold Boot Attacks on Encryption Keys, J. Alex Halderman, Seth D. Schoen, Nadia Heninger, William Clarkson, William Paul, Joseph A. Calandrino, Ariel J. Feldman, Jacob Appelbaum, and Edward W. Felten, Proc. 17th USENIX Security Symposium (Sec '08), San Jose, CA, August 2008
On the Integrality of n-th Roots of Generating Functions, Nadia Heninger, Eric Rains and N. J. A. Sloane, Journal of Combinatorial Theory Series A, v.113 n.8, p.1732-1745, November 2006