Universe Detectors for Sybil Defense in Ad Hoc Wireless Networks

Vora, Adnan; Nesterenko, Mikhail; Tixeuil, Sébastien; Delaët, Sylvie

doi:10.1007/978-3-540-89335-6_8

Cited by 5 publications

(2 citation statements)

References 28 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In such an attack, a faulty process is able to use an arbitrary identifier while a correct process cannot determine whether two messages were sent by the same process or by different processes. A Sybil attack is difficult to handle [4], [23]. However, Detector and Explorer can be modified to handle neighborhood discovery with known ports.…”

Section: Discovering Neighborsmentioning

confidence: 99%

Discovering Network Topology in the Presence of Byzantine Faults

Nesterenko

Tixeuil

2009

IEEE Trans. Parallel Distrib. Syst.

View full text Add to dashboard Cite

We pose and study the problem of Byzantine-robust topology discovery in an arbitrary asynchronous network. The problem is an abstraction of fault-tolerant routing. We formally state the weak and strong versions of the problem. The weak version requires that either each node discovers the topology of the network or at least one node detects the presence of a faulty node. The strong version requires that each node discovers the topology regardless of faults. We focus on noncryptographic solutions to these problems. We explore their bounds. We prove that the weak topology discovery problem is solvable only if the connectivity of the network exceeds the number of faults in the system. Similarly, we show that the strong version of the problem is solvable only if the network connectivity is more than twice the number of faults. We present solutions to both versions of the problem. The presented algorithms match the established graph connectivity bounds. The algorithms do not require the individual nodes to know either the diameter or the size of the network. The message complexity of both programs is low polynomial with respect to the network size. We describe how our solutions can be extended to add the property of termination, handle topology changes, and perform neighborhood discovery.

show abstract

Section: Discovering Neighborsmentioning

confidence: 99%

Discovering Network Topology in the Presence of Byzantine Faults

Nesterenko

Tixeuil

2009

IEEE Trans. Parallel Distrib. Syst.

View full text Add to dashboard Cite

show abstract

“…Indeed, if one is to assume the existence of such centralized entity, defending against the Sybil attack is straightforward [20,2,26]. However, for that no such an authority exists in a decentralized and fully distributed system-in most deployment scenarios, the centralized solution for the problem is costly and unrealistic.…”

Section: Introductionmentioning

confidence: 99%

Mistaking friends for foes

Mohaisen

Abuhmed

Kang

et al. 2011

Proceedings of the 5th International Conference on Ubiquitous Information Management and Communication

View full text Add to dashboard Cite

The Sybil attack is very challenging in the context of distributed systems; Sybil nodes with multiple identities try to deviate the behavior of the overall system from normal behavior. Recently, there have been a lot of interests in social-network based Sybil defenses weighing the trust in social networks to detect Sybil nodes. Such defenses use some algorithmic properties relating to the topological structure of the social networks. However, the use of those properties without validating them in realistic settings makes their applicability impossible in the real-world applications.In this paper, we discuss such inapplicability by analyzing MobID, a recently proposed defense for mobile environments which claims that existing defenses have largely been designed for peer-to-peer networks. MobID uses the betweenness, a graph-theoretic property in the social graph, as a metric of the goodness of nodes in order to defend against the Sybil attacks. By using this betweeness, MobID operates on two fundamental assumptions: i) highly enmeshed nodes in the social graphs have a nonzero betweenness, and ii) verifiers and suspects in an honest social graph have common friends. However, extensive experiments and detailed analysis with real-world social network traces show that these assumptions do not hold well. Accordingly, MobID does not work for a great portion of the network, which is in some cases greater than 50% of the network size, even when not using a threshold on the betweenness. By setting a very low, highly-precise threshold of the betweenness (e.g., less than 10 −4 ), we observe a dramatic loss in the performance of MobID, which corresponds to 8% − 30% overall acceptance rates of honest nodes (and the remaining nodes are rejected). On the other hand, we observe that existing work, as well as other recently proposed work that is based on the Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee.

show abstract

Universe Detectors for Sybil Defense in Ad Hoc Wireless Networks

Vora

Nesterenko

Tixeuil

et al. 2008

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

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 SAN D -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.

show abstract

Universe Detectors for Sybil Defense in Ad Hoc Wireless Networks

Cited by 5 publications

References 28 publications

Discovering Network Topology in the Presence of Byzantine Faults

Discovering Network Topology in the Presence of Byzantine Faults

Mistaking friends for foes

Universe Detectors for Sybil Defense in Ad Hoc Wireless Networks

Contact Info

Product

Resources

About