Thwarting The Sybil Attack in Wireless Ad Hoc Networks

Wireless ad hoc networking is a technology that allows fast, easy, and inexpensive network deployment. Unfortunately, these advantages also make the task of an attacker simpler, as it is also becomes easier to deploy a malicious node in the environment. To make the ad hoc network secure, one has often to rely on Byzantine fault-tolerance techniques, which typically rely on quorum based security protocols. However, quorums may be easily defeated if a single adversary can participate in the network with multiple identities, a behavior known as the Sybil Attack. This thesis addresses the problem of preventing the Sybil Attack in wireless ad hoc networks. In particular, it is proposed an algorithm that allows the correct nodes in an one-hop neighborhood to have a common set of non-Sybil identities. This algorithm is based on the combination of several types of resource tests, which were developed from a comparative analysis of the previous work in the literature. Palavras Chave Keywords