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.
This report presents a more efficient scheme for assigning symmetric keys to the different processes in a communication network. This scheme is referred to as logarithmic keying, which 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, dense bipartite networks.
If you are you interested in this seminar topic, mail to us to get the full report * of the seminar topic. Mail ID: - firstname.lastname@example.org * conditions apply
– OR –