photo of Nadia Heninger by Frank Wojciechowski

Nadia Heninger


Magerman Term Assistant Professor
Computer and Information Science
University of Pennsylvania

3330 Walnut St.
Philadelphia, PA 19104-3409

Email: nadiah at cis dot upenn dot edu

Office: 464 Levine GRW

Phone: +1 215 898 9252


My primary research interests are in cryptography and security, with particular interest in cryptography in practice, cryptanalysis, privacy, lattices, computational number theory, and coding theory. I am part of the Security Laboratory and the Theory Group at Penn.

Previously, I was a visiting researcher at Microsoft Research New England in Cambridge, MA, and an NSF mathematical sciences postdoctoral fellow in the Department of Computer Science and Engineering at UC San Diego. I have a Ph.D. in computer science from Princeton University and a B.S. in electrical engineering and computer science from UC Berkeley.

curriculum vitae


Teaching

Fall 2014: CIS 700: Cryptography

Spring 2014: CIS 331: Introduction to Networks & Security

Fall 2013: CIS 800/02: Topics in Cryptography

Seminars and reading groups

I am helping to organize Penn's weekly theory seminar and security reading group.

Papers

Elliptic Curve Cryptography in Practice. Joppe W. Bos, J. Alex Halderman, Nadia Heninger, Jonathan Moore, Michael Naehrig, and Eric Wustrow. Financial Cryptography 2014. [ePrint]

Factoring RSA keys from certified smart cards: Coppersmith in the wild. Daniel J. Bernstein, Yun-An Chang, Chen-Mou Cheng, Li-Ping Chou, Nadia Heninger, Tanja Lange, and Nicko van Someren. Asiacrypt 2013. [web site]

Torchestra: Reducing interactive traffic delays over Tor. Deepika Gopal and Nadia Heninger. Workshop on Privacy in the Electronic Society 2012.

Mining your Ps and Qs: Detection of widespread weak keys in network devices. Nadia Heninger, Zakir Durumeric, Eric Wustrow, J. Alex Halderman. Usenix Security 2012. Best paper award! [web site]

Optimally robust private information retrieval. Casey Devet, Ian Goldberg, and Nadia Heninger. Usenix Security 2012. [ePrint]

Approximate common divisors via lattices. Henry Cohn and Nadia Heninger. Algorithmic Number Theory Symposium 2012. [ePrint] [higgledy piggledy]

Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding. Henry Cohn and Nadia Heninger. Innovations in Computer Science 2011. [arXiv] [slides]

Computational complexity and information asymmetry in election audits with low-entropy randomness. Nadia Heninger. Electronic Voting Technology Workshop/Workshop on Trustworthy Elections 2010. [slides] [higgledy piggledy]

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. Network & Distributed System Security Symposium 2010. [web site]

Reconstructing RSA private keys from random key bits. Nadia Heninger and Hovav Shacham. Crypto 2009. [ePrint] [slides] [source]

Fingerprinting blank paper using commodity scanners. William Clarkson, Tim Weyrich, Adam Finkelstein, Nadia Heninger, J. Alex Halderman, and Edward W. Felten. IEEE Symposium on Security and Privacy 2009. [web site]

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. Usenix Security 2008. Best student paper award! [web site]

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.