Algorithms for Internet Security Services
Michael T. Goodrich - Johns Hopkins University
Mar 03, 2000
AbstractWe 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 SpeakerProf. 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.
The views, opinions and assumptions expressed in these videos are those of the presenter and do not necessarily reflect the official policy or position of CERIAS or Purdue University. All content included in these videos, are the property of Purdue University, the presenter and/or the presenter’s organization, and protected by U.S. and international copyright laws. The collection, arrangement and assembly of all content in these videos and on the hosting website exclusive property of Purdue University. You may not copy, reproduce, distribute, publish, display, perform, modify, create derivative works, transmit, or in any other way exploit any part of copyrighted material without permission from CERIAS, Purdue University.