Michael T. Goodrich  Home/Search
Context Related
| jhu.edu/~goodrich/cgc/pub...routing.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: jhu.edu/~goodrich/cgc/pub...index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We present several algorithms for network routing that are resilient to various attacks on the routers themselves. Our methods for securing routing algorithms are based on a novel "leapfrog " cryptographic signing protocol, which is more effcient than using traditional public-key signature schemes. 1 Introduction Routing messages in a network is an essential component of Internet communication, as each packet in the Internet must be passed quickly through each network (or autonomous system)... (Update)
Context of citations to this paper: More
...[44] DSR [30] and sev eral others. Many researchers focused on securing classes of (wired) routing protocols such as linkstate [25, 16, 61, 23] and distance vector [54] Oth ers addressed in detail the security issues of well known protocols such as OSPF [41] and BGP...
Cited by: More
Fatih: Detecting and Isolating Malicious Routers - Mizrak, Cheng, Marzullo, Savage (Correct)
Detecting Malicious Routers - Mizrak, Marzullo, Savage (2004) (Correct)
S-RIP: A Secure Distance Vector Routing Protocol - Wan, Kranakis, Van Oorschot (Correct)
Active bibliography (related documents): More All
0.4: Provably Secure Competitive Routing against Proactive.. - Awerbuch, Holmer, Rubens (2003) (Correct)
0.3: Sensor-Based Intrusion Detection for Intra-Domain.. - Mittal, Vigna (2002) (Correct)
0.3: JiNao: Design and Implementation of a Scalable.. - Wu, Chang, Jou.. (Correct)
Similar documents based on text: More All
0.1: Secure Traceroute to Detect Faulty or Malicious Routing - Padmanabhan, Simon (2002) (Correct)
0.1: Almost Optimal Hash Sequence Traversal - Coppersmith, Jakobsson (2002) (Correct)
0.1: Fast Randomized Parallel Methods for Planar Convex Hull.. - Mujtaba Ghouse (1991) (Correct)
Related documents from co-citation: More All
6: Ariadne: A secure on-demand routing protocol for ad hoc networks - Hu, Perrig et al. - 2002
5: An Efficient Message Authentication Scheme for Link State Routing - Cheung - 1997
5: Network Layer Protocols with Byzantine Robustness (context) - Perlman - 1988
BibTeX entry: (Update)
Michael T. Goodrich. Efficient and secure network routing algorithms. Provisional patent filing., January 2001. http://citeseer.ist.psu.edu/article/goodrich01efficient.html More
@misc{ goodrich01efficient,
author = "M. Goodrich",
title = "Efficient and secure network routing algorithms",
text = "Michael T. Goodrich. Efficient and secure network routing algorithms. Provisional
patent filing., January 2001.",
year = "2001",
url = "citeseer.ist.psu.edu/article/goodrich01efficient.html" }
Citations (may not include all citations):3972 Introduction to Algorithms (context) - Cormen, Leiserson et al. - 1990
276 Applied cryptography: protocols (context) - Schneier - 1994
90 Network Security: Private Communication in a Public World (context) - Kaufman, Perlman et al. - 1995
70 Securing distance-vector routing protocols - Smith, Murthy et al. - 1997
50 Reducing the cost of security in link-state routing - Hauser, Przygienda et al. - 1999
45 Digital signature protection of OSPF routing protocol - Murphy, Badger - 1996
36 Detecting disruptive routers: A distributed network monitori.. - Bradley, Cheung et al. - 1998
22 and Internetworking Protocols (context) - Perlman, Second et al. - 2000
19 Intrusion detection for link-state routing protocols - Wu, Wang et al. - 1997
9 An experimental study of insider attacks for the OSPF routin.. - Vetter, Wang et al. - 1997
8 cient protocols for signing routing messages (context) - Zhang - 1998
8 cient message authentication scheme for link state routing (context) - Cheung - 1997
3 Network Layer Protocol with Byzantine Agreement (context) - Perlman - 1988
1 RFC 2154: OSPF with digital signatures (context) - Murphy, Badger et al. - 1997
Documents on the same site (http://www.cs.jhu.edu/~goodrich/cgc/pubs/index.html): More
Efficient Approximation and Optimization Algorithms for.. - Duncan, Goodrich, al. (1997) (Correct)
Randomized Fully-Scalable BSP Techniques for Multi-Searching and .. - Goodrich (1997) (Correct)
Communication-Efficient Parallel Sorting - Goodrich (1996) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC