With reference to a network of agents equipped with small low-cost processing units and wireless short-range capabilities, we present a key distribution scheme that makes a trade-off between security and resource consumption through an efficient re-keying protocol. The proposed solution 1) guarantees secure group communication notwithstanding group membership changes: 2) guarantees an authentic distribution of keys that is efficient in terms of communication overhead; and 3) meets the reduced computational capabilities of embedded processing units by using only low-computation-overhead cryptographic primitives such as symmetric ciphers and one-way hash functions. The proposed protocol shows increased scalability, reduced power consumption, and results particularly attractive for highly dynamic groups.
Scalable and Secure Group Rekeying in Wireless Sensor Networks
DINI, GIANLUCA;SAVINO, IDA MARIA
2006-01-01
Abstract
With reference to a network of agents equipped with small low-cost processing units and wireless short-range capabilities, we present a key distribution scheme that makes a trade-off between security and resource consumption through an efficient re-keying protocol. The proposed solution 1) guarantees secure group communication notwithstanding group membership changes: 2) guarantees an authentic distribution of keys that is efficient in terms of communication overhead; and 3) meets the reduced computational capabilities of embedded processing units by using only low-computation-overhead cryptographic primitives such as symmetric ciphers and one-way hash functions. The proposed protocol shows increased scalability, reduced power consumption, and results particularly attractive for highly dynamic groups.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.