Location-aware key management scheme for wireless sensor networks

TinyTate: Computing the Tate Pairing in Resource-Constrained Sensor Nodes

“…A considerable number of works (e.g., [3,41,10,50,5,51,31,29,42,8,17,21,19,4,30,9,39,40]) have focused on efficient key management of symmetric cryptosystems. Perrig et al [41] proposed SPINS, a suite of efficient symmetric key based security building blocks.…”

“…Perrig et al [41] proposed SPINS, a suite of efficient symmetric key based security building blocks. Eschenauer et al [10] looked at random key predistribution schemes, and originated a large number of follow-on studies [17]. And Zhu et al [50] proposed LEAP, a rather efficient scheme based on local distribution of secret keys among neighboring nodes.…”

Detecting Misused Keys in Wireless Sensor Networks

“…Many techniques have been proposed along this research direction, including the basic probabilistic scheme [7], the q-composite scheme [3], the random pairwise keys scheme [3], the two thresholdbased schemes [6,11] and PIKE [2]. Additionally, the prior deployment and post deployment knowledge were also used to improve the performance of key pre-distribution in various situations [5,10,12]. Our techniques in this paper address an important issue that hasn't been studied yet.…”

Using Auxiliary Sensors for Pairwise Key Establishment in WSN

“…However, these approaches either require expensive protocols (e.g., path key establishment) to setup keys or are vulnerable to a small number of compromised sensor nodes. In addition, some techniques also use the sensors' location information and assume static sensor nodes [7,8,11,10,9]. However, these two assumptions may not be true in practice.…”