Diverging Keys in Wireless Sensor Networks

Ren, Michał; Das, Tanmoy Kanti; Jianying,

doi:10.1007/11836810_19

Cited by 14 publications

(3 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As in Ren et al [2006], the system initializes the nodes so that each pair of neighbour nodes establishes a key for this pair. Any method can be used: preloading with a common key, key infection, or a random predistribution scheme.…”

Section: Initializationmentioning

confidence: 99%

Mixing in Random Digraphs with Application to the Forward-Secure Key Evolution in Wireless Sensor Networks

Klonowski

Kutyłowski

Ren

et al. 2014

ACM Trans. Sen. Netw.

Self Cite

View full text Add to dashboard Cite

A key distribution scheme for wireless sensor networks based on a system of dynamic, pairwise keys is considered. In the scheme, each pair of communicating nodes shares pairwise symmetric keys and changes them at every transmission using a set of hashing functions. This article examines security aspects of the protocol. The most important issue is to ensure that it is infeasible for an adversary to restrict exhaustive key search to a subset of the keyspace. This desirable property holds if, after a small number of random key transitions, the distribution of keys among the nodes is close to uniform. The article provides a rigorous mathematical analysis of the distribution of keys and supplements it with experimental results. The problem is reduced to the question of determining mixing time and the stationary distribution of a random walk on a random digraph. It is shown that with probability close to 1, the mixing time is of small order and the fluctuations of the distribution are limited. This ensures the ongoing security of the protocol by making the communications forward secure and protecting against node compromise. ACM Reference Format:Marek Klonowski, Mirosław Kutyłowski, Michał Ren, and Katarzyna Rybarczyk. 2014. Mixing in random digraphs with application to the forward-secure key evolution in wireless sensor networks. ACM Trans.

show abstract

Section: Initializationmentioning

confidence: 99%

Mixing in Random Digraphs with Application to the Forward-Secure Key Evolution in Wireless Sensor Networks

Klonowski

Kutyłowski

Ren

et al. 2014

ACM Trans. Sen. Netw.

Self Cite

View full text Add to dashboard Cite

show abstract

“…The adversary that captures some keys in period t is not able to decrypt messages in period t + 1 (forward security) or t − 1 (backward security). In paper [6] a key evolution protocol with forward security has been proposed. Protocol from [21] offers both forward and backward security.…”

Section: Predistribution Schemesmentioning

confidence: 99%

Security problems of systems of extremely weak devices

Klonowski

2011

Annales UMCS, Informatica

View full text Add to dashboard Cite

In this paper we discuss some fundamental security issues of distributed systems of weak devices. We briefly describe two extreme kinds of such systems-the sensor network and theRadio Frequency IDentification (RFID) system from the point of view of security mechanisms designer. We describe some most important particularities and issues (including unsolved problems) that have to be taken into account in security design and analysis. Finally we present some fundamental concepts and paradigms of research on security of weak devices. In the paper we also give a brief survey of ultra-light HB/HB+-family of encryption schemes and so-called predistribution protocols.

show abstract

“…Their scheme also employs a one-way function F but, based on a key distribution mechanism in [11], incorporates an element of randomness. In their scheme, if nodes A and B share key k AB and A wants to send a message to B, then A encrypts the message using a key k ′ = F (k AB , i), where i is chosen uniformly at random from the set {0, 1, .…”

Section: Forward Security In Sensor Networkmentioning

confidence: 99%

Key Refreshing in Wireless Sensor Networks

Blackburn

Martin

Paterson

et al.

Lecture Notes in Computer Science

View full text Add to dashboard Cite

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.

show abstract

Diverging Keys in Wireless Sensor Networks

Cited by 14 publications

References 8 publications

Mixing in Random Digraphs with Application to the Forward-Secure Key Evolution in Wireless Sensor Networks

Mixing in Random Digraphs with Application to the Forward-Secure Key Evolution in Wireless Sensor Networks

Security problems of systems of extremely weak devices

Key Refreshing in Wireless Sensor Networks

Contact Info

Product

Resources

About