ABSTRACT
In this chapter, the authors concentrate on key predistribution and session key distribution. For session key distribution, the authors analyze some insecure schemes, and then they present a secure scheme due to Bellare and Rogaway. The authors begin by briefly discussing the security model used in the study of unconditionally secure key predistribution scheme. For reasons of security, it is not advisable to use a single, common key throughout the network. Key predistribution schemes for wireless sensor network can be evaluated using certain metrics that measure the performance of the resulting networks. There is some validity checks required in the Needham-Schroeder SKDS, where the term validity check refers to verifying that decrypted data has the correct format and contains expected information. Bellare and Rogaway proposed an SKDS in 1995 and provided a proof of security for their scheme, under certain assumptions. Flexibility and efficiency of user revocation operations is an important consideration. Generally speaking, it is best to use rather “simple” images.
