The Sybil attack in sensor networks: analysis & defenses

@article{Newsome2004TheSA,
  title={The Sybil attack in sensor networks: analysis \& defenses},
  author={James Newsome and Elaine Shi and Dawn Xiaodong Song and Adrian Perrig},
  journal={Third International Symposium on Information Processing in Sensor Networks, 2004. IPSN 2004},
  year={2004},
  pages={259-268}
}
  • J. NewsomeE. Shi A. Perrig
  • Published 26 April 2004
  • Computer Science
  • Third International Symposium on Information Processing in Sensor Networks, 2004. IPSN 2004
Security is important for many sensor network applications. A particularly harmful attack against sensor and ad hoc networks is known as the Sybil attack based on J.R. Douceur (2002), where a node illegitimately claims multiple identities. This paper systematically analyzes the threat posed by the Sybil attack to wireless sensor networks. We demonstrate that the attack can be exceedingly detrimental to many important functions of the sensor network such as routing, resource allocation… 

Figures and Tables from this paper

Location Verification Based Defense Against Sybil Attack in Sensor Networks

This study proposes a location verification based defense against sybil attack for sensor network where it is assumed that the network is consisted of static sensor nodes and reports quantitatively about the probability of not being able to detect sybil attacked.

Sybil Attack Detection Scheme in Wireless Sensor Network

This paper presents a solution scheme for Sybil attack detection based on the Hop-Count-Ratio Localization (HCRL), the main idea is that the identities the Sybil nodes created have the same physical location, so theSybil nodes can be detected through the HCRL optimization algorithm.

Detecting the Sybil Attack Cooperatively in Wireless Sensor Networks

A new detection mechanism, called CRSD, is proposed for static wireless sensor networks, which takes use of the received signal strength to infer the distance between two identities and further determines the positions relation of the interesting identities by using of the RSS information from multiple neighbor nodes.

A Survey on Detection of Sybil Attack in Wireless Sensor Network

This paper analysis the existing detection schemes of Sybil attack in wireless networks, and the analysis and conclusion would be helpful in for obtaining a method that could detectSybil attack overcoming all the existing scheme’s limitations.

A review: Sybil attack detection techniques in WSN

  • S. T. PatelN. Mistry
  • Computer Science
    2017 4th International Conference on Electronics and Communication Systems (ICECS)
  • 2017
This paper aims to study, discuss and analyze the various techniques for detection of Sybil attack in Wireless Sensor Networks, and various protocols affected bySybil attack are studied and analyzed.

Defending Against Sybil Attacks in Sensor Networks using Pre-Distributed key

This paper proposes a novel protocol to defend against Sybil attack using pre-distributed keys and nodes id to authenticate each other and protect a node to take on multiple identities.

Sybil Attack in Wireless Sensor Networks: A Survey

This paper represents the various techniques that have been presented in the past for the detection and prevention of the Sybil attack.

Techniques to Alleviate Sybil Attack and Security Issues in Wireless Sensor Network

It is quite a difficult task to achieve security in a wireless sensor network because sensors have limited battery backup, dynamically changing topology, lack of central management and

Sybil attack detection in a hierarchical sensor network

  • Jian-Dong YinS. Madria
  • Computer Science
    2007 Third International Conference on Security and Privacy in Communications Networks and the Workshops - SecureComm 2007
  • 2007
A light-weight Sybil attack detection method based on a hierarchical architecture in sensor networks that can be used in a large scale sensor network, and it only uses the symmetric cryptography avoiding the use of the public key cryptography.

Security approaches for data aggregation in Wireless Sensor Networks against Sybil Attack

  • Surinder SinghH. Saini
  • Computer Science
    2018 Second International Conference on Inventive Communication and Computational Technologies (ICICCT)
  • 2018
A number of detection techniques to detect Sybil nodes have already designed to overcome the Sybil attack but few techniques which can improve the true detection rate and reduce false detection rate are discussed.
...

References

SHOWING 1-10 OF 22 REFERENCES

Secure routing in wireless sensor networks: attacks and countermeasures

  • Chris KarlofD. Wagner
  • Computer Science
    Proceedings of the First IEEE International Workshop on Sensor Network Protocols and Applications, 2003.
  • 2003
This work proposes security goals for routing in sensor networks, shows how attacks against ad-hoc and peer-to-peer networks can be adapted into powerful attacks against sensors, and introduces two classes of novel attacks against sensor networks sinkholes and HELLO floods.

Random key predistribution schemes for sensor networks

The random-pairwise keys scheme is presented, which perfectly preserves the secrecy of the rest of the network when any node is captured, and also enables node-to-node authentication and quorum-based revocation.

A key-management scheme for distributed sensor networks

A key-management scheme designed to satisfy both operational and security requirements of DSNs is presented, which relies on probabilistic key sharing among the nodes of a random graph and uses simple protocols for shared-key discovery and path-key establishment, and for key revocation, re-keying, and incremental addition of nodes.

A pairwise key pre-distribution scheme for wireless sensor networks

This paper proposes a new key pre-distribution scheme, which substantially improves the resilience of the network compared to the existing schemes, and exhibits a nice threshold property: when the number of compromised nodes is less than the threshold, the probability that any nodes other than these compromised nodes are affected is close to zero.

TAG: a Tiny AGgregation service for ad-hoc sensor networks

This work presents the Tiny AGgregation (TAG) service for aggregation in low-power, distributed, wireless environments, and discusses a variety of optimizations for improving the performance and fault tolerance of the basic solution.

Secure verification of location claims

The Echo protocol is extremely lightweight: it does not require time synchronization, cryptography, or very precise clocks, and it is believed that it is well suited for use in small, cheap, mobile devices.

GPSR: greedy perimeter stateless routing for wireless networks

Greedy Perimeter Stateless Routing is presented, a novel routing protocol for wireless datagram networks that uses the positions of routers and a packet's destination to make packet forwarding decisions and its scalability on densely deployed wireless networks is demonstrated.

SWATT: softWare-based attestation for embedded devices

This paper presents an implementation of SWATT in off-the-shelf sensor network devices, which enables us to verify the contents of the program memory even while the sensor node is running.

Distributed Sensor Networks

An Overview, S.S. Iyengar, Ankit Tandon, and R.R. Brooks Microsensor Applications, David Shepherd A Taxonomy of Distributed Sensor Networks, Shivakumar Sastry and S.S. Iyengar Contrast with

Routing with Guaranteed Delivery in Ad Hoc Wireless Networks

The first distributed algorithms for routing that do not require duplication of packets or memory at the nodes and yet guarantee that a packet is delivered to its destination are described.