Framework design and performance analysis on pairwise key establishment

Authors:
Younho Lee;Yongsu Park
Affiliations:
Dept. of Information and Communication Engineering, Yeungnam Univ., Korea;College of Information and Communications, Hanyang Univ., Korea
Venue:
APNOMS'09 Proceedings of the 12th Asia-Pacific network operations and management conference on Management enabling the future internet for changing business and new computing services
Year:
2009

Citing 9
Cited 0

An optimal class of symmetric key generation systems

Proc. of the EUROCRYPT 84 workshop on Advances in cryptology: theory and application of cryptographic techniques
A key-management scheme for distributed sensor networks

Proceedings of the 9th ACM conference on Computer and communications security
Perfectly-Secure Key Distribution for Dynamic Conferences

CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
Random Key Predistribution Schemes for Sensor Networks

SP '03 Proceedings of the 2003 IEEE Symposium on Security and Privacy
Establishing pairwise keys in distributed sensor networks

Proceedings of the 10th ACM conference on Computer and communications security
Location-based pairwise key establishments for static sensor networks

Proceedings of the 1st ACM workshop on Security of ad hoc and sensor networks
A key pre-distribution scheme for secure sensor networks using probability density function of node deployment

Proceedings of the 3rd ACM workshop on Security of ad hoc and sensor networks
A Key Predistribution Scheme for Sensor Networks Using Deployment Knowledge

IEEE Transactions on Dependable and Secure Computing
Hierarchical grid-based pairwise key predistribution scheme for wireless sensor networks

EWSN'06 Proceedings of the Third European conference on Wireless Sensor Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.