This paper contributes to the challenging field of security for wireless sensor networks by introducing a
keyagreement scheme in which sensor nodes create secure radio connections with their neighbours
depending on the aidof third parties. These third parties are responsible only for the pair-wise key
establishment among sensor nodes,so they do not observe the physical phenomenon nor route data packets
to other nodes. The proposed methodis explained here with respect to four important issues: how secret
shares are distributed, how local neighboursare discovered, how legitimate third parties are verified, and
how secure channels are established. Moreover, theperformance of the scheme is analyzed with regards to
five metrics: local connectivity, resistance to node capture,memory usage, communication overhead, and
computational burden.Our scheme not only secures the transmissionchannels of nodes but also guarantees
high local connectivity of the sensor network, low usage of memory resources,perfect network resilience
against node capture, and complete prevention against impersonation attacks. As it isdemonstrated in this
paper, using a number of third parties equals to 10% of the total number of sensor nodes inthe area of
interest, the proposed method can achieve at least 99.42% local connectivity with a very low usage
ofavailable storage resources (less than 385 bits on each sensor node).
%0 Journal Article
%1 noauthororeditor
%A Almowuena, Saleh
%D 2013
%J International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC)
%K Agreement Channel Establishment Key Network Party Secure Sensor Third Trust Wireless
%N 4
%P 15
%R 10.5121/ijasuc.2013.4401
%T An Efficient Key Agreement Scheme for Wireless sensor Networks Using Third Parties
%U https://aircconline.com/ijasuc/V4N4/4413ijasuc01.pdf
%V 4
%X This paper contributes to the challenging field of security for wireless sensor networks by introducing a
keyagreement scheme in which sensor nodes create secure radio connections with their neighbours
depending on the aidof third parties. These third parties are responsible only for the pair-wise key
establishment among sensor nodes,so they do not observe the physical phenomenon nor route data packets
to other nodes. The proposed methodis explained here with respect to four important issues: how secret
shares are distributed, how local neighboursare discovered, how legitimate third parties are verified, and
how secure channels are established. Moreover, theperformance of the scheme is analyzed with regards to
five metrics: local connectivity, resistance to node capture,memory usage, communication overhead, and
computational burden.Our scheme not only secures the transmissionchannels of nodes but also guarantees
high local connectivity of the sensor network, low usage of memory resources,perfect network resilience
against node capture, and complete prevention against impersonation attacks. As it isdemonstrated in this
paper, using a number of third parties equals to 10% of the total number of sensor nodes inthe area of
interest, the proposed method can achieve at least 99.42% local connectivity with a very low usage
ofavailable storage resources (less than 385 bits on each sensor node).
@article{noauthororeditor,
abstract = {This paper contributes to the challenging field of security for wireless sensor networks by introducing a
keyagreement scheme in which sensor nodes create secure radio connections with their neighbours
depending on the aidof third parties. These third parties are responsible only for the pair-wise key
establishment among sensor nodes,so they do not observe the physical phenomenon nor route data packets
to other nodes. The proposed methodis explained here with respect to four important issues: how secret
shares are distributed, how local neighboursare discovered, how legitimate third parties are verified, and
how secure channels are established. Moreover, theperformance of the scheme is analyzed with regards to
five metrics: local connectivity, resistance to node capture,memory usage, communication overhead, and
computational burden.Our scheme not only secures the transmissionchannels of nodes but also guarantees
high local connectivity of the sensor network, low usage of memory resources,perfect network resilience
against node capture, and complete prevention against impersonation attacks. As it isdemonstrated in this
paper, using a number of third parties equals to 10% of the total number of sensor nodes inthe area of
interest, the proposed method can achieve at least 99.42% local connectivity with a very low usage
ofavailable storage resources (less than 385 bits on each sensor node).
},
added-at = {2020-04-15T09:32:43.000+0200},
author = {Almowuena, Saleh},
biburl = {https://www.bibsonomy.org/bibtex/2435256c8053d08db012fb7cc6102d0ba/usmankhawaja},
doi = {10.5121/ijasuc.2013.4401},
interhash = {ac785a701d37b03d2054e04924cc1d38},
intrahash = {435256c8053d08db012fb7cc6102d0ba},
issn = {0976 - 1764},
journal = {International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC)},
keywords = {Agreement Channel Establishment Key Network Party Secure Sensor Third Trust Wireless},
language = {English},
month = {August},
number = 4,
pages = 15,
timestamp = {2020-04-15T09:32:43.000+0200},
title = {An Efficient Key Agreement Scheme for Wireless sensor Networks Using Third Parties},
url = {https://aircconline.com/ijasuc/V4N4/4413ijasuc01.pdf},
volume = 4,
year = 2013
}