Susan Landau is Bridge Professor in Cyber Security and Policy at The Fletcher School and the School of Engineering, Department of Computer Science, Tufts University and founding director of Tufts's innovative MS degree in Cybersecurity and Public Policy. She has been a Senior Staff Privacy Analyst at Google, a Distinguished Engineer at Sun Microsystems, and a faculty member at Worcester Polytechnic Institute, the University of Massachusetts Amherst, and Wesleyan University. Landau's research lies at the intersection of privacy, surveillance, cybersecurity, and law, and she has testified before Congress and frequently briefed US and European policymakers on encryption, surveillance, and cybersecurity issues. An interdisciplinary scholar, Landau has won the McGannon Book Award for Social and Ethical Relevance in Communication Policy Research for Privacy on the Line: The Politics of Wiretapping and Encryption, co-authored with Whitfield Diffie, the Surveillance Studies Book Prize for Surveillance or Security: The Risks Posed by New Wiretapping Technologies, the USENIX Lifetime Achievement Award, shared with Steven Bellovin and Matt Blaze, and the American Mathematical Society's Bertrand Russell Prize. Landau has served on committees of the National Academies of Sciences, Engineering, and Medicine, on the National Science Foundation Computer and Information Science Engineering Advisory Board, the National Institute of Standards and Technology Information Security and Privacy Advisory Board, and on editorial boards for mathematics and computer science jounrals. She is a Guggenheim fellow, a fellow of Association for Computing Machinery and the American Association for the Advancement of Science, as well as an inductee pf the Information System Security Hall of Fame and the Cybersecurity Hall of Fame. Landau received her BA from Princeton University, MS from Cornell University, and PhD from MIT.

Susan Landau
Photo by Ben Barnhart

CV
 
 
Landau is strongly committed to the success of women and members of underrepresented groups in science. She currently serves on the External Advisory Board for the Spelman College program in cyber security and policy. Her previous activities have included co-creating the graduate student GREPSEC workshops in privacy and security for women and members of underrepresented groups, conceiving of and co-creating the ACM Athena Lectureship, which honors senior women researchers, starting researcHers, a mailing list for women computer science researchers in academia, industry and government labs and co-organizing the first MIT Celebration of Women in Math meeting. Landau received the 2008 Women of Vision Social Impact Award from the Anita Borg Institute for Women and Technology.
 
     
     
     
 

MIT Press
Amazon
 
     
 

Yale University Press
Amazon
   

MIT Press
Amazon
 

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

Cryptography and Cryptography Policy

Contact-Tracing Apps, Privacy, and Equity

Privacy

Cybersecurity

Law and Public Policy

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

Blog Posts, Letters to the Editor, and Other Short Pieces on a Variety of Topics

Podcasts

Webinars

 
     
  [top]  
   
     
     
     
 

Professional Activities (recent)

 
     
     
  [top]  
   
     
     
     
     
 

Honors and Awards

 
   
  [top]  
     
     
     
     
  Contact Information

 
 
For all Tufts-related activity:

617-627-4792

 
 
For any non-Tufts-related activities:

     413-259-2018

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