{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:35:06Z","timestamp":1750307706813,"version":"3.41.0"},"reference-count":17,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2008,11,1]],"date-time":"2008-11-01T00:00:00Z","timestamp":1225497600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["0520250CCR-0092724"],"award-info":[{"award-number":["0520250CCR-0092724"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["OGP 36899"],"award-info":[{"award-number":["OGP 36899"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Auton. Adapt. Syst."],"published-print":{"date-parts":[[2008,11]]},"abstract":"<jats:p>\n            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\n            <jats:italic>O<\/jats:italic>\n            (\n            <jats:italic>d<\/jats:italic>\n            ) keys, where\n            <jats:italic>d<\/jats:italic>\n            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\n            <jats:italic>O<\/jats:italic>\n            (log\n            <jats:italic>d<\/jats:italic>\n            ) 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.\n          <\/jats:p>","DOI":"10.1145\/1452001.1452008","type":"journal-article","created":{"date-parts":[[2008,12,10]],"date-time":"2008-12-10T15:32:31Z","timestamp":1228923151000},"page":"1-18","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Logarithmic keying"],"prefix":"10.1145","volume":"3","author":[{"given":"Ehab S.","family":"Elmallah","sequence":"first","affiliation":[{"name":"University of Alberta, Edomonton, Canada"}]},{"given":"Mohamed G.","family":"Gouda","sequence":"additional","affiliation":[{"name":"University of Texas at Austin, Austin, TX"}]},{"given":"Sandeep S.","family":"Kulkarni","sequence":"additional","affiliation":[{"name":"Michigan State University, East Lansing, MI"}]}],"member":"320","published-online":{"date-parts":[[2008,12,12]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICNP.2006.320211"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.481774"},{"key":"e_1_2_1_3_1","series-title":"Lecture Notes in Computer Science","volume-title":"An optimal class of symmetric key generation systems","author":"Blom R.","unstructured":"Blom , R. 1985. An optimal class of symmetric key generation systems . Lecture Notes in Computer Science , vol. 209 . Springer , Berlin, Germany , 335--338. Blom, R. 1985. An optimal class of symmetric key generation systems. Lecture Notes in Computer Science, vol. 209. Springer, Berlin, Germany, 335--338."},{"key":"e_1_2_1_4_1","volume-title":"Proceedings of the 12th Annual International Conference on Cryptology (CRYPTO). Lecture Notes in Computer Science","volume":"740","author":"Blundolz C.","unstructured":"Blundolz , C. , Santis , A. D. , Herzberg , A. , Kutten , S. , Vaccaro , U. , and Yung , M . 1993. Perfectly-secure key distribution for dynamic conferences . In Proceedings of the 12th Annual International Conference on Cryptology (CRYPTO). Lecture Notes in Computer Science , vol. 740 . Springer, Berlin, Germany, 471--486. Blundolz, C., Santis, A. D., Herzberg, A., Kutten, S., Vaccaro, U., and Yung, M. 1993. Perfectly-secure key distribution for dynamic conferences. In Proceedings of the 12th Annual International Conference on Cryptology (CRYPTO). Lecture Notes in Computer Science, vol. 740. Springer, Berlin, Germany, 471--486."},{"volume-title":"The Combinatorics of Network Reliability","author":"Colbourn C. J.","key":"e_1_2_1_5_1","unstructured":"Colbourn , C. J. 1987. The Combinatorics of Network Reliability . Oxford University Press . Colbourn, C. J. 1987. The Combinatorics of Network Reliability. Oxford University Press."},{"key":"e_1_2_1_6_1","doi-asserted-by":"crossref","unstructured":"Downey R. G. and Fellows M. R. 1999. Parameterized Complexity. Springer Berlin Germany.   Downey R. G. and Fellows M. R. 1999. Parameterized Complexity. Springer Berlin Germany.","DOI":"10.1007\/978-1-4612-0515-9"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/586110.586117"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02252869"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/501436.501437"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICNP.2005.5"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2005.05.017"},{"key":"e_1_2_1_12_1","volume-title":"Lecture Notes in Computer Science","volume":"1172","author":"Mu Y.","unstructured":"Mu , Y. and Varadharajan , V . 1996. On the design of security protocols for mobile communications . Lecture Notes in Computer Science , vol. 1172 . Springer, Berlin, Heidelberg, NY, 134--145. Mu, Y. and Varadharajan, V. 1996. On the design of security protocols for mobile communications. Lecture Notes in Computer Science, vol. 1172. Springer, Berlin, Heidelberg, NY, 134--145."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1016598314198"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008268610932"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/646754.705062"},{"volume-title":"Proceedings of the 15th International Workshop on Parallel and Distributed Real-Time Systems.","author":"Wang L.","key":"e_1_2_1_16_1","unstructured":"Wang , L. and Kulkarni , S. S . 2007. Authentication in reprogramming of sensor networks for mote class adversaries . In Proceedings of the 15th International Workshop on Parallel and Distributed Real-Time Systems. Wang, L. and Kulkarni, S. S. 2007. Authentication in reprogramming of sensor networks for mote class adversaries. In Proceedings of the 15th International Workshop on Parallel and Distributed Real-Time Systems."},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/MWC.2004.1269716"}],"container-title":["ACM Transactions on Autonomous and Adaptive Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1452001.1452008","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1452001.1452008","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:30:06Z","timestamp":1750253406000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1452001.1452008"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,11]]},"references-count":17,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2008,11]]}},"alternative-id":["10.1145\/1452001.1452008"],"URL":"https:\/\/doi.org\/10.1145\/1452001.1452008","relation":{},"ISSN":["1556-4665","1556-4703"],"issn-type":[{"type":"print","value":"1556-4665"},{"type":"electronic","value":"1556-4703"}],"subject":[],"published":{"date-parts":[[2008,11]]},"assertion":[{"value":"2007-03-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2008-09-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2008-12-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}