An Authenticated Key Agreement Scheme for Wireless Sensor Networks
We propose a new authenticated key agreement scheme based on Blom’s scheme, but using multiple master keys and public keys in permutations to compute the private keys in each node. The computations are over a small prime field, and by storing them in a random order in the node, the private-public-ma...
Main Authors: | , , |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2014-07-01
|
Series: | Journal of Sensor and Actuator Networks |
Subjects: | |
Online Access: | http://www.mdpi.com/2224-2708/3/3/181 |
id |
doaj-d01aaa7f4f304483bdf5c22d96839a10 |
---|---|
record_format |
Article |
spelling |
doaj-d01aaa7f4f304483bdf5c22d96839a102020-11-25T01:05:12ZengMDPI AGJournal of Sensor and Actuator Networks2224-27082014-07-013318120610.3390/jsan3030181jsan3030181An Authenticated Key Agreement Scheme for Wireless Sensor NetworksMee Loong Yang0Adnan Al-Anbuky1William Liu2School of Computer and Mathematical Sciences, Auckland University of Technology, Auckland 1142, New ZealandSchool of Engineering, Auckland University of Technology, Auckland 1142, New ZealandSchool of Computer and Mathematical Sciences, Auckland University of Technology, Auckland 1142, New ZealandWe propose a new authenticated key agreement scheme based on Blom’s scheme, but using multiple master keys and public keys in permutations to compute the private keys in each node. The computations are over a small prime field, and by storing them in a random order in the node, the private-public-master-key associations (PPMka) of the private keys are lost. If a node is captured, the PPMka of the private keys cannot be determined with certainty, making it difficult to begin to attack the scheme. We obtained analytical results to show that, using suitable keying parameters, the probability of discovering the correct PPMka can be made so small, that a very powerful adversary needs to capture the entire network of tens of thousands of nodes or expend an infeasible amount of effort to try all of the possible solutions. We verified our results using computer-simulated attacks on the scheme. The unknown PPMka enables our scheme to break free from the capture threshold of the original Blom’s scheme, so that it can be used in large networks of low-resource devices, such as sensor nodes.http://www.mdpi.com/2224-2708/3/3/181key agreementBlomsecurityauthenticationad hocmobilesensorswireless sensor networks |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Mee Loong Yang Adnan Al-Anbuky William Liu |
spellingShingle |
Mee Loong Yang Adnan Al-Anbuky William Liu An Authenticated Key Agreement Scheme for Wireless Sensor Networks Journal of Sensor and Actuator Networks key agreement Blom security authentication ad hoc mobile sensors wireless sensor networks |
author_facet |
Mee Loong Yang Adnan Al-Anbuky William Liu |
author_sort |
Mee Loong Yang |
title |
An Authenticated Key Agreement Scheme for Wireless Sensor Networks |
title_short |
An Authenticated Key Agreement Scheme for Wireless Sensor Networks |
title_full |
An Authenticated Key Agreement Scheme for Wireless Sensor Networks |
title_fullStr |
An Authenticated Key Agreement Scheme for Wireless Sensor Networks |
title_full_unstemmed |
An Authenticated Key Agreement Scheme for Wireless Sensor Networks |
title_sort |
authenticated key agreement scheme for wireless sensor networks |
publisher |
MDPI AG |
series |
Journal of Sensor and Actuator Networks |
issn |
2224-2708 |
publishDate |
2014-07-01 |
description |
We propose a new authenticated key agreement scheme based on Blom’s scheme, but using multiple master keys and public keys in permutations to compute the private keys in each node. The computations are over a small prime field, and by storing them in a random order in the node, the private-public-master-key associations (PPMka) of the private keys are lost. If a node is captured, the PPMka of the private keys cannot be determined with certainty, making it difficult to begin to attack the scheme. We obtained analytical results to show that, using suitable keying parameters, the probability of discovering the correct PPMka can be made so small, that a very powerful adversary needs to capture the entire network of tens of thousands of nodes or expend an infeasible amount of effort to try all of the possible solutions. We verified our results using computer-simulated attacks on the scheme. The unknown PPMka enables our scheme to break free from the capture threshold of the original Blom’s scheme, so that it can be used in large networks of low-resource devices, such as sensor nodes. |
topic |
key agreement Blom security authentication ad hoc mobile sensors wireless sensor networks |
url |
http://www.mdpi.com/2224-2708/3/3/181 |
work_keys_str_mv |
AT meeloongyang anauthenticatedkeyagreementschemeforwirelesssensornetworks AT adnanalanbuky anauthenticatedkeyagreementschemeforwirelesssensornetworks AT williamliu anauthenticatedkeyagreementschemeforwirelesssensornetworks AT meeloongyang authenticatedkeyagreementschemeforwirelesssensornetworks AT adnanalanbuky authenticatedkeyagreementschemeforwirelesssensornetworks AT williamliu authenticatedkeyagreementschemeforwirelesssensornetworks |
_version_ |
1725195627147558912 |