2D Hash Chain robust Random Key Distribution scheme

Ehdaie, Mohammad; Alexiou, Nikos; Ahmadian, M.; Aref, Mohammad Reza; Papadimitratos, Panos

doi:10.1016/j.ipl.2015.12.006

Cited by 13 publications

(9 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A large pool of keys is generated of size |P|. We extend the pool by applying 2 hash function h and h ′ which are commutative in nature . The root of the hash chain is the original keys of the pool.…”

Section: The Proposed Cost‐effective Attack Matrix‐based Key Managemementioning

confidence: 99%

“…This material is further used for other types of attack in network. Resilience against node capture is the resistance of key management schemes under adversarial attacks in WSN . Consider 2 nodes X and Y are secured by a pair‐wise key

h^{max true(i_{x} i_{y true)}} ((), k_{0})

.…”

Section: Analysis Of Proposed Scheme With Existing Approachesmentioning

confidence: 99%

“…The improvement in resilience becomes (1‐2 q ) over the basic q‐composite scheme. This ultimately reduces the number of links compromised during a node capture . Hence, the security of the network gets increased.…”

Section: Analysis Of Proposed Scheme With Existing Approachesmentioning

confidence: 99%

“…We extend the pool by applying 2 hash function h and h′ which are commutative in nature. 12 The root of the hash chain is the original keys of the pool. The element in ith row and jth column is computed by applying hash functions h and h′ on the root key, i − 1 times and j − 1 times, respectively.…”

Section: Hash Chain Key Distribution Of the Proposed Schemementioning

confidence: 99%

“…Each node is assigned m key chains randomly and select 1 element from each chain with equal probability. 12 Let us suppose that node X and Y wants to establish pair-wise key. Assume that each owns a key from the same key chain.…”

Section: B) Key Predistribution and Pair-wise Key Establishmentmentioning

confidence: 99%

See 4 more Smart Citations

A cost‐effective attack matrix based key management scheme with dominance key set for wireless sensor network security

Ahlawat

2018

Int J Communication

View full text Add to dashboard Cite

Summary To guarantee the proper functionality of wireless sensor network even in the presence of the potential threats, a well‐designed key management scheme is very important. The assumptions about attackers critically influence the performance of security mechanisms. This paper investigates the problem of node capture from adversarial view point in which the adversary intelligently exploits the different vulnerabilities of the network to establish a cost‐effective attack matrix. To counteract such attacks, the defender or the network designer constructs similar attack matrix. The defender will identify a set of critical nodes and use the key compromise relationship to assign a key dominance rank to each node of the network. The key dominance rank quantifies the possibility of attack on a particular node. It is used to determine the hash chain length. It is also used to improve the security of path key establishment as well as rekeying of the proposed scheme. The performance of the proposed scheme is analyzed with other existing schemes, and it is shown that it outperforms with increased resilience against node capture, reduced number of hash computations, reduced key compromise probability of proxy nodes, and reduced number of revoked links during rekeying process.

show abstract

Section: The Proposed Cost‐effective Attack Matrix‐based Key Managemementioning

confidence: 99%