Key Predistribution Schemes in Distributed Wireless Sensor Network using Combinatorial Designs Revisited

Anupam Pattanayak; B.  Majhi

Paper 2009/131

Key Predistribution Schemes in Distributed Wireless Sensor Network using Combinatorial Designs Revisited

Anupam Pattanayak and B. Majhi

Abstract

A Sensor Node in Wireless Sensor Network has very limited resources such as processing capability, memory capacity, battery power, and communication capability. When the communication between any two sensor nodes are required to be secured, the symmetric key cryptography technique is used for its advantage over public key cryptography in terms of requirement of less resources. Keys are pre-distributed to each sensor node from a set of keys called key pool before deployment of sensors nodes. Combinatorial design helps in a great way to determine the way keys are drawn from the key pool for distributing to individual sensor nodes. We study various deterministic key predistribution techniques that are based on combinatorial design.

Metadata

Available format(s): PDF
Publication info: Published elsewhere. Unknown where it was published
Keywords: key predistribution combinatorial design
Contact author(s): anupam pk @ gmail com
History: 2009-03-27: received
Short URL: https://ia.cr/2009/131
License: CC BY

BibTeX

@misc{cryptoeprint:2009/131,
      author = {Anupam Pattanayak and B.  Majhi},
      title = {Key Predistribution Schemes in Distributed Wireless Sensor Network using Combinatorial Designs Revisited},
      howpublished = {Cryptology {ePrint} Archive, Paper 2009/131},
      year = {2009},
      url = {https://eprint.iacr.org/2009/131}
}