The Mason Test: A Defense Against Sybil Attacks in Wireless Networks Without Trusted Authorities

Liu, Yue; Bild, David R.; Dick, Robert P.; Mao, Zongqiang; Wallach, Dan S.

doi:10.1109/tmc.2015.2398425

Cited by 35 publications

(19 citation statements)

References 22 publications

(45 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…An alternative defense is to use measurements of communication latency or wireless signal strength to verify the uniqueness of IDs [26,38,53,91,140]. However, these techniques are sensitive to measurement accuracy.…”

Section: Distributed Hash Tablesmentioning

confidence: 99%

Resource Burning for Permissionless Systems (Invited Paper)

Gupta

Saia

Young

2020

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Proof-of-work puzzles and CAPTCHAS consume enormous amounts of energy and time. These techniques are examples of resource burning: verifiable consumption of resources solely to convey information.Can these costs be eliminated? It seems unlikely since resource burning shares similarities with "money burning" and "costly signaling", which are foundational to game theory, biology, and economics. Can these costs be reduced? Yes, research shows we can significantly lower the asymptotic costs of resource burning in many different settings.In this paper, we survey the literature on resource burning; take positions based on predictions of how the tool is likely to evolve; and propose several open problems targeted at the theoretical distributed-computing research community.

show abstract

Section: Distributed Hash Tablesmentioning

confidence: 99%

Resource Burning for Permissionless Systems (Invited Paper)

Gupta

Saia

Young

2020

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…However, this method does not detect when the attack node is close to the physical vehicle. The work in [36] adds multiple detection nodes to collect the RSSI of the vehicle to determine whether it is consistent with the beacon node. Feng, X. et al [37] used an event-based reputation system to defend against Sybil attacks.…”

Section: Related Workmentioning

confidence: 99%

Accurate Sybil Attack Detection Based on Fine-Grained Physical Channel Information

Wang

Zhu

Gong

et al. 2018

Sensors

View full text Add to dashboard Cite

With the development of the Internet-of-Things (IoT), wireless network security has more and more attention paid to it. The Sybil attack is one of the famous wireless attacks that can forge wireless devices to steal information from clients. These forged devices may constantly attack target access points to crush the wireless network. In this paper, we propose a novel Sybil attack detection based on Channel State Information (CSI). This detection algorithm can tell whether the static devices are Sybil attackers by combining a self-adaptive multiple signal classification algorithm with the Received Signal Strength Indicator (RSSI). Moreover, we develop a novel tracing scheme to cluster the channel characteristics of mobile devices and detect dynamic attackers that change their channel characteristics in an error area. Finally, we experiment on mobile and commercial WiFi devices. Our algorithm can effectively distinguish the Sybil devices. The experimental results show that our Sybil attack detection system achieves high accuracy for both static and dynamic scenarios. Therefore, combining the phase and similarity of channel features, the multi-dimensional analysis of CSI can effectively detect Sybil nodes and improve the security of wireless networks.

show abstract

“…For example, [24] provides an iterative trust management mechanism to fight against Byzantine attacks in which several nodes are totally controlled by the adversary. In [25], a defense against Sybil attacks [26] is introduced, which is based on the physical feature of the wireless propagation channel. A trust model in the scenario of underwater acoustic sensor networks is presented in [27] to take into account several trust metrics such as link trust, data trust, and node trust.…”

Section: Related Workmentioning

confidence: 99%

Distributed Faulty Node Detection in Delay Tolerant Networks: Design and Analysis

Galluccio

Bassi

et al. 2018

IEEE Trans. on Mobile Comput.

View full text Add to dashboard Cite

Propagation of faulty data is a critical issue. In case of Delay Tolerant Networks (DTN) in particular, the rare meeting events require that nodes are efficient in propagating only correct information. For that purpose, mechanisms to rapidly identify possible faulty nodes should be developed. Distributed faulty node detection has been addressed in the literature in the context of sensor and vehicular networks, but already proposed solutions suffer from long delays in identifying and isolating nodes producing faulty data. This is unsuitable to DTNs where nodes meet only rarely. This paper proposes a fully distributed and easily implementable approach to allow each DTN node to rapidly identify whether its sensors are producing faulty data. The dynamical behavior of the proposed algorithm is approximated by some continuous-time state equations, whose equilibrium is characterized. The presence of misbehaving nodes, trying to perturb the faulty node detection process, is also taken into account. Detection and false alarm rates are estimated by comparing both theoretical and simulation results. Numerical results assess the effectiveness of the proposed solution and can be used to give guidelines for the algorithm design.

show abstract

The Mason Test: A Defense Against Sybil Attacks in Wireless Networks Without Trusted Authorities

Cited by 35 publications

References 22 publications

Resource Burning for Permissionless Systems (Invited Paper)

Resource Burning for Permissionless Systems (Invited Paper)

Accurate Sybil Attack Detection Based on Fine-Grained Physical Channel Information

Distributed Faulty Node Detection in Delay Tolerant Networks: Design and Analysis

Contact Info

Product

Resources

About