Securing Communication Trees in Sensor Networks

Secure Communication Trees in Ad Hoc Networks

“…Our approach utilize secret keys to ensure authentication and privacy in one-to-one and one-tomany communication while broadcast exclusion, based on polynomial interpolation, ensures secure way for network management and group key exchange. Similar to [7,8,23] nodes that miss rekeying messages (e.g. due to lossy links or network partitions) or join the network are able to get group key through local communication.…”

“…New secret key approach was recently presented by Dimitriou [8] who proposed an algorithm for establishing communication trees that ensure security and authentication. His proposal allows to change network structure, node addition and exclusion.…”

“…Dimitriou [8] proposed to use one-way key chain commitments to defend against such impersonation. Nevertheless his proposition increase immunity it cannot defend against an adversary who may jam communication so that some nodes miss some messages and thus commitments.…”

SMART: Secure Multi-pAths Routing for wireless sensor neTworks

“…Authors in [5] propose a protocol to secure tree construction, based on braodcast key to authenticate neighboring nodes. However, although this protocol is resilient to node replication attack, the protocol cannot protect the transmitted routing information from being altered or forged when an adversary compromise a node.…”

“…In the literature, some solutions [2][3][4][5] have been designed to build a reliable routing topology. Authors in [5] propose a protocol to secure tree construction, based on braodcast key to authenticate neighboring nodes.…”