SEAD: secure efficient distance vector routing for mobile wireless ad hoc networks
By Yih-Chun Hu, David B. Johnson, Adrian Perrig. Proceedings Fourth IEEE Workshop on Mobile Computing Systems and Applications, 2002
1,740 citations recorded by the source corpus.
Subfields: Computer Networks and Communications, Electrical and Electronic Engineering
View Paper: https://www.semanticscholar.org/paper/3ac035e3e846bc9f8a2b5546924fad60ea44114d
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computer Networks and Communications
- Jean-Pierre Hubaux
- Adrian Perrig
- Srdjan Čapkun
- Peng Ning
- Yih-Chun Hu
- Levente Buttyán
- David B. Johnson
- Jie Wu
In Electrical and Electronic Engineering
- Jean-Pierre Hubaux
- Srdjan Čapkun
- Adrian Perrig
- Levente Buttyán
- Radha Poovendran
- Yih-Chun Hu
- Jie Wu
- Loukas Lazos
Citations in the corpus
- Rushing attacks and defense in wireless ad hoc network routing protocols (2003, background): “Other secure routing protocols have been proposed based on periodic (proactive) mechanisms, for wired networks [8, 12, 13, 22, 26, 41, 42] as well as for wireless ad hoc networks [ 14 , 37].”
- A survey on peer-to-peer key management for mobile ad hoc networks (2007, methodology): “The focus of these protocols (Ariadne [Hu et al. 2002a], SEAD [Hu et al.”
- Using Directional Antennas to Prevent Wormhole Attacks (2004, background): “Constraints in memory, computing power, and battery power in mobile devices can impose trade-offs between security and resource consumption.”
- Secure routing for mobile ad hoc networks (2005, background): “Wormhole [21]: The wormhole attack is one of the most powerful presented here since it involves the cooperation between two malicious nodes that participate in the network.”
- A Survey of Attacks and Countermeasures in Mobile Ad Hoc Networks (2007, methodology): “The security protocol SEAD [ 11 ] is used here as an example of a defense against modification attacks.”
- Authenticated routing for ad hoc networks (2005, methodology): “based on DSDV [6] called SEAD [18], which is also based on”
- How to misuse AODV: a case study of insider attacks against mobile ad-hoc routing protocols (2003, background): “Hu, Perrig, and Johnson have proposed a sequence of secure MANET routing protocols, including Ariadne [4] and SEAD [5], as well as security mechanisms for routing protocols [27].”
- Security of the Internet of Things: perspectives and challenges (2014, background): “(1) Key broadcast distribution in the entire network [56–60]: The key is used to protect the security of station broadcasting information to all nodes.”
- Secure routing in wireless sensor networks: attacks and countermeasures (2003, background): “In the following sections we outline our assumptions about the underlying network, propose models for different classes of adversaries, and consider security goals in this setting.”
- Secure and efficient key management in mobile ad hoc networks (2005, background): “For example, SRP (Papadimitratos and Haas, 2002), SEAD (Hu et al., 2002), and SAODV (Zapata, 2002) address security attacks in routing protocols and propose different means to counter particular threats. However, almost all of them rely on the existence of a public-key management system. Even in TES”
- A survey of security issues in mobile ad hoc and sensor networks (2005, background): “Recently, several secure MANET routing protocols have been proposed [13] [14] [15] [16] [17] [18] [19] [20] [21] [22] [23].”
- Mobile ad hoc networking: imperatives and challenges (2003, background): “The basic idea is to authenticate the sequence number and the metric field of a routing table update message using oneway hash functions [120].”
- Securing ad hoc routing protocols (2004, background): “• Several works on secure routing where published by Perrig, Johnson, and Hu, including the Ariadne protocol [6], SEAD [5], TESLA Broadcast Authentication [25], and Packet Leashes [7].”
- Security and Cooperation in Wireless Networks (2007, background): “, SAODV [391] and SEAD [178]) use per hop hashing.”