R. Perlman. Network Layer Protocols with Byzantine Robustness. Technical Report, MIT LCS TR429, Massachusetts Institute of Technology, October 1988. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Robust Congestion Control for Multicast: - Challenges And Opportunities (2003) (Correct)
....network conditions, it is difficult to determine whether the rate of data reception from a route is fair. Furthermore, disjoint routes to the same receiver can have different fair rates. Due to the difficulties with detecting a misbehaving intermediary that forwards at a lower than fair rate [4] [11], an exciting research direction is a game theoretic approach to forming the distribution hierarchy. Hosts in such optimization framework can choose their own last hop as well as advertise their services for forwarding the data to other hosts. Instead of detecting an unfair reception rate, a ....
R. Perlman. Network Layer Protocols With Byzantine Robustness. PhD thesis, Laboratory for Computer Science, Massachusetts Institute of Technology, May 1988.
Provably Secure Competitive Routing against Proactive.. - Awerbuch, Holmer, Rubens (2003) (Correct)
.... for routing protocols was explored using digital signatures [41] or symmetric cryptography based methods: hash chains [25] chains of one time signatures [61] or HMAC [23] Intrusion detection is another topic that researchers focused on, for generic link state [60, 47] or OSPF [59] Perlman [45] designed the Network layer Protocol with Byzantine Robustness (NPBR) which addresses denial of service at the expense of flooding and digital signatures. The problem of byzan tine nodes that simply drop packets (black holes) in wired networks is explored in [17, 12] The approach in [17] is to ....
R.adia Perlman. Network Layer Protocols with Byzan- tine Robustness. PhD thesis, MIT LCS TR-429, Octo- ber 1988.
Using Link Cuts to Attack Internet Routing - Bellovin, Gansner (Correct)
....databases of several hundred nodes. We also suggest a number of work arounds, including one based on using intrusion detection systems to modify routing metrics. 1 Introduction traffic past an enemy controlled point for purposes of eavesdropping or connection hijacking [1] have long been known [2, 3]. In such attacks, an enemy advertises a false route. That is, some node claims to have a better (lower cost) route to a given destination. That will induce other nodes to send traffic for that destination to (or towards) the subverted node, where it can be captured by the enemy. The false ....
Radia Perlman, Network Layer Protocols with Byzantine Robustness, Ph.D. thesis, M.I.T., 1988.
Towards a Logic for Wide-Area Internet Routing - Feamster, Balakrishnan (2003) (8 citations) (Correct)
.... is an integral part of our routing logic rules for safety [21, 22, 23, 25] Additionally, previous work has proposed extensions or alternatives to contemporary wide area routing protocols that improve certain properties, such as scalability [7] the ability to withstand certain types of failures [34], and defense against malicious or incorrect route advertisements [26] Architectures involving route servers out of band from BGP itself have been proposed as solutions for policy oscillation and route hijacking [1, 18, 19] 6. Conclusion In this paper, we have presented a routing logic: a set ....
PERLMAN, R. Network Layer Protocols with Byzantine Robustness. PhD thesis, Massachusetts Institute of Technology, October 1988. MIT-LCS-TR-429. http://www.lcs.mit.edu/ publications/specpub.php?id=997.
Coping with False Accusations in Misbehavior Reputation.. - Buchegger, Le Boudec (2003) (4 citations) (Correct)
....by the reputation system entries and it can choose to consider the ratings of other nodes or to rely solely on its own observations. One node can have varying reputation records with other nodes across the network, and the subjective view of each node determines its actions. Byzantine robustness [16] in the sense of being able to tolerate a number of erratically behaving servers or in this case nodes is the goal of a reputation system in mobile ad hoc networks. Here, the detection of malicious nodes by means of the reputation systems has to be followed by a response in order to render these ....
Radia Perlman. Network layer protocols with byzantine robustness. PhD. Thesis Massachussetts Institute of Technology, 1988.
A Double Authentication Scheme To Detect Impersonation.. - Huang, Sinha, Medhi (2003) (Correct)
....(DA) Insider Attack, Impersonation Attack, Link State Routing. I. INTRODUCTION Present link state routing protocols are vulnerable to security attacks. There have been several attempts to address this issue. Perlman proposed a link state routing protocol that achieves Byzantine Robustness [10]. Her protocol is highly robust but has a high computational overhead associated with the publickey encryption. Open Shortest Path First (OSPF) 8] link state routing protocol has provision to provide links state routing Packet Authentication (PA) based on a shared key using a oneway hash function ....
R. Perlman, "Network Layer Protocols with Byzantine Robustness", MIT/LCS/TR-429, October 1988.
Robust Congestion Control for Multicast: Challenges and.. - Gorinsky, Jain, Vin (Correct)
....network conditions, it is difficult to determine whether the rate of data reception from a route is fair. Furthermore, disjoint routes to the same receiver can have different fair rates. Due to the difficulties with detecting a misbehaving intermediary that forwards at a lower than fair rate [4] [11], an exciting research direction is a game theoretic approach to forming the distribution hierarchy. Hosts in such optimization framework can choose their own last hop as well as advertise their services for forwarding the data to other hosts. Instead of detecting an unfair reception rate, a ....
R. Perlman. Network Layer Protocols With Byzantine Robustness. PhD thesis, Laboratory for Computer Science, Massachusetts Institute of Technology, May 1988.
The Effect of Rumor Spreading in Reputation Systems for.. - Buchegger, Le Boudec (2003) (6 citations) (Correct)
....by the reputation system entries and it can choose to consider the beliefs of other nodes or to rely solely on its own observations. One node can have varying reputation records with other nodes across the network, and the subjective view of each node determines its actions. Byzantine robustness [14] in the sense of being able to tolerate a number of erratically behaving servers or in this case nodes is the goal of a reputation system in mobile ad hoc networks. Here, the detection of misbehaved nodes by means of the reputation systems has to be followed by a response in order to render these ....
Radia Perlman. Network layer protocols with byzantine robustness. PhD. Thesis Massachussetts Institute of Technology, 1988.
Secure Traceroute to Detect Faulty or Malicious Routing - Padmanabhan, Simon (2002) (9 citations) (Correct)
....a more conventional denialof service attack against their intended targets in any event probably without ever needing to subvert the routing system. 8. RELATED WORK There have been several pieces of work on making Internet routing protocols robust against attacks by malicious entities. Perlman [9, 10] presents an approach for sabotageproof routing. The key idea is to use robust ooding to distribute link state packets (LSPs) and the public keys of all nodes throughout the network. Robust data routing is then accomplished by having end hosts construct digitally signed source routes using ....
R. Perlman. \Network Layer Protocols with Byzantine Robustness", Ph.D. Thesis, Department of Electrical Engineering and Computer Science, MIT, August 1988.
Detection and Recovery from the Oblivious Engineer Attack - Mulligan (2002) (1 citation) (Correct)
....types of attacks and one that destroys the routing infrastructure of the Internet could cause great damage. Secure BGP is based on BGP but uses a public key infrastructure to provide protection against impersonators and liars. The ideas are loosely based upon work previously done by Radia Perlman[6]. Every BGP speaker is given a public and private key so that it can sign messages, proving that it wrote the message. First, the keys are used to set up a secure the connections between BGP speakers with IPsec [4] using at least the authentication options if not also the encryption ones. Then the ....
R. Perlman. Network Layer Protocols with Byzantine Robustness. PhD thesis, MIT, Department of Electrical Engineering and Computer Science, 1988.
Secure Traceroute to Detect Faulty or Malicious Routing - Padmanabhan, Simon (2002) (9 citations) (Correct)
....more conventional denialof service attack against their intended targets in any event probably without ever needing to subvert the routing system. 8. RELATED WORK There have been several pieces of work on making Internet routing protocols robust against attacks by malicious enti ties. Periman [9, 10] presents an approach for sabotage proof routing. The key idea is to use robust flooding to distribute link state packets (LSPs) and the public keys of all nodes throughout the network. FI.obust data routing is then accomplished by having end hosts construct digitally signed source routes ....
R. Perlman. "Network Layer Protocols with Byzantine Robustness", Ph.D. Thesis, Department of Electrical Engineering and Computer Science, MIT, August 1988.
Feedback Based Routing - Zhu, Gritter, Cheriton (2002) (7 citations) (Correct)
....the same company. If the company les Chapter 7 bankruptcy, both AS s will go down. It is also possible that disjoint routes go through the same physical wire, or the same wiring closet. Our future research will try to address this problem. 5. RELATED WORK Previous work on byzantine robustness [16] addressed many of the same security problems we discuss in this paper. There are three major di erences between Perlman s proposal and ours. First we realized that the transit routers do not need to know about the network topology. This optimization makes the transit routers resource ....
R. Perlman. Network layer protocols with byzantine robustness. Technical Report 429, MIT Laboratory for Computer Science, 1988.
PGRIP: PNNI Global Routing Infrastructure Protection - Sabrina De Capitani (Correct)
No context found.
R. Perlman. Network Layer Protocols with Byzantine Robustness. Technical Report, MIT LCS TR429, Massachusetts Institute of Technology, October 1988.
Global Infrastructure Protection System - Sabrina De Capitani (Correct)
No context found.
R. Perlman. Network Layer Protocols with Byzantine Robustness. MIT LCS TR-429, Massachusetts Institute of Technology, October 1988.
Fatih: Detecting and Isolating Malicious Routers - Mizrak, Cheng, Marzullo, Savage (Correct)
No context found.
R. Perlman. Network Layer Protocols with Byzantine Robustness. PhD thesis, MIT LCS TR-429, Oct. 1988.
Analysis of BGP Prefix Origins During Google's May 2005 Outage - Tao Wan Paul (Correct)
No context found.
R. Perlman. Network Layer Protocols with Byzantine Robustness. Technical Report MIT/LCS/TR429, October 1988.
Fault-Tolerant Forwarding in the Face of Malicious Routers - Mizrak, Marzullo, Savage (Correct)
No context found.
Radia Perlman. Network Layer Protocols with Byzantine Robustness. PhD thesis, MIT LCS TR-429, October 1988.
Provably Secure Competitive Routing against Proactive.. - Awerbuch, Holmer, Rubens (2003) (Correct)
No context found.
Radia Perlman. Network Layer Protocols with Byzantine Robustness. PhD thesis, MIT LCS TR-429, October 1988.
Analysis of BGP Prefix Origins During Google's May 2005 Outage - Tao Wan Paul (Correct)
No context found.
R. Perlman. Network Layer Protocols with Byzantine Robustness. Technical Report MIT/LCS/TR429, October 1988.
Dynamics of Learning Algorithms for the On-Demand.. - Awerbuch.. (2005) (Correct)
No context found.
Perlman, R., Network Layer Protocols with Byzantine Robustness, MIT Thesis, August 1988.
Message Authentication by Integrity - With Public Corroboration (Correct)
No context found.
R. Perlman, Network Layer Protocols with Byzantine Robustness, MIT LCS TR-429, Oct. 1988.
Message Authentication by Integrity with Public Corroboration - van Oorschot (2005) (Correct)
No context found.
R. Perlman, Network Layer Protocols with Byzantine Robustness, MIT LCS TR-429, Oct. 1988.
Message Authentication by Integrity with Public Corroboration - van Oorschot (2005) (Correct)
No context found.
R. Perlman, Network Layer Protocols with Byzantine Robustness, MIT LCS TR-429, Oct. 1988.
S-RIP: A Secure Distance Vector Routing Protocol - Tao Wan Evangelos (Correct)
No context found.
R. Perlman. Network Layer Protocols with Byzantine Robustness. PhD thesis, MIT, 1988.
Byzantine Modification Detection in Multicast.. - Ho, Leong.. (2004) (Correct)
No context found.
R. Perlman, Network Layer Protocols with Byzantine Robustness, Ph.D. thesis, Massachusetts Institute of Technology, October 1988.
Fault-Tolerant Forwarding in the Face of Malicious Routers - Mizrak, Marzullo, Savage (2004) (Correct)
No context found.
Radia Perlman. Network Layer Protocols with Byzantine Robustness. PhD thesis, MIT LCS TR-429, October 1988.
Detecting Malicious Routers - Mizrak, Marzullo, Savage (2004) (Correct)
No context found.
Radia Perlman. Network Layer Protocols with Byzantine Robustness. PhD thesis, MIT LCS TR-429, October 1988.
Securing Routing in Open Networks Using Secure Traceroute - Mathur, Padmanabhan, Simon (2004) (Correct)
No context found.
R. Perlman. "Network Layer Protocols with Byzantine Robustness ", Ph.D. Thesis, Department of Electrical Engineering and Computer Science, MIT, August 1988.
Highly Secure and Efficient Routing - Ioannis Avramopoulos Hisashi (2004) (1 citation) (Correct)
No context found.
R. Perlman, Network Layer Protocols with Byzantine Robustness, Ph.D. thesis, Massachusetts Institute of Technology, Aug. 1988.
User-level Internet Path Diagnosis - Ratul Mahajan Neil (2003) (13 citations) (Correct)
No context found.
R. Perlman. Network Layer Protocols with Byzantine Robustness. PhD thesis, MIT, 1988.
S-RIP: A Secure Distance Vector Routing Protocol - Wan, Kranakis, Van Oorschot (Correct)
No context found.
R. Perlman. Network Layer Protocols with Byzantine Robustness. PhD thesis, Massachusetts Institute of Technology, August 1988.
ODSBR: An On-Demand Secure Byzantine Routing Protocol - Awerbuch, Curtmola.. (2003) (Correct)
No context found.
R. Perlman, Network Layer Protocols with Byzantine Robustness. PhD thesis, MIT LCS TR-429, October 1988.
S-RIP: A Secure Distance Vector Routing Protocol - Wan, Kranakis, van Oorschot (Correct)
No context found.
R. Perlman. Network Layer Protocols with Byzantine Robustness. PhD thesis, MIT, 1988.
Security Standards for the Global Information Grid - Gary Buda Booz (2001) (2 citations) (Correct)
No context found.
Perlman, R., Network Layer Protocols with Byzantine Robustness, Ph.D. Dissertation, MITLCS TR-429, 1988.
Secure Link State Routing Protocol: A Framework for Network .. - Huang, Sinha, Medhi (Correct)
No context found.
R. Perlman, "Network Layer Protocols With Byzantine Robustness, " MIT/LCS/TR-429, October, 1988.
A Framework for QoS-based Pouting in the Internet - Crawley, Nair, Rajagopalan.. (1998) (Correct)
No context found.
R. Perlman, "Network Layer Protocol with Byzantine Robustness", Ph.D. Thesis, Dept. of EE and CS, MIT, August, 1988.
A Robust Reputation System for Mobile Ad-hoc Networks - Buchegger, Le Boudec (2003) (4 citations) (Correct)
No context found.
Radia Perlman. Network layer protocols with byzantine robustness. PhD. Thesis Massachussetts Institute of Technology, 1988.
A Robust Reputation System for Mobile Ad-hoc Networks - Buchegger, Le Boudec (2003) (4 citations) (Correct)
No context found.
Radia Perlman. Network layer protocols with byzantine robustness. PhD. Thesis Massachussetts Institute of Technology, 1988.
Provably Secure Competitive Routing against Proactive.. - Awerbuch, Holmer, Rubens (2003) (Correct)
No context found.
Radia Perlman. Network Layer Protocols with Byzantine Robustness. PhD thesis, MIT LCS TR-429, October 1988.
User-level Internet Path Diagnosis - Ratul Mahajan Neil (2003) (13 citations) (Correct)
No context found.
R. Perlman. Network Layer Protocols with Byzantine Robustness. PhD thesis, MIT, 1988.
Efficient Policy-Based Routing In The Internet - Smith (2003) (Correct)
No context found.
R. Perlman. Network Layer Protocols with Byzantine Robustness. Report MIT/LCS/TR 429, Massachusetts Institute of Technology, October 1988.
Resisting Malicious Packet Dropping in Wireless Ad Hoc Networks - Just, Kranakis, Wan (2003) (Correct)
No context found.
R. Perlman. Network Layer Protocols with Byzantine Robustness. PhD thesis, Massachusetts Institute of Technology, August 1988.
Securing the Border Gateway Protocol: A Status Update - Kent (2003) (1 citation) (Correct)
No context found.
R. Perlman, "Network Layer Protocols With Byzantine Robustness," MIT/LCS/TR-429, October, 1988.
Network Working Group M. Steenstrup Request for Comments.. - Status Of This (Correct)
No context found.
Perlman, R., "Network Layer Protocols with Byzantine Robustness ", Ph.D. Thesis, Department of Electrical Engineering and Computer Science, MIT, August 1988.
Principled Assuredly Trustworthy Composable Architectures - Neumann (2004) (2 citations) (Correct)
No context found.
R. Perlman. Network Layer Protocols with Byzantine Robustness. PhD thesis, MIT, Cambridge, Massachusetts, 1988.
Highly Secure and Efficient Routing - Avramopoulos, Kobayashi, Wang, al. (2004) (1 citation) (Correct)
No context found.
R. Perlman, Network Layer Protocols with Byzantine Robustness,Ph.D. thesis, Massachusetts Institute of Technology, Aug. 1988.
Byzantine Modification Detection in Multicast.. - Ho, Leong.. (2004) (Correct)
No context found.
R. Perlman, Network Layer Protocols with Byzantine Robustness, Ph.D. thesis, Massachusetts Institute of Technology, October 1988.
User-level Internet Path Diagnosis - Ratul Mahajan Neil (2003) (13 citations) (Correct)
No context found.
R. Perlman. Network Layer Protocols with Byzantine Robustness. PhD thesis, MIT, 1988.
Highly Secure and Efficient Routing - Ioannis Avramopoulos Hisashi (2004) (1 citation) (Correct)
No context found.
R. Perlman, Network Layer Protocols with Byzantine Robustness, Ph.D. thesis, Massachusetts Institute of Technology, Aug. 1988.
Network Working Group S. Murphy Request for Comments: 2154 M. .. - Status Of This (Correct)
No context found.
Perlman, R., "Network Layer Protocols with Byzantine Robustness", Ph.D. Thesis, Department of Electrical Engineering and Computer Science, MIT, August 1988.
First 50 documents Next 50
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