DocumentCode :
3421925
Title :
Securing random key predistribution against semi-honest adversaries
Author :
Burmester, Mike ; Safavi-Naini, Reihaneh ; Taban, Gelareh
Author_Institution :
Florida State Univ., Tallahassee, FL, USA
fYear :
2009
fDate :
17-19 June 2009
Firstpage :
1
Lastpage :
4
Abstract :
Recently, Eschenauer and Gligor proposed a model for random key predistribution in distributed sensor networks. In this paper we study the security of this model against a semi-honest adversary who compromises nodes, and present a key establishment algorithm that is provably secure. This is the first and only protocol that can guarantee security against semi-honest adversaries in an analytical framework.
Keywords :
cryptographic protocols; wireless sensor networks; distributed sensor networks; protocol; random key predistribution security; semi-honest adversaries; Access protocols; Base stations; Costs; Information security; Intrusion detection; Joining processes; Privacy; Protection; Public key cryptography; Wireless sensor networks;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Networked Sensing Systems (INSS), 2009 Sixth International Conference on
Conference_Location :
Pittsburgh, PA
Print_ISBN :
978-1-4244-6313-8
Electronic_ISBN :
978-1-4244-6314-5
Type :
conf
DOI :
10.1109/INSS.2009.5409937
Filename :
5409937
Link To Document :
بازگشت