Securing random key predistribution against semi-honest adversaries

Authors:
Mike Burmester;Reihaneh Safavi-Naini;Gelareh Taban
Affiliations:
Florida State University;University of Calgary;University of Maryland
Venue:
INSS'09 Proceedings of the 6th international conference on Networked sensing systems
Year:
2009

Citing 4
Cited 0

A key-management scheme for distributed sensor networks

Proceedings of the 9th ACM conference on Computer and communications security
A pairwise key pre-distribution scheme for wireless sensor networks

Proceedings of the 10th ACM conference on Computer and communications security
Establishing pairwise keys in distributed sensor networks

Proceedings of the 10th ACM conference on Computer and communications security
Establishing Pairwise Keys for Secure Communication in Ad Hoc Networks: A Probabilistic Approach

ICNP '03 Proceedings of the 11th IEEE International Conference on Network Protocols

Quantified Score

Hi-index	0.00

Visualization

Abstract

Recently, Eschenauer and Gligor [6] 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.