Universe Detectors for Sybil Defense in Ad Hoc Wireless Networks

Simple item page
dc.creatorVora, Adnan
dc.creatorNesterenko, Mikhail
dc.creatorTixeuil, Sébastien
dc.creatorDelaët, Sylvie
dc.date2008-05-01
dc.date2008-05-13
dc.date.accessioned2026-07-07T13:05:27Z
dc.date.available2026-07-07T13:05:27Z
dc.descriptionThe 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 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.
dc.identifierhttps://arxiv.org/abs/0805.0087
dc.identifierhttp://arxiv.org/abs/0805.0087
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/227492
dc.subjectDistributed, Parallel, and Cluster Computing
dc.subjectCryptography and Security
dc.subjectNetworking and Internet Architecture
dc.titleUniverse Detectors for Sybil Defense in Ad Hoc Wireless Networks
dc.typetext

Files

Collections

arXiv