Sciweavers

Share
PERCOM
2006
ACM

A Collusion Attack on Pairwise Key Predistribution Schemes for Distributed Sensor Networks

10 years 10 months ago
A Collusion Attack on Pairwise Key Predistribution Schemes for Distributed Sensor Networks
Key predistribution schemes are a favoured solution for establishing secure communication in sensor networks. Often viewed as the safest way to bootstrap trust, the main drawback is seen to be the large storage overhead imposed on resource-constrained devices. In this paper, we argue that predistribution schemes can actually be quite insecure: pre-loading global secrets onto exposed devices strengthens the incentive for attackers to compromise nodes. Furthermore, lack of coordination between nodes arising from localised communication helps attackers hide misbehaviour. We consider one scheme in particular--Chan et al.'s random pairwise key predistribution [3]--and demonstrate an attack where colluding nodes reuse selected pairwise keys to create many false identities. We find that a small, colluding minority can hijack a majority of node communication channels. Finally, we consider countermeasures, from improved detection to scrapping predistribution altogether.
Tyler Moore
Added 24 Dec 2009
Updated 24 Dec 2009
Type Conference
Year 2006
Where PERCOM
Authors Tyler Moore
Comments (0)
books