Diverging keys in wireless sensor networks

  • Authors:
  • Michał Ren;Tanmoy Kanti Das; Jianying

  • Affiliations:
  • Adam Mickiewicz University, Poznań, Poland;Systems & Security Department, Institute for Infocomm Research, Singapore;Systems & Security Department, Institute for Infocomm Research, Singapore

  • Venue:
  • ISC'06 Proceedings of the 9th international conference on Information Security
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

Currently, the most popular ways of dealing with the key distribution problem in sensor networks are random predistribution schemes. For relaxed, realistic assumptions about the attacker, the key infection protocol [1] is also available. In this paper, by accepting the relaxed assumptions from [1], we propose a scheme which makes pairwise keys “drift” or diverge, which enhances security and can be used as a key distribution method. The most notable feature of this scheme is that, under some assumptions about the sensor nodes, it incurs no communication overhead at all.