A Family of Efficient Key Predistribution Schemes for Pairwise Authentication

The growing need for ad hoc establishment of security associations (SA) in networks that may include resource constrained nodes has sparkled renewed interest in key predistribution schemes (KPS). KPSs which employ only inexpensive symmetric cryptographic primitives also support ID-based distribution of secrets to eliminate the need for dissemination of certificates or other public values. KPSs are however susceptible to collusions. The complexity associated with deployment and use of any KPS that can restrict collusions of very large number of nodes is influenced by several factors like bandwidth overheads, computational complexity, storage requirements, overheads for distributing secrets etc. We introduce a class of simple scalable KPSs with several compelling advantages over other KPSs in the literature.