Loading...
Search for: random-keys
0.005 seconds

    Key splitting for random key distribution schemes

    , Article Proceedings - International Conference on Network Protocols, ICNP ; 2012 ; 10921648 (ISSN) ; 9781467324472 (ISBN) Ehdaie, M ; Alexiou, N ; Ahmadian, M ; Aref, M. R ; Papadimitratos, P ; Sharif University of Technology
    2012
    Abstract
    A large number of Wireless Sensor Network (WSN) security schemes have been proposed in the literature, relying primarily on symmetric key cryptography. To enable those, Random Key pre-Distribution (RKD) systems have been widely accepted. However, WSN nodes are vulnerable to physical compromise. Capturing one or more nodes operating with RKD would give the adversary keys to compromise communication of other benign nodes. Thus the challenge is to enhance resilience of WSN to node capture, while maintaining the flexibility and low-cost features of RKD. We address this problem, without any special-purpose hardware, proposing a new and simple idea: key splitting. Our scheme does not increase... 

    Key splitting: Making random key distribution schemes resistant against node capture

    , Article Security and Communication Networks ; Volume 8, Issue 3 , 2015 , Pages 431-445 ; 19390114 (ISSN) Ehdaie, M ; Alexiou, N ; Ahmadian Attari, M ; Aref, M. R ; Papadimitratos, P ; Sharif University of Technology
    John Wiley and Sons Inc  2015
    Abstract
    A large number of random key pre-distribution (RKD) schemes have been proposed in the literature to secure wireless sensor network applications, relying on symmetric key cryptography. However, sensor nodes are exposed to physical compromise by adversaries, who target the symmetric keys stored at each node. With the stolen keys in their possession, the adversaries are then able to compromise communication links between benign nodes. Here, the big challenge arises: how to increase resilience of RKD schemes for wireless sensor networks to node capture, while maintaining the flexibility and low-cost features of RKD? We propose the idea of key splitting to address this problem, without the need... 

    2D Hash Chain robust Random Key Distribution scheme

    , Article Information Processing Letters ; Volume 116, Issue 5 , 2016 , Pages 367-372 ; 00200190 (ISSN) Ehdaie, M ; Alexiou, N ; Ahmadian, M ; Aref, M. R ; Papadimitratos, P ; Sharif University of Technology
    Elsevier  2016
    Abstract
    Many Random Key Distribution (RKD) schemes have been proposed in the literature to enable security applications in Wireless Sensor Networks (WSNs). A main security aspect of RKD schemes is their resistance against node capture attacks, since compromising the sensors and capturing their keys is a common risk in such networks. We propose a new method, based on a 2-Dimensional Hash Chain (2DHC), that can be applied on any RKD scheme to improve their resilience. Our method maintains the flexibility and low cost features of RKD schemes and it doesn't require any special-purpose hardware or extra memory to store keys in the sensors. We demonstrate that our approach significantly increases the...