Secure Communication Trees in Ad Hoc Networks

In this paper we examine the communication trees widely used in ad hoc networks. These trees can be used in a number of ways e.g. to route or broadcast messages and to aggregate information. In this paper we propose a new key distribution protocol for large and dynamic ad hoc networks over unreliable channel. Protocol proposed here involves broadcast exclusion based on polynomial interpolation and secret key cryptography. Proposed scheme ensures security of broadcast and one-to-one communication, message authentication and gives a possibility to verify routing information. It also ensures t-resilience which means that up to t nodes can be compromised without influencing the security