Secure positioning in wireless networks

Čapkun, Srđjan; Hubaux, Jean-Pierre

doi:10.1109/jsac.2005.861380

Cited by 305 publications

(227 citation statements)

References 35 publications

Supporting

Mentioning

226

Contrasting

Order By: Relevance

“…Sastry et al [18] presented an early version of a protocol that verifies node locations and bases node identities on their location information. Similar ideas were also proposed by Waters and Felten [20], Bazzi and Konjevod [2] andČapkun and Hubaux [4,5]. In the most general form, these works are based on measuring the delays incurred by communications between nodes and imposing a geometric structure on the "distance space" to determine node locations.…”

Section: Existing Workmentioning

confidence: 93%

Detecting Sybil Nodes in Static and Dynamic Networks

Cardenas-Haro

Konjevod

2010

On the Move to Meaningful Internet Systems, OTM 2010

View full text Add to dashboard Cite

Peer-to-peer systems are known to be vulnerable to the Sybil attack. The lack of a central authority allows a malicious user to create many fake identities (called Sybil nodes) pretending to be independent honest nodes. The goal of the malicious user is to influence the system on his/her behalf. In order to detect the Sybil nodes and prevent the attack, a reputation system is used for the nodes, built through observing its interactions with its peers. The construction makes every node a part of a distributed authority that keeps records on the reputation and behavior of the nodes. Records of interactions between nodes are broadcast by the interacting nodes and honest reporting proves to be a Nash Equilibrium for correct (non-Sybil) nodes.In this research is argued that in realistic communication schedule scenarios, simple graph-theoretic queries such as the computation of Strongly Connected Components and Densest Subgraphs, help in exposing those nodes most likely to be Sybil, which are then proved to be Sybil or not through a direct test executed by some peers.

show abstract

Section: Existing Workmentioning

confidence: 93%

Detecting Sybil Nodes in Static and Dynamic Networks

Cardenas-Haro

Konjevod

2010

On the Move to Meaningful Internet Systems, OTM 2010

View full text Add to dashboard Cite

show abstract

“…This will increase the performance of DDM Z since the CA coverage area is protected by RA nodes. Selecting RA nodes according to their location requires a secure localization algorithm [7]. To avoid running such algorithm, directional antenna is used by the CA where the CA's zone is divided into 6 sectors [12].…”

Section: A Ra Election Modelmentioning

confidence: 99%

A Secure Mechanism Design-Based and Game Theoretical Model for MANETs

Rachedi

Benslimane²,

Otrok³

et al. 2009

Mobile Netw Appl

View full text Add to dashboard Cite

., resource consumption). In this paper, we propose a model based on mechanism design that will allow clusters with single trusted node (CA) to be created. Our mechanism will motivate nodes that do not belong to the confident community to participate by giving them incentives in the form of trust, which can be used for cluster's services. To achieve this goal, a RA selection algorithm is proposed that selects nodes based on a predefined selection criteria function and location (i.e., using directional antenna). Such a model is known as moderate. Based on the security risk, more RA nodes must be added to formalize a robust DDMZ. Here, we consider the tradeoff between security and resource consumption by formulating the problem as a nonzero-sum noncooperative game between the CA and attacker. Finally, empirical results are provided to support our solutions.Index Terms-MANET security, mechanism design, certificate authority and clustering.

show abstract

“…A number of applications requires ranging to be both precise and secure. Secure and precise localization [1], used e.g., for robot fleet navigation, is one example. Physical access control is another: As an example, consider a system for unlocking a car door with a wireless-enabled key that combines two modes of operation in a single physical layer: The door is unlocked if: (1) the key is in communication range of the car (tens of meters) and the user presses the "unlock" button, or (2) the car determines that the key is in proximity of 1-2 meters (conveniently located in the drivers pocket), not requiring the "unlock" button to be pressed (like in Passive Keyless Entry and Start (PKES) systems used in some modern cars).…”

Section: Introductionmentioning

confidence: 99%

“…RELATED WORK Distance bounding was first proposed by Brands and Chaum in [4]. A number of other DB protocols are proposed, addressing aspects such as distance bounding over noisy channels [9], mutual ranging [1], [10], resilience to the terrorist fraud [11], [12], [13], efficiency [14], privacy [15], and formal verification [16], [17]. Most of these proposals ignore PHY issues.…”

Section: Introductionmentioning

confidence: 99%

On Secure and Precise IR-UWB Ranging

Poturalski

Flury

Papadimitratos

et al. 2012

IEEE Trans. Wireless Commun.

View full text Add to dashboard Cite

Abstract-To provide high ranging precision in multipath environments, a ranging protocol should find the first arriving path, rather than the strongest path. We demonstrate a new attack vector that disrupts such precise Time-of-Arrival (ToA) estimation, and allows an adversary to decrease the measured distance by a value in the order of the channel spread (10-20 meters). This attack vector can be used in previously reported physicalcommunication-layer (PHY) attacks against secure ranging (or distance bounding). Furthermore, it creates a new type of attack based on malicious interference: This attack is much easier to mount than the previously known external PHY attack (distancedecreasing relay) and it can work even if secret preamble codes are used.We evaluate the effectiveness of this attack for a PHY that is particularly well suited for precise ranging in multipath environments: Impulse Radio Ultra-Wideband (IR-UWB). We show, with PHY simulations and experiments, that the attack is effective against a variety of receivers and modulation schemes. Furthermore, we identify and evaluate three types of countermeasures that allow for precise and secure ranging.

show abstract

Secure positioning in wireless networks

Cited by 305 publications

References 35 publications

Detecting Sybil Nodes in Static and Dynamic Networks

Detecting Sybil Nodes in Static and Dynamic Networks

A Secure Mechanism Design-Based and Game Theoretical Model for MANETs

On Secure and Precise IR-UWB Ranging

Contact Info

Product

Resources

About