Susan Landau

CV
Susan Landau is Professor of Cybersecurity Policy in the Department of Social Science and Policy Studies at Worcester Polytechnic Institute and a Visiting Professor in Computer Science at University College London. Her research is in cybersecurity policy. She has worked on privacy and security of communications surveillance, identity, and critical infrastructure protection. Landau is the author of Surveillance or Security? The Risks Posed by New Wiretapping Technologies (MIT Press, 2011) and co-author, with Whitfield Diffie, of Privacy on the Line: The Politics of Wiretapping and Encryption (MIT Press, 1998, rev. ed. 2007). She testified to Congress on security risks in wiretapping and on NIST's Cybersecurity Activities. Landau has been a senior staff Privacy Analyst at Google, a Distinguished Engineer at Sun Microsystems, a faculty member at the University of Massachusetts at Amherst and Wesleyan University and has held visiting positions at Harvard, Cornell, Yale, and the Mathematical Sciences Research Institute. A 2012 Guggenheim fellow and 2010-2011 fellow at the Radcliffe Institute for Advanced Study, Landau is the recipient of the 2008 Women of Vision Social Impact Award, and is also a fellow of both the American Association for the Advancement of Science and the Association for Computing Machinery.

 
     
 

MIT Press
Amazon
 

MIT Press
Amazon
 
     
  Biographical Information

Susan Landau is Professor of Cybersecurity Policy in the Department of Social Science and Policy Studies at Worcester Polytechnic Institute and a Visiting Professor in Computer Science at University College London. Her research is in cybersecurity policy, where she has focused on security and privacy of communications surveillance; she has also worked on attribution, identity, and critical infrastructure protection. Landau has been a leading scholar on the security risks of embedding surveillance within communications infrastructures. Her book Surveillance or Security? The Risks Posed by New Wiretapping Technologies (MIT Press) won the 2012 Surveillance Studies Book Prize. She is also the co-author, with Whitfield Diffie, of Privacy on the Line: The Politics of Wiretapping and Encryption (MIT Press), which won the 1998 Donald McGannon Communication Policy Research Award, and the 1999 IEEE-USA Award for Distinguished Literary Contributions Furthering Public Understanding of the Profession (revised edition, 2007). Landau recently served on a National Academies study on bulk signals intelligence collection, Bulk Collection of Signals Intelligence: Technical Options. As an expert on communications surveillance, Landau has briefed the U.S. and European governments, written for the Washington Post, the Chicago Tribune, the Christian Science Monitor, Science, and Scientific American, and has frequently appeared on NPR.

Landau serves on the Computer Science and Telecommunications Board of the National Academies of Sciences, Engineering, and Medicine, and is associate editor in chief for IEEE Security and Privacy, area editor for political and policy perspectives for the Journal of Cyber Security, and contributing editor for Lawfareblog. She served on the advisory committee for the National Science Foundation's Directorate for Computer and Information Science and Engineering, the National Institute of Standards and Technology's Information Security and Privacy Advisory Board, and the Commission on Cyber Security for the 44th Presidency. She was section board member for Communications of the ACM from 2008-2014 and associate editor of the Notices of the American Mathematical Society from 1994-2001.

Prior to returning to academia, Landau was a Senior Staff Privacy Analyst at Google and a Distinguished Engineer at Sun Microsystems. At Sun, Landau worked on digital rights management, privacy and security aspects of federated identity management, and cryptographic export control. Landau has been a faculty member in computer science at the University of Massachusetts at Amherst and Wesleyan University and held visiting positions at Harvard, Yale, Cornell, and the Mathematical Sciences Research Institute at Berkeley. She spent many wonderful summers teaching at Hampshire College Summer Studies in Mathematics, a program for high-ability high school students (cf. Supporting a National Treasure).

Landau is active in issues related to women in science. With Terry Benzel and Hilarie Orman, she has organized security research meetings for women and members of underrepresented groups. Landau started researcHers, a mailing list for women computer science researchers in academia, industry and government labs and with Elaine Weyuker, created the ACM-W Athena Lectureship, an award celebrating outstanding women researchers. In 2008 Landau co-chaired the MIT Celebration of Women in Math meeting. She has served on the executive committee of ACM-W and the Computing Research Association Committee on the Status of Women in Computing Research (CRAW).

A 2012 Guggenheim fellow and 2010-2011 fellow at the Radcliffe Institute for Advanced Study, Landau is the recipient of the 2008 Women of Vision Social Impact Award, and is also a fellow of the American Association for the Advancement of Science and the Association for Computing Machinery. She received her PhD from MIT (1983), her MS from Cornell (1979), and her BA from Princeton (1976).

 
   
  [top]  
     
     
     
     
  Publications
(Publications are arranged by subject and may be listed in more than one category if appropriate.)
 
     
 

Cybersecurity

Cryptography

Privacy

Identity Management

Digital Rights Management

Symbolic Computation

  • S. Landau, "Computations with Algebraic Numbers," in J. Grabmeier, E. Kaltofen, and V. Weispfennig (eds.), Computer Algebra Handbook, Spring Verlag, 2003, pp. 18-19.
  • S. Landau and N. Immerman, Embedding Linkages in Integer Lattices, Algorithmica, Vol. 43, No. 5, May 2000, pp. 115-120. A preliminary version appeared in MSI Workshop on Computational Geometry, October, 1994.
  • S. Landau, Compute and Conjecture, Commentary (In My Opinion), Notices of the American Mathematical Society, Feb. 1999, p. 189.
  • S. Landau, : Four Different Views, Mathematical Intelligencer, Vol. 20, No. 4 (Fall 1998), pp. 55-60.
  • D. Kozen, S. Landau, and R. Zippel, Decomposition of Algebraic Functions, Journal of Symbolic Computation, Vol. 22 (1996), pp. 235-246. A preliminary version appeared in Algorithmic Number Theory Symposium (1994).
  • S. Landau, How to Tangle with a Nested Radical, Mathematical Intelligencer, Vol. 16, No. 2 (Spring 1994), pp. 49-55.
  • S. Landau, Finding Maximal Subfields, SIGSAM Bulletin, Vol. 27, No. 3 (1993), pp. 4-8.
  • S. Landau, Simplification of Nested Radicals, SIAM J. of Comput., Vol. 21 (1992), pp. 85-110. A preliminary version appeared in Thirtieth Annual IEEE Symposium on Foundations of Computer Science (1989), pp. 314-319.
  • S. Landau, A Note on `Zippel Denesting,' J. Symb. Comput., Vol. 13 (1992), pp. 41-47.
  • J. Cremona and S. Landau, Shrinking Lattice Polyhedra, SIAM J. of Discrete Math, Vol. 3, No. 3 (1990), pp. 338-348. A preliminary version appeared in Proceedings of the First ACM-SIAM Symposium on Discrete Algorithms (1990), pp. 188-193.
  • D. Kozen and S. Landau, Polynomial Decomposition Algorithms, J. Symb. Comput., Vol. 7 (1989), pp. 445-456. Appeared in a different version as J. von zur Gathen, D. Kozen and S. Landau, "Functional Decomposition of Polynomials" Twenty-Eight Annual IEEE Symposium on the Foundations of Computer Science (1989), pp. 314-319.
  • S. Landau, Factoring Polynomials Quickly, Notices of the American Mathematical Society, [Special Article Series], vol. 34, No. 1 (1987), pp. 3-8.
  • S. Landau and G. Miller, Solvability by Radicals is in Polynomial Time, J. Comput. Sys. Sci., Vol. 30, No. 2 (1985), pp. 179-208. A preliminary version appeared in Fifteenth ACM Symposium on Theory of Computing (1983), pp. 140-151.
  • S. Landau, Factoring Polynomials over Algebraic Number Fields, SIAM J. of Comput., Vol. 14, No. 1 (1985), pp. 184-195.
  • S. Landau, Polynomial Time Algorithms for Galois Groups, Proceedings of the Int'l. Symposium on Symbolic and Algebraic Computation (1984), Spring Verlag Lecture Notes in Computer Science, No. 174, pp. 225-236.

Complexity

  • N. Immerman and S. Landau, The Complexity of Iterated Multiplication, Information and Computation Vol. 116, No. 1 (1995), pp. 103-116. A preliminary version appeared in Fourth Annual Structure in Complexity Conference (1989), pp. 104-111.
  • S. Landau and N. Immerman, The Similarities (and Differences) between Polynomials and Integers, Int'l. Conf. on Number Theoretic and Algebraic Methods in Computer Science (1993), pp. 57-59.

Women in Science

Miscellaneous

 
     
  [top]  
   
     
     
     
 

Professional Activities (recent)

 
     
     
  [top]  
   
     
     
     
     
 

Honors and Awards

 
   
  [top]  
     
     
     
     
 

Contact Information

Phone: 413-259-2018

 
     
     
  [top]  
     
     
  Copyright © 2015 Susan Landau | Site Design by Silvana.Net