Dan Boneh

About

Professor Dan Boneh is the Rajeev Motwani Professor in the School of Engineering and a Professor of Electrical Engineering at Stanford University. He heads the applied cryptography group and co-directs the Stanford Computer Security Lab. His research focuses on applications of cryptography to computer security, including cryptosystems with novel properties, web security, security for mobile devices, and cryptanalysis. Professor Boneh has authored over a hundred publications in the field and is recognized as a Packard and Alfred P. Sloan fellow. He has received several awards, including the 2014 ACM prize, the 2013 Godel prize, and the 2011 Ishii award for industry education innovation. He earned his Ph.D. from Princeton University and joined Stanford in 1997.

Research topics

• Computer Science
• Computer Security
• Artificial Intelligence
• World Wide Web
• Discrete mathematics
• Political Science
• Sociology
• Mathematics
• Engineering
• Law

Selected publications

• Zether: Towards Privacy in a Smart Contract World

  Lecture notes in computer science · 2020 · 300 citations

  Senior authorCorresponding
  PublisherDOI

• Do Users Write More Insecure Code with AI Assistants?

  Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security · 2023 · 158 citations

  Senior authorCorresponding

  AI code assistants have emerged as powerful tools that can aid in the software development life-cycle and can improve developer productivity. Unfortunately, such assistants have also been found to produce insecure code in lab environments, raising significant concerns about their usage in practice. In this paper, we conduct a user study to examine how users interact with AI code assistants to solve a variety of security related tasks. Overall, we find that participants who had access to an AI as…

  DOI

• SoK: Hate, Harassment, and the Changing Landscape of Online Abuse

  2022 IEEE Symposium on Security and Privacy (SP) · 2021 · 133 citations

  We argue that existing security, privacy, and antiabuse protections fail to address the growing threat of online hate and harassment. In order for our community to understand and address this gap, we propose a taxonomy for reasoning about online hate and harassment. Our taxonomy draws on over 150 interdisciplinary research papers that cover disparate threats ranging from intimate partner violence to coordinated mobs. In the process, we identify seven classes of attacks—such as toxic content and…

  DOI

• Halo Infinite: Proof-Carrying Data from Additive Polynomial Commitments

  Lecture notes in computer science · 2021 · 54 citations

  1st authorCorresponding
  PublisherDOI

• Efficient polynomial commitment schemes for multiple points and polynomials.

  IACR Cryptology ePrint Archive · 2020 · 20 citations

  1st authorCorresponding
  Publisher

Recent grants

• SaTC: CORE: Frontier: Collaborative: End-to-End Trustworthiness of Machine-Learning Systems

  NSF · $1.9M · 2018–2025

• Information Technology Research (ITR): Sensitive Infromation in a Wired World

  NSF · $6.8M · 2003–2012

• TWC: Medium: Collaborative Research: Computing on Cryptographic Data

  NSF · $400k · 2012–2017

Frequent coauthors

• Brent Waters

  29 shared

• Henry Corrigan-Gibbs

  Massachusetts Institute of Technology

  27 shared

• Xavier Boyen

  Queensland University of Technology

  24 shared

• Mark Zhandry

  22 shared

• David J. Wu

  18 shared

• Amit Sahai

  17 shared

• Florian Tramèr

  16 shared

• Elie Bursztein

  16 shared

Awards & honors

• 2014 ACM prize
• 2013 Godel prize
• 2011 Ishii award for industry education innovation
• Packard fellow
• Alfred P. Sloan fellow

Similar researchers at Stanford University

• David L. Clarkh-61
• Paul H. Wiseh-61
• Frederick R. Chenh-56