A matrix key-distribution scheme
Journal of Cryptology
Graph classes: a survey
The Combinatorics of Network Reliability
The Combinatorics of Network Reliability
Key Grids: A Protocol Family for Assigning Symmetric Keys
ICNP '06 Proceedings of the Proceedings of the 2006 IEEE International Conference on Network Protocols
Secret instantiation in ad-hoc networks
Computer Communications
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
A family of collusion resistant symmetric key protocols for authentication
ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
Poster: attribute based broadcast encryption with permanent revocation
Proceedings of the 18th ACM conference on Computer and communications security
| Hi-index | 0.00 |
Consider a communication network where each process needs to securely exchange messages with its neighboring processes. In this network, each sent message is encrypted using one or more symmetric keys that are shared only between two processes: the process that sends the message and the neighboring process that receives the message. A straightforward scheme for assigning symmetric keys to the different processes in such a network is to assign each process O(d) keys, where d is the maximum number of neighbors of any process in the network. In this paper, we present a more efficient scheme for assigning symmetric keys to the different processes in a communication network. This scheme, which is referred to as logarithmic keying, assigns O(log d) symmetric keys to each process in the network. We show that logarithmic keying can be used in rich classes of communication networks that include star networks, acyclic networks, limited- cycle networks, and planar networks.