TY - GEN
T1 - Framework design and performance analysis on pairwise key establishment
AU - Lee, Younho
AU - Park, Yongsu
PY - 2009
Y1 - 2009
N2 - Pairwise key establishment provides an effective way to build secure communication links among sensor nodes using cryptographic techniques. Up till now, researchers have devised numerous schemes that employ diverse cryptographic or combinatoric methods in order to provide high security, high connectivity and low storage overheads on the sensors. In this paper, we present a new framework on pairwise key establishment. We show that it can encompass most of the major previous schemes. Furthermore, we analyze the performance of the previous schemes using the proposed framework. When 100% connectivity is provided, under the same storage overhead on the sensor nodes, Blundo scheme and Blum scheme provide the highest security against intelligent adversaries while YG-L scheme is the best against random adversaries. When connectivity is under 100%, for random adversaries, location-aware schemes provide better security than non-location based schemes whereas for intelligent adversaries, all location based schemes' security is less than that of other schemes.
AB - Pairwise key establishment provides an effective way to build secure communication links among sensor nodes using cryptographic techniques. Up till now, researchers have devised numerous schemes that employ diverse cryptographic or combinatoric methods in order to provide high security, high connectivity and low storage overheads on the sensors. In this paper, we present a new framework on pairwise key establishment. We show that it can encompass most of the major previous schemes. Furthermore, we analyze the performance of the previous schemes using the proposed framework. When 100% connectivity is provided, under the same storage overhead on the sensor nodes, Blundo scheme and Blum scheme provide the highest security against intelligent adversaries while YG-L scheme is the best against random adversaries. When connectivity is under 100%, for random adversaries, location-aware schemes provide better security than non-location based schemes whereas for intelligent adversaries, all location based schemes' security is less than that of other schemes.
KW - Network security
KW - Secure communications
KW - Wireless sensor networks
UR - http://www.scopus.com/inward/record.url?scp=70350469259&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-04492-2_32
DO - 10.1007/978-3-642-04492-2_32
M3 - Conference contribution
AN - SCOPUS:70350469259
SN - 3642044913
SN - 9783642044915
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 311
EP - 320
BT - Management Enabling the Future Internet for Changing Business and New Computing Services - 12th Asia-Pacific Network Operations and Management Symposium, APNOMS 2009, Proceedings
T2 - 12th Asia-Pacific Network Operations and Management Symposium, APNOMS 2009
Y2 - 23 September 2009 through 25 September 2009
ER -