Enhancing resilience of KPS using bidirectional hash chains and application on sensornet

Abstract

Key predistribution schemes (KPS) that establish symmetric secrets are best suited for resource constraint devices of low cost Internet of Things (IoT). Due to the large size of network and the limited memory, a given key is shared by a number of nodes (r). This sharing of key leads to deterioration of network resilience metric. Various works try to improve this scenario by use of hash function or otherwise. Two such prominent works are q-composite scheme by Chan et al. and hash chains scheme by Bechkit et al. Our work first introduces the concept of bidirectional hash functions, that can be viewed as an improvement of hash chain idea of Bechkit et al. Then we combine our bidirectional hash chains with a generic version of q-composite scheme and apply to a recent efficient scheme Sensornet of Dalai and Sarkar. Analysis with comparative study presents the result that how our scheme performs better than the hash chains, Sensornet and other base schemes.