Steven M. Bellovin

(Redirected from Steven Bellovin)

Steven M. Bellovin is a researcher on computer networking and security who has been a professor in the computer science department at Columbia University[1] since 2005. Previously, Bellovin was a fellow at AT&T Labs Research in Florham Park, New Jersey.[2][3]

Steven M. Bellovin
Bellovin in 2016
Born
NationalityAmerican
Education
Alma materColumbia University
Known forUSENET; computer security; firewalls; cryptography
Scientific career
Doctoral advisorDavid Parnas

In September 2012, Bellovin was appointed chief technologist for the United States Federal Trade Commission, replacing Edward W. Felten, who returned to Princeton University.[4] He served in this position from September 2012 to August 2013.[5]

In February 2016, Bellovin became the first technology scholar for the Privacy and Civil Liberties Oversight Board.[6]

Career

edit

Bellovin received a BA degree from Columbia University,[7] and an MS and PhD in computer science from the University of North Carolina at Chapel Hill.

As a graduate student, Bellovin was one of the originators of USENET.[8] He later suggested that Gene Spafford should create the Phage mailing list as a response to the Morris Worm.[according to whom?]

Bellovin and Michael Merritt invented the encrypted key exchange password-authenticated key agreement methods. He[who?] was also responsible for the discovery that one-time pads were invented in 1882, not 1917, as previously believed.[9]

Bellovin has been active in the IETF. He was a member of the Internet Architecture Board from 1996–2002. Bellovin later was security area codirector, and a member of the Internet Engineering Steering Group (IESG) from 2002–2004. He identified some key security weaknesses in the Domain Name System; this and other weaknesses eventually led to the development of DNSSEC.

He received 2007 National Computer Systems Security Award by the National Institute of Standards and Technology (NIST) and the National Security Agency (NSA).[10] In 2001, he was elected as a member into the National Academy of Engineering for his contributions to network applications and security.[11]

In 2015, Bellovin was part of a team of proponents that included Matt Blaze, J. Alex Halderman, Nadia Heninger, and Andrea M. Matwyshyn who successfully proposed a security research exemption to Section 1201 of the Digital Millennium Copyright Act.[12]

Bellovin is an active NetBSD user and a NetBSD developer focusing on architectural, operational, and security issues.

He is a two-time recipient of the Usenix Lifetime Achievement Award. In 1995 he and two others received the award “for their work in creating USENET.”. In 2023, he and two others received the award “for a profound and lasting impact on Computer Science, Computer Security, Law, and Public Policy through their groundbreaking research, their influential publications, and their dedication to advancing knowledge that informs public policy.”.[8]

Selected publications

edit

Bellovin is the author and co-author of several books, RFCs and technical papers, including:

  • Firewalls and Internet Security: Repelling the Wily Hacker ISBN 0-201-63357-4 (with W. Cheswick) – one of the first books on internet security.
    • Firewalls and Internet Security: Repelling the Wily Hacker 2nd edition ISBN 0-201-63466-X (with Cheswick and Aviel D. Rubin)
  • Thinking Security: Stopping Next Year's Hackers (2015) ISBN 978-0134277547
  • RFC 1579 Firewall-Friendly FTP
  • RFC 1675 Security Concerns for IPng
  • RFC 1681 On Many Addresses per Host
  • RFC 1948 Defending Against Sequence Number Attacks
  • RFC 3514 The Security Flag in the IPv4 Header (April Fools' Day RFC)
  • RFC 3554 On the Use of Stream Control Transmission Protocol (SCTP) with IPsec (with J. Ioannidis, A. Keromytis, R. Stewart.)
  • RFC 3631 Security Mechanisms for the Internet (with J. Schiller, Ed., C. Kaufman)
  • RFC 4107 Guidelines for Cryptographic Key Management (with R. Housley)

As of October 21, 2020, his publications have been cited 19,578 times, and he has an h-index of 59.[13]

See also

edit

References

edit
edit