Key Refreshing in Wireless Sensor Networks

Authors:
Simon R. Blackburn;Keith M. Martin;Maura B. Paterson;Douglas R. Stinson
Affiliations:
Department of Mathematics, Royal Holloway, University of London, Egham, U.K. TW20 0EX;Department of Mathematics, Royal Holloway, University of London, Egham, U.K. TW20 0EX;Department of Mathematics, Royal Holloway, University of London, Egham, U.K. TW20 0EX;David R. Cheriton School of Computer Science, University of Waterloo, Waterloo, Canada N2L 3G1
Venue:
ICITS '08 Proceedings of the 3rd international conference on Information Theoretic Security
Year:
2008

Citing 10
Cited 1

A simple unpredictable pseudo random number generator

SIAM Journal on Computing
Time-optimal leader election in general networks

Journal of Parallel and Distributed Computing
An identity-based key-exchange protocol

EUROCRYPT '89 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
A key-management scheme for distributed sensor networks

Proceedings of the 9th ACM conference on Computer and communications security
A survey of key management schemes in wireless sensor networks

Computer Communications
On the Construction of Practical Key Predistribution Schemes for Distributed Sensor Networks Using Combinatorial Designs

ACM Transactions on Information and System Security (TISSEC)
An Application-Oriented Framework for Wireless Sensor Network Key Establishment

Electronic Notes in Theoretical Computer Science (ENTCS)
Forward-secure key evolution in wireless sensor networks

CANS'07 Proceedings of the 6th international conference on Cryptology and network security
Diverging keys in wireless sensor networks

ISC'06 Proceedings of the 9th international conference on Information Security
Forward secure communication in wireless sensor networks

SPC'06 Proceedings of the Third international conference on Security in Pervasive Computing

On the role of expander graphs in key predistribution schemes for wireless sensor networks

WEWoRC'11 Proceedings of the 4th Western European conference on Research in Cryptology

Quantified Score

Hi-index	0.00

Visualization

Abstract

The problem of establishing symmetric keys in wireless sensor networks has been extensively studied, but other aspects of key management have received comparatively little attention. In this paper we consider the problem of refreshing keys that are shared among several nodes in a WSN, in order to provide forward security. We discuss several applications that lead to sensor networks with very different properties, and we propose key refreshing schemes that are useful in each of these environments, together with resynchronisation methods that allow nodes possessing different versions of a key to arrive at a common version.