ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Symmetric Key Approaches to Securing BGP --- A Little Bit Trust Is Enough
ESORICS '08 Proceedings of the 13th European Symposium on Research in Computer Security: Computer Security
FKM: a fingerprint-based key management protocol for SoC-based sensor networks
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
Logarithmic keying of communication networks
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
| Hi-index | 0.00 |
We describe a family of protocols for assigning symmetric keys to processes in a network so that each process can use itsassigned keys to communicate securely with every other process. The k-th protocol in our protocol family, where 1 驴 k 驴 logn, assigns O(k2 k驴n) symmetric keys to each process in the network. (Thus, our (log n)-th protocol assigns O(log2 n) symmetrickeys to each process. This is not far from the lower bound of O(log n) symmetric keys which we show is needed for each processto communicate securely with every other process in the network.) The protocols in our protocol family can be used to assignsymmetric keys to the processes in a sensor network, or ad-hoc or mobile network, where each process has a small memory tostore its assigned keys. We also discuss the vulnerability of our protocols to "collusion". In particular, we show that k驴ncolluding processes can compromise the security of the k-th protocol in our protocol family.