logarithmic keying of communication networks

[seminarsonly]

Sometimes in some communication networks,a process needs to securely exchange messages with its neighboring processes. In this case, one or more symmetric keys are utilised to encrypt each mnessage. These symmetric keys are are shared only between two processes:- The reciever process that recieves the message and the sender process that semds the message. Assigning assign each process a seperate key O(d) is a way, where d is the maximum number of neighbors of any process in the communication network under cconsideration. a more efficient scheme for symmetric key assigning to the different processes in a communication network is discussed in this article. It is referred to as logarithmic keying and it assigns O(logd) symmetric keys to each process in the network. A rich classes of communication networks can take advantage of logarithmic keying. The star networks, acyclic networks, limited- cycle networks, and planar networks are all included in this .

For more details, visit:
[attachment=4160]
http://springerlinkcontent/qp71n31511637221/

a similar topic:
http://mediafire?4enn48b35jnd7rw