Secure group communications using key graphs
IEEE/ACM Transactions on Networking (TON)
Password authentication with insecure communication
Communications of the ACM
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
System architecture directions for networked sensors
ASPLOS IX Proceedings of the ninth international conference on Architectural support for programming languages and operating systems
SPINS: security protocols for sensor networks
Proceedings of the 7th annual international conference on Mobile computing and networking
A survey of key management for secure group communication
ACM Computing Surveys (CSUR)
LiSP: A lightweight security protocol for wireless sensor networks
ACM Transactions on Embedded Computing Systems (TECS)
The VersaKey framework: versatile group key management
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
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.