A game based model of security for key predistribution schemes in wireless sensor network

Many random key predistribution schemes have been proposed for pairwise key establishment in sensor networks recently. A general model of security under which these key predistribution techniques can be formally analyzed for correctness is required. In this paper, we have made such an attempt. We use the well known computational model of probabilistic turn based 2 1/2-player games to model the key predistri bution schemes and have shown how this model can be translated in formally specifying a property that these schemes should have. To the best of our knowledge this is the first work where we show the significance of probabilistic turn based 2 1/2-player games in modelling security requirement of key predistribution schemes.