Unreliable failure detectors for reliable distributed systems
Journal of the ACM (JACM)
The weakest failure detector for solving consensus
Journal of the ACM (JACM)
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
Wireless Communications: Principles and Practice
Wireless Communications: Principles and Practice
Denial of Service in Sensor Networks
Computer
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Secure verification of location claims
WiSe '03 Proceedings of the 2nd ACM workshop on Wireless security
Poster abstract: LEAP—efficient security mechanisms for large-scale distributed sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
The sybil attack in sensor networks: analysis & defenses
Proceedings of the 3rd international symposium on Information processing in sensor networks
Security support for in-network processing in Wireless Sensor Networks
Proceedings of the 1st ACM workshop on Security of ad hoc and sensor networks
Impact of radio irregularity on wireless sensor networks
Proceedings of the 2nd international conference on Mobile systems, applications, and services
Distributed Detection of Node Replication Attacks in Sensor Networks
SP '05 Proceedings of the 2005 IEEE Symposium on Security and Privacy
Toward resilient security in wireless sensor networks
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Defending against Sybil Attacks in Sensor Networks
ICDCSW '05 Proceedings of the Second International Workshop on Security in Distributed Computing Systems (SDCS) (ICDCSW'05) - Volume 02
Sybilproof reputation mechanisms
Proceedings of the 2005 ACM SIGCOMM workshop on Economics of peer-to-peer systems
An RSSI-based Scheme for Sybil Attack Detection in Wireless Sensor Networks
WOWMOM '06 Proceedings of the 2006 International Symposium on on World of Wireless, Mobile and Multimedia Networks
ROPE: robust position estimation in wireless sensor networks
IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
Secure Location Verification Using Radio Broadcast
IEEE Transactions on Dependable and Secure Computing
Self-certified Sybil-free pseudonyms
WiSec '08 Proceedings of the first ACM conference on Wireless network security
Deterministic Secure Positioning in Wireless Sensor Networks
DCOSS '08 Proceedings of the 4th IEEE international conference on Distributed Computing in Sensor Systems
Discovering network topology in the presence of byzantine faults
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Designing secure sensor networks
IEEE Wireless Communications
Secure positioning in wireless networks
IEEE Journal on Selected Areas in Communications
On trust models and trust evaluation metrics for ad hoc networks
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
The Sybil attack in unknown port networks such as wireless is not considered tractable. A wireless node is not capable of independently differentiating the universe of real nodes from the universe of arbitrary non-existent fictitious nodes created by the attacker. Similar to failure detectors, we propose to use universe detectors to help nodes determine which universe is real. In this paper, we (i) define several variants of the neighborhood discovery problem under Sybil attack (ii) propose a set of matching universe detectors (iii) demonstrate the necessity of additional topological constraints for the problems to be solvable: node density and communication range; (iv) present $\cal SAND$ -- an algorithm that solves these problems with the help of appropriate universe detectors, this solution demonstrates that the proposed universe detectors are the weakest detectors possible for each problem.