Global Security, Safety and Sustainability & e-Democracy. 7th International and 4th e-Democracy, Joint Conferences, ICGS3/e-Democracy 2011, Thessaloniki, Greece, August 24-26, 2011, Revised Selected Papers

Research Article

A Probabilistic Key Agreement Scheme for Sensor Networks without Key Predistribution

Download61 downloads
  • @INPROCEEDINGS{10.1007/978-3-642-33448-1_11,
        author={Vasiliki Liagkou and Effie Makri and Paul Spirakis and Yannis Stamatiou},
        title={A Probabilistic Key Agreement Scheme for Sensor Networks without Key Predistribution},
        proceedings={Global Security, Safety and Sustainability \& e-Democracy. 7th International and 4th e-Democracy, Joint Conferences, ICGS3/e-Democracy 2011, Thessaloniki, Greece, August 24-26, 2011, Revised Selected Papers},
        proceedings_a={ICGS3 \& E-DEMOCRACY},
        year={2012},
        month={10},
        keywords={Key agreement key predistribution mobile ad-hoc networks},
        doi={10.1007/978-3-642-33448-1_11}
    }
    
  • Vasiliki Liagkou
    Effie Makri
    Paul Spirakis
    Yannis Stamatiou
    Year: 2012
    A Probabilistic Key Agreement Scheme for Sensor Networks without Key Predistribution
    ICGS3 & E-DEMOCRACY
    Springer
    DOI: 10.1007/978-3-642-33448-1_11
Vasiliki Liagkou, Effie Makri1, Paul Spirakis, Yannis Stamatiou,*
  • 1: University of the Aegean
*Contact email: istamat@uoi.gr

Abstract

The dynamic establishment of shared information (e.g. secret key) between two entities is particularly important in networks with no pre-determined structure such as wireless sensor networks (and in general wireless mobile ad-hoc networks). In such networks, nodes establish and terminate communication sessions dynamically with other nodes which may have never been encountered before, in order to somehow exchange information which will enable them to subsequently communicate in a secure manner. In this paper we give and theoretically analyze a series of protocols that enables two entities that have never encountered each other before to establish a shared piece of information for use as a key in setting up a secure communication session with the aid of a shared key encryption algorithm. These protocols do not require previous pre-distribution of candidate keys or some other piece of information of specialized form except a small seed value, from which the two entities can produce arbitrarily long strings with many similarities.