A novel key distribution scheme against storage-bounded adversaries using attack probabilities

Authors : MOHAMMAD FARHADI BAJESTANI, ALI PAYANDEH

Pages : 1014-1021

View : 11 | Download : 10

Publication Date : 0000-00-00

Article Type : Research Paper

Abstract :Key establishment proves to be a challenging problem in wireless sensor networks. A key establishment scheme needs to incorporate properties like scalability and energy efficiency. We propose a scheme that, besides enjoying a desirable scalability, consumes resources according to attack probability within each region. In this scheme, the distribution area is divided into regions of varying attack probability. It is assumed that the adversary is storage bounded and that not all communications can be stored by the adversary. This scheme is highly resistant to node compromises and there is an extremely low probability of discovering the key by the adversary in the case of eavesdropping. The results of probabilistic analysis and simulation analysis suggest that the scheme provides desirable efficiency and that the level of energy consumed by the scheme remains constant, regardless of changes in the size of the network.
Keywords : Storage bounded model, key distribution, wireless sensor networks, attack probability