Algorithms for Internet Security Services

Page Content

Michael T. Goodrich

Michael T. Goodrich - Johns Hopkins University

Mar 03, 2000

Abstract

We give a general survey-style talk about Internet Algorithmics and some of the security issues faced by Internet computations. We focus specifically on network routing algorithms that are the basis for current Internet routing protocols and we show how many of these algorithms can be made more secure. In particular, we review some previous algorithms and also present new methods for performing broadcasts and point-to-point shortest-path routing so as to be protected against attacks from any constant number of compromised routers in a network.

About the Speaker

Prof. Goodrich's research is directed at the design of high performance algorithms and data structures for solving large-scale geometric and combinatoric problems motivated from applications involving the Internet, astronomy, computer graphics, information visualization, and scientific data analysis. He is also interested in computer science education.

Unless otherwise noted, the security seminar is held on Wednesdays at 4:30P.M. STEW G52, West Lafayette Campus. More information...

© 1999-2013 Purdue University. All rights reserved.

Use/Reuse Guidelines

CERIAS Seminar materials are intended for educational, non-commercial use only and any or all commercial use is prohibited. Any use must attribute "The CERIAS Seminar at Purdue University." Opinions expressed in the recordings are not necessarily representative of the views of CERIAS or of Purdue University.