Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Logarithmic keying

Logarithmic keying Logarithmic Keying EHAB S. ELMALLAH University of Alberta MOHAMED G. GOUDA University of Texas at Austin and SANDEEP S. KULKARNI Michigan State University 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 ef cient 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 ef cient keying schemes for general bipartite networks http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png ACM Transactions on Autonomous and Adaptive Systems (TAAS) Association for Computing Machinery

Logarithmic keying

Download PDF
18 pages

Loading next page...
 
/lp/association-for-computing-machinery/logarithmic-keying-2C60Wu9OhM

References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
Association for Computing Machinery
Copyright
Copyright © 2008 by ACM Inc.
ISSN
1556-4665
DOI
10.1145/1452001.1452008
Publisher site
See Article on Publisher Site

Abstract

Logarithmic Keying EHAB S. ELMALLAH University of Alberta MOHAMED G. GOUDA University of Texas at Austin and SANDEEP S. KULKARNI Michigan State University 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 ef cient 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 ef cient keying schemes for general bipartite networks

Journal

ACM Transactions on Autonomous and Adaptive Systems (TAAS) – Association for Computing Machinery

Published: Nov 1, 2008

There are no references for this article.