{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:40:09Z","timestamp":1750308009769,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":12,"publisher":"ACM","license":[{"start":{"date-parts":[[2006,7,3]],"date-time":"2006-07-03T00:00:00Z","timestamp":1151884800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2006,7,3]]},"DOI":"10.1145\/1143549.1143559","type":"proceedings-article","created":{"date-parts":[[2007,1,17]],"date-time":"2007-01-17T01:15:56Z","timestamp":1168996556000},"page":"39-44","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Modeling key agreement in multi-hop ad hoc networks"],"prefix":"10.1145","author":[{"given":"Giovanni","family":"Di Crescenzo","sequence":"first","affiliation":[{"name":"Telcordia Technologies, Piscataway, NJ"}]},{"given":"Maria","family":"Striki","sequence":"additional","affiliation":[{"name":"University of Maryland, College Park, MD"}]},{"given":"John S.","family":"Baras","sequence":"additional","affiliation":[{"name":"University of Maryland, College Park, MD"}]}],"member":"320","published-online":{"date-parts":[[2006,7,3]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/238168.238182"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1976.1055638"},{"key":"e_1_3_2_1_3_1","series-title":"Lecture Notes in Computer Science","volume-title":"A Secure and Efficient Conference Key Distribution System. Advances in Cryptology- EUROCRYPT '94","author":"Burmester M.","year":"1994","unstructured":"M. Burmester , Y. Desmedt . A Secure and Efficient Conference Key Distribution System. Advances in Cryptology- EUROCRYPT '94 , Lecture Notes in Computer Science . Springer-Verlag , Berlin Germany , 1994 . M. Burmester, Y. Desmedt. A Secure and Efficient Conference Key Distribution System. Advances in Cryptology- EUROCRYPT '94, Lecture Notes in Computer Science. Springer-Verlag, Berlin Germany, 1994."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1982.1056542"},{"key":"e_1_3_2_1_5_1","volume-title":"Morgan Kauffman","author":"Leighton F.T.","year":"1992","unstructured":"F.T. Leighton . Introduction to Parallel Algorithms and Architectures , Morgan Kauffman , 1992 F.T. Leighton. Introduction to Parallel Algorithms and Architectures, Morgan Kauffman, 1992"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/301308.301362"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/343477.362152"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/357195.357200"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/52324.52357"},{"key":"e_1_3_2_1_10_1","volume-title":"Technische Universiteit Eindhoven","author":"Mooij A.","year":"2003","unstructured":"A. Mooij , W. Wesselink . A formal analysis of a dynamic distributed spanning tree algorithm. Computer Science TR 03-16 , Technische Universiteit Eindhoven , Dec. 2003 A. Mooij, W. Wesselink. A formal analysis of a dynamic distributed spanning tree algorithm. Computer Science TR 03-16, Technische Universiteit Eindhoven, Dec. 2003"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02278851"},{"key":"e_1_3_2_1_12_1","first-page":"161a","volume-title":"The first approximated distributed algorithm for the minimum degree spanning tree problem on general graphs. Int'l Parallel and Distributed Processing Symposium (IPDPS'03)","author":"Blin L.","unstructured":"L. Blin , F. Butelle . The first approximated distributed algorithm for the minimum degree spanning tree problem on general graphs. Int'l Parallel and Distributed Processing Symposium (IPDPS'03) , p. 161a . L. Blin, F. Butelle. The first approximated distributed algorithm for the minimum degree spanning tree problem on general graphs. Int'l Parallel and Distributed Processing Symposium (IPDPS'03), p. 161a."}],"event":{"name":"IWCMC06: 2006 International Wireless Communications and Mobile Computing Conference","sponsor":["ACM Association for Computing Machinery"],"location":"Vancouver British Columbia Canada","acronym":"IWCMC06"},"container-title":["Proceedings of the 2006 international conference on Wireless communications and mobile computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1143549.1143559","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1143549.1143559","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T15:06:34Z","timestamp":1750259194000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1143549.1143559"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,7,3]]},"references-count":12,"alternative-id":["10.1145\/1143549.1143559","10.1145\/1143549"],"URL":"https:\/\/doi.org\/10.1145\/1143549.1143559","relation":{},"subject":[],"published":{"date-parts":[[2006,7,3]]},"assertion":[{"value":"2006-07-03","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}