Secure link state routing for mobile ad hoc networks

Papadimitratos, Panos; Haas, Zygmunt J.

doi:10.1109/saintw.2003.1210190

Cited by 514 publications

(434 citation statements)

References 19 publications

Supporting

Mentioning

432

Contrasting

Unclassified

Order By: Relevance

“…Several methods have been proposed for the distributed implementation of a CA [11,28,33]. Alternatively, methods based on symmetric keys can be used to protect critical messages [15,24,27].…”

Section: Network and Adversarial Modelsmentioning

confidence: 99%

Dealing with Liars: Misbehavior Identification via Rényi-Ulam Games

Kozma

Lazos

2009

Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering

View full text Add to dashboard Cite

Abstract. We address the problem of identifying misbehaving nodes that refuse to forward packets in wireless multi-hop networks. We map the process of locating the misbehaving nodes to the classic Rényi-Ulam game of 20 questions. Compared to previous methods, our mapping allows the evaluation of node behavior on a per-packet basis, without the need for energy-expensive overhearing techniques or intensive acknowledgment schemes. Furthermore, it copes with colluding adversaries that coordinate their behavioral patterns to avoid identification and frame honest nodes. We show via simulations that our algorithms reduce the communication overhead for identifying misbehaving nodes by at least one order of magnitude compared to other methods, while increasing the identification delay logarithmically with the path size.

show abstract

Section: Network and Adversarial Modelsmentioning

confidence: 99%

Dealing with Liars: Misbehavior Identification via Rényi-Ulam Games

Kozma

Lazos

2009

Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering

View full text Add to dashboard Cite

show abstract

“…Recent research studies have also brought up a new type of attack that goes under the name of wormhole attack [10,18,19,23,26]. In the latter, two compromised nodes create a tunnel (or wormhole) that is linked through a private connection and thus they manage to by-pass the network.…”

Section: Security Challenges In Mobile Ad-hoc Networkmentioning

confidence: 99%

“…Compromised nodes can easily perform integrity attacks by altering protocol fields in order to subvert traffic, denying communication to legitimate nodes and compromising the integrity of routing computations in general. Spoofing is a special case of integrity attacks whereby a compromised node impersonates a legitimate one due to the lack of authentication in the current ad hoc routing protocols [10,18,20].…”

Section: Security Challenges In Mobile Ad-hoc Networkmentioning

confidence: 99%

Multifold node authentication in mobile ad hoc networks

Komninos¹,

Vergados²,

Douligeris³

2007

Int J Communication

View full text Add to dashboard Cite

show abstract

“…An important usage of this approach is to secure routing. Usually, the security of routing in mobile ad hoc networks requires a rather heavy initialization phase, which can even include the pre-loading in nodes of secret keys shared with other nodes [16,15,23]. This is well suited for "closed" networks, but not for the case we consider here; in particular, it would prohibit the entry of new nodes once the network is already in operation.…”

Section: Introductionmentioning

confidence: 99%

Mobility helps security in ad hoc networks

Čapkun

Hubaux

Buttyán

2003

Proceedings of the 4th ACM International Symposium on Mobile Ad Hoc Networking &Amp; Computing

188

View full text Add to dashboard Cite

Contrary to the common belief that mobility makes security more difficult to achieve, we show that node mobility can, in fact, be useful to provide security in ad hoc networks. We propose a technique in which security associations between nodes are established, when they are in the vicinity of each other, by exchanging appropriate cryptographic material. We show that this technique is generic, by explaining its application to fully self-organized ad hoc networks and to ad hoc networks placed under an (off-line) authority. We also propose an extension of this basic mechanism, in which a security association can be established with the help of a "friend". We show that our mechanism can work in any network configuration and that the time necessary to set up the security associations is strongly influenced by several factors, including the size of the deployment area, the mobility patterns, and the number of friends; we provide a detailed investigation of this influence.

show abstract

Secure link state routing for mobile ad hoc networks

Abstract: Abstract

Cited by 514 publications

References 19 publications

Dealing with Liars: Misbehavior Identification via Rényi-Ulam Games

Dealing with Liars: Misbehavior Identification via Rényi-Ulam Games

Multifold node authentication in mobile ad hoc networks

Mobility helps security in ad hoc networks

Contact Info

Product

Resources

About