{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:18:48Z","timestamp":1725535128383},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642028816"},{"type":"electronic","value":"9783642028823"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02882-3_16","type":"book-chapter","created":{"date-parts":[[2009,7,10]],"date-time":"2009-07-10T06:49:21Z","timestamp":1247208561000},"page":"148-157","source":"Crossref","is-referenced-by-count":3,"title":["Approximation Algorithms for Key Management in Secure Multicast"],"prefix":"10.1007","author":[{"given":"Agnes","family":"Chan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rajmohan","family":"Rajaraman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhifeng","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Feng","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"16_CR1","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Baratz, A.E., Peleg, D.: Cost-Sensitive Analysis of Communication Protocols. In: PODC (1990)","DOI":"10.21236\/ADA237356"},{"key":"16_CR2","doi-asserted-by":"crossref","unstructured":"Canetti, R., Garay, J., Itkis, G., Micciancio, D., Naor, M., Pinkas, B.: Multicast Security: A Taxonomy and Some Efficient Constructions. In: INFOCOMM (1999)","DOI":"10.1109\/INFCOM.1999.751457"},{"key":"16_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/3-540-48910-X_32","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"R. Canetti","year":"1999","unstructured":"Canetti, R., Malkin, T.G., Nissim, K.: Efficient communication-storage tradeoffs for multicast encryption. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 459\u2013470. Springer, Heidelberg (1999)"},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"Caronni, G., Waldvogel, M., Sun, D., Plattner, B.: Efficient Security for Large and Dynamic Multicast Groups. In: WETICE (1998)","DOI":"10.1109\/ENABL.1998.725721"},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"Chan, A., Rajaraman, R., Sun, Z., Zhu, F.: Approximation Algorithms for Key Management in Secure Multicast, arXiv:0904.4061v1 [cs.DS] (2009)","DOI":"10.1007\/978-3-642-02882-3_16"},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"Golin, M.J., Kenyon, C., Young, N.E.: Huffman coding with unequal letter costs. In: STOC (2002)","DOI":"10.1145\/509907.510020"},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"Harney, H., Muckenhirn, C.: Group Key Management Protocol (GKMP) Architecture. Internet RFC 2094 (1997)","DOI":"10.17487\/rfc2094"},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"Harney, H., Muckenhirn, C.: Group Key Management Protocol (GKMP) Specification. Internet RFC 2093 (1997)","DOI":"10.17487\/rfc2093"},{"key":"16_CR9","unstructured":"Heeringa, B.: Improving Access to Organized Information. Thesis, University of Massachussetts, Amherst (2008)"},{"key":"16_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"757","DOI":"10.1007\/978-3-540-27836-8_64","volume-title":"Automata, Languages and Programming","author":"B. Heeringa","year":"2004","unstructured":"Heeringa, B., Adler, M.: Optimal website design with the constrained subtree selection problem. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.\u00a03142, pp. 757\u2013769. Springer, Heidelberg (2004)"},{"key":"16_CR11","doi-asserted-by":"crossref","unstructured":"Huffman, D.: A Method for the Construction of Minimum-Redundancy Codes. In: IRE (1952)","DOI":"10.1109\/JRPROC.1952.273898"},{"key":"16_CR12","doi-asserted-by":"crossref","unstructured":"Karp, R.: Minimum-redundancy coding for the discrete noiseless channel. In: IRE Transactions on Information Theory (1961)","DOI":"10.1109\/TIT.1961.1057615"},{"issue":"1","key":"16_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00453-006-1227-9","volume":"14","author":"S. Khuller","year":"2007","unstructured":"Khuller, S., Kim, Y.A.: Broadcasting in Heterogeneous Networks. Algorithmica\u00a014(1), 1\u201321 (2007)","journal-title":"Algorithmica"},{"issue":"4","key":"16_CR14","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/BF01294129","volume":"14","author":"S. Khuller","year":"1995","unstructured":"Khuller, S., Raghavachari, B., Young, N.E.: Balancing Minimum Spanning Trees and Shortest-Path Trees. Algorithmica\u00a014(4), 305\u2013321 (1995)","journal-title":"Algorithmica"},{"key":"16_CR15","unstructured":"Kortsarz, G., Peleg, D.: Approximating Shallow-Light Trees (Extended Abstract). In: SODA (1997)"},{"key":"16_CR16","doi-asserted-by":"crossref","unstructured":"Lazos, L., Poovendran, R.: Cross-layer design for energy-efficient secure multicast communications in ad hoc networks. In: IEEE Int. Conf. Communications (2004)","DOI":"10.1109\/ICC.2004.1313221"},{"issue":"1","key":"16_CR17","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1006\/jagm.2001.1204","volume":"42","author":"P. Liu","year":"2002","unstructured":"Liu, P.: Broadcast Scheduling Optimization for Heterogeneous Cluster Systems. J. Algorithms\u00a042(1), 135\u2013152 (2002)","journal-title":"J. Algorithms"},{"key":"16_CR18","doi-asserted-by":"crossref","unstructured":"Mittra, S.: Iolus: A Framework for Scalable Secure Multicasting. In: SIGCOMM (1997)","DOI":"10.1145\/263105.263179"},{"key":"16_CR19","doi-asserted-by":"crossref","unstructured":"Poovendran, R., Baras, J.S.: An information-theoretic approach for design and analysis of rooted-tree-based multicast key management schemes. In: IEEE Transactions on Information Theory (2001)","DOI":"10.1109\/18.959263"},{"key":"16_CR20","doi-asserted-by":"crossref","unstructured":"Salido, J., Lazos, L., Poovendran, R.: Energy and bandwidth-efficient key distribution in wireless ad hoc networks: a cross-layer approach. In: IEEE\/ACM Trans. Netw. (2007)","DOI":"10.1109\/TNET.2007.902696"},{"key":"16_CR21","doi-asserted-by":"crossref","unstructured":"Shields, C., Garcia-Luna-Aceves, J.J.: KHIP\u2014a scalable protocol for secure multicast routing. In: SIGCOMM (1999)","DOI":"10.1145\/316188.316206"},{"key":"16_CR22","doi-asserted-by":"crossref","unstructured":"Snoeyink, J., Suri, S., Varghese, G.: A Lower Bound for Multicast Key Distribution. In: IEEE Infocomm (2001)","DOI":"10.1109\/INFCOM.2001.916725"},{"key":"16_CR23","doi-asserted-by":"crossref","unstructured":"Wallner, D., Harder, E., Agee, R.: Key Management for Multicast: Issues and Architectures. Internet RFC 2627 (1999)","DOI":"10.17487\/rfc2627"},{"key":"16_CR24","doi-asserted-by":"crossref","unstructured":"Wong, C.K., Gouda, M.G., Lam, S.S.: Secure Group Communications Using Key Graphs. In: SIGCOMM (1998)","DOI":"10.1145\/285237.285260"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02882-3_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T06:44:57Z","timestamp":1558421097000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02882-3_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642028816","9783642028823"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02882-3_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}