Securing random key predistribution against semi-honest adversaries

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 firs...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Burmester, M., Safavi-Naini, R., Taban, G.
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
DOI:10.1109/INSS.2009.5409937