Securing random key predistribution against semi-honest adversaries
Mike V. D. Burmester, Reihaneh Safavi–Naini, Gelareh Taban · 2009
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.