Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Computer Networksarrow_drop_down
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
Computer Networks
Article . 2019 . Peer-reviewed
License: Elsevier TDM
Data sources: Crossref
DBLP
Article . 2019
Data sources: DBLP
versions View all 2 versions
addClaim

A class of key-node indexed hash chains based key predistribution (KPS): Signed weighted graphs

Authors: Pinaki Sarkar; Sukumar Nandi;

A class of key-node indexed hash chains based key predistribution (KPS): Signed weighted graphs

Abstract

Abstract Key management solutions are cornerstone requirements for any security service. Due to resource limitations, public key cryptographic (PKC) solutions are unsuitable for IoT devices like sensors of WSN. Consequently we opt for key predistribution schemes (KPS) to preload lightweight symmetric cryptographic keys and later establish them. KPS are designed over random and/or combinatorial graphs and requires several devices to share individual keys (conventionally r many). This causes a dip in the resultant system’s resilience. Cichon et al. [10] introduces a technique that involve recursive use of a one-way function to distinguish each key’s cycle and improve the given system’s resilience. Bechkit et al. [2,3] considers a cryptographic hash function to form their hash chains (KPS), i.e., HC(x) for a given KPS x. They construct hash chains according to node identifiers (ids) and consider modulo n , ( n ∈ Z + ) to reduce hash chains. This paper uses signed weighted graph (SWG) to conceal node ids in the key sharing graph of the underlying KPS x during short-lived key establishment phase (KEP). The concealment of information permits distinct indexing of each sensor according their position in the cycles of preloaded keys. Resultant system remains distributed with improved resilience and is independent of other parameters. In this way, a new class of KPS, named as key-node indexed hash chains (KPS), i.e., KNIHC(x) for the selected KPS x is proposed. It eliminates smart attack (SA). Moreover being fully connected (due to choice of underlying KPS), the proposed system supports mobility.

  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    2
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Average
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Average
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Average
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
2
Average
Average
Average
Upload OA version
Are you the author of this publication? Upload your Open Access version to Zenodo!
It’s fast and easy, just two clicks!