Code Based KPD Scheme with Full Connectivity: Deterministic Merging - Information and Communication Technology Access content directly
Conference Papers Year : 2013

Code Based KPD Scheme with Full Connectivity: Deterministic Merging

Aritra Dhar
  • Function : Author
  • PersonId : 1003059

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.
Fichier principal
Vignette du fichier
978-3-642-36818-9_15_Chapter.pdf (346.4 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01480168 , version 1 (01-03-2017)

Licence

Attribution

Identifiers

Cite

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⟩
83 View
84 Download

Altmetric

Share

Gmail Facebook X LinkedIn More