A Key Distribution Scheme for Mobile Wireless Sensor Networks: $q$ - $s$ -Composite

Gandino, Filippo; Ferrero, Renato; Rebaudengo, Maurizio

doi:10.1109/tifs.2016.2601061

Cited by 64 publications

(27 citation statements)

References 33 publications

(32 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…According to r = 6 the configuration of EG that guarantees the best resilience is p = 18, while in redundant SBIBD p = 31. By using the formula of resilience for EG presented in [20] it is possible to compare these schemes. The comparison is shown in Figure 5.…”

Section: Experimental Analysismentioning

confidence: 99%

Redundancy in Key Management for WSNs

Gandino¹,

Montrucchio²,

Rebaudengo³

2018

Cryptography

Self Cite

View full text Add to dashboard Cite

Security in wireless sensor networks is commonly based on symmetric encryption and requires key-management systems to establish and exchange secret keys. A constraint that is common to many key-management approaches is an upper bound to the total number of nodes in the network. An example is represented by the schemes based on combinatorial design. These schemes use specific rules for the generation of sets of keys that are distributed to the nodes before deploying the network. The aim of these approaches is to improve the resilience of the network. However, the quantity of data that must be stored by each node is proportional to the number of nodes of the network, so the available memory affects the applicability of these schemes. This paper investigates the opportunity of reducing the storage overhead by distributing the same set of keys to more than one node. In addition, the presence of redundant sets of keys affects the resilience and the security of the network. A careful analysis is conducted to evaluate benefits and drawbacks of redundant key distribution approaches. The results show that the use of redundancy decreases the level of resilience, but it scales well on very large networks.

show abstract

Section: Experimental Analysismentioning

confidence: 99%

Redundancy in Key Management for WSNs

Gandino¹,

Montrucchio²,

Rebaudengo³

2018

Cryptography

Self Cite

View full text Add to dashboard Cite

show abstract

“…The size of the key pool, key connectivity, and key ring size play a very important role in deciding the performance of this scheme. A deployment‐based schemes was given in Du et al in which prior deployment information is utilized to distribute the keys among the sensor nodes by Du et al A q‐s composite scheme is discussed in Gandino et al to improve the security of KMS. Choi et al uses grid‐based location to design KMS.…”

Section: Background Studymentioning

confidence: 99%

“…The value of l is taken from the set. [2][3][4][5][6][7][8][9][10] The key connectivity is taken from set [0.3,0.5]. It decreases with increase in number of captured nodes.…”

Section: Resilience Against Node Capturementioning

confidence: 99%

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

“…In [24], the authors propose q-s-Composite, a further evolution of EG and q-composite. In this scheme there are a minimum (q) and a maximum (s) quantity of initial keys used to establishment a pairwise key.…”

Section: Random Key Distributionmentioning

confidence: 99%

“…A new organization of the storage allows to increase the quantity of initial keys per node with the same memory overhead. According to the analysis proposed in [24], q is set to 1 and s to 5. In the following, the q-s-Composite is called 1-5C.…”

Section: Random Key Distributionmentioning

confidence: 99%

A Key Management Scheme for Mobile Wireless Sensor Networks

2017

Self Cite

View full text Add to dashboard Cite

Symmetric encryption is the most commonly employed security solution in wireless sensor networks (WSNs). In this paper, a new approach that employs public-key cryptography during key establishment is proposed. In a WSN, the main issue for public-key cryptography is represented by communication and computational overheads. In order to reduce these requirements, a new authentication system based on authentication tables is proposed. An analytical study shows that the proposed approach provided optimal protection against an adversary that compromised one or more nodes. A comparative analysis shows that, according to the dimension and the density of the network, the proposed approach can represent the best solution. Furthermore, an experimental analysis conducted on a real network shows that the proposed approach can be successfully applied to devices with limited computational power.

show abstract

A Key Distribution Scheme for Mobile Wireless Sensor Networks: $q$ - $s$ -Composite

Cited by 64 publications

References 33 publications

Redundancy in Key Management for WSNs

Redundancy in Key Management for WSNs

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

A Key Management Scheme for Mobile Wireless Sensor Networks

Contact Info

Product

Resources

About