CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

Using Distance-Bounding Protocols to Securely Verify the Proximity of Two-Hop Neighbours

Elena Pagnin (Institutionen för data- och informationsteknik, Nätverk och system (Chalmers) ) ; G. Hancke ; Aikaterini Mitrokotsa (Institutionen för data- och informationsteknik, Nätverk och system (Chalmers) )
Ieee Communications Letters (1089-7798). Vol. 19 (2015), 7, p. 1173-1176.
[Artikel, refereegranskad vetenskaplig]

Distance-bounding protocols allow devices to cryptographically verify the physical proximity of two parties and is a prominent secure neighbour detection method. We describe how existing distance-bounding protocols could be modified to verify the proximity of both next-hop and two-hop neighbours. This approach allows a node to verify that another node is a physical next-hop neighbour, and also detects legitimate neighbours who make dishonest claims as to who their neighbours are. This approach could prevent dishonest neighbours from hoarding traffic as the result of advertising false two-hop routes.

Nyckelord: Wireless sensor network, distance-bounding, secure neighbour discovery, wormhole attack

Denna post skapades 2015-07-31.
CPL Pubid: 220083


Läs direkt!

Länk till annan sajt (kan kräva inloggning)

Institutioner (Chalmers)

Institutionen för data- och informationsteknik, Nätverk och system (Chalmers)



Chalmers infrastruktur

Relaterade publikationer

Denna publikation ingår i:

Authentication under Constraints