Key establishment schemes against storage-bounded adversaries in wireless sensor networks

Authors:
Shi-Chun Tsai;Wen-Guey Tzeng;Kun-Yi Zhou
Affiliations:
Computer Science Department, National Chiao Tung University, Hsinchu, Taiwan;Computer Science Department, National Chiao Tung University, Hsinchu, Taiwan;Computer Science Department, National Chiao Tung University, Hsinchu, Taiwan
Venue:
IEEE Transactions on Wireless Communications
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
Conditionally-perfect secrecy and a provably-secure randomized cipher

Journal of Cryptology - Eurocrypt '90
A key-management scheme for distributed sensor networks

Proceedings of the 9th ACM conference on Computer and communications security
Unconditional Security Against Memory-Bounded Adversaries

CRYPTO '97 Proceedings of the 17th 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
A pairwise key pre-distribution scheme for wireless sensor networks

Proceedings of the 10th ACM conference on Computer and communications security
Establishing pairwise keys in distributed sensor networks

Proceedings of the 10th ACM conference on Computer and communications security
Probability and Computing: Randomized Algorithms and Probabilistic Analysis

Probability and Computing: Randomized Algorithms and Probabilistic Analysis
A new approach for random key pre-distribution in large-scale wireless sensor networks: Research Articles

Wireless Communications & Mobile Computing - Wireless Network Security

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper we re-examine the attacking scenario about wireless sensor networks. It is generally assumed that the adversary picks up all radio communications of sensor nodes without any loss and stores the eavesdropped messages for later use. We suggest that in some situations the adversary may not be able to pick up all radio communications of sensor nodes. Therefore, we propose the storage-bounded adversary model for wireless sensor networks, in which the adversary's storage is bounded. We propose two key establishment schemes for establishing shared keys for neighboring sensor nodes in the storage-bounded adversary model. The first scheme needs special beacon nodes for broadcasting random bits. In the second scheme, some sensor nodes play the role of beacon nodes. Our results are theoretical in some sense. Nevertheless, we can adjust them for realistic consideration.