Skip to Main content Skip to Navigation
Conference papers

Code Based KPD Scheme with Full Connectivity: Deterministic Merging

Abstract : Key PreDistribution (KPD) is one of the standard key management techniques of distributing the symmetric cryptographic keys among the resource constrained nodes of a Wireless Sensor Network (WSN). To optimize the security and energy in a WSN, the nodes must possess common key(s) between themselves. However there exists KPDs like the Reed Solomon (RS) code based schemes, which lacks this property. The current work proposes a deterministic method of overcoming this hazard by merging exactly two nodes of the said KPD to form blocks. The resultant merged block network is fully connected and comparative results exhibit the improvement achieved over existing schemes. Further analysis reveal that this concept can yield larger networks with small key rings.
Complete list of metadata

Cited literature [10 references]  Display  Hide  Download
Contributor : Hal Ifip Connect in order to contact the contributor
Submitted on : Wednesday, March 1, 2017 - 11:03:38 AM
Last modification on : Tuesday, August 13, 2019 - 10:36:04 AM
Long-term archiving on: : Tuesday, May 30, 2017 - 2:30:32 PM


Files produced by the author(s)


Distributed under a Creative Commons Attribution 4.0 International License



Pinaki Sarkar, Aritra Dhar. Code Based KPD Scheme with Full Connectivity: Deterministic Merging. 1st International Conference on Information and Communication Technology (ICT-EurAsia), Mar 2013, Yogyakarta, Indonesia. pp.141-151, ⟨10.1007/978-3-642-36818-9_15⟩. ⟨hal-01480168⟩



Record views


Files downloads