An optimal class of symmetric key generation systems
Proc. of the EUROCRYPT 84 workshop on Advances in cryptology: theory and application of cryptographic techniques
A matrix key-distribution scheme
Journal of Cryptology
On Some Methods for Unconditionally Secure Key Distributionand Broadcast Encryption
Designs, Codes and Cryptography - Special issue: selected areas in cryptography I
The quest for security in mobile ad hoc networks
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
The Combinatorics of Network Reliability
The Combinatorics of Network Reliability
SPINS: security protocols for sensor networks
Wireless Networks
A key-management scheme for distributed sensor networks
Proceedings of the 9th ACM conference on Computer and communications security
On the design of security protocols for mobile communications
ACISP '96 Proceedings of the First Australasian Conference on Information Security and Privacy
Key Distribution Protocol for Digital Mobile Communication Systems
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Perfectly-Secure Key Distribution for Dynamic Conferences
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
A Family of Collusion Resistant Protocols for Instantiating Security
ICNP '05 Proceedings of the 13TH IEEE International Conference on Network Protocols
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
Security in mobile ad hoc networks: challenges and solutions
IEEE Wireless Communications
Communication in key distribution schemes
IEEE Transactions on Information Theory
Parameterized Complexity
| 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 article, 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, planar networks, and dense bipartite networks. In addition, we present a construction that utilizes efficient keying schemes for general bipartite networks to construct efficient keying schemes for general networks.