{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,26]],"date-time":"2025-09-26T00:09:29Z","timestamp":1758845369059},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2010,4,9]],"date-time":"2010-04-09T00:00:00Z","timestamp":1270771200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2011,11]]},"DOI":"10.1007\/s10878-010-9312-z","type":"journal-article","created":{"date-parts":[[2010,4,8]],"date-time":"2010-04-08T20:09:12Z","timestamp":1270757352000},"page":"630-639","source":"Crossref","is-referenced-by-count":4,"title":["Optimal tree structure with loyal users and batch updates"],"prefix":"10.1007","volume":"22","author":[{"given":"Yu-Ki","family":"Chan","sequence":"first","affiliation":[]},{"given":"Minming","family":"Li","sequence":"additional","affiliation":[]},{"given":"Weiwei","family":"Wu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,4,9]]},"reference":[{"issue":"1\u20133","key":"9312_CR1","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1016\/j.tcs.2008.03.016","volume":"401","author":"ZZ Chen","year":"2008","unstructured":"Chen ZZ, Feng Z, Li M, Yao F (2008) Optimizing deletion cost for secure multicast key management. Theor Comput Sci 401(1\u20133):52\u201361","journal-title":"Theor Comput Sci"},{"issue":"2","key":"9312_CR2","doi-asserted-by":"crossref","first-page":"532","DOI":"10.1137\/06064929X","volume":"21","author":"RL Graham","year":"2007","unstructured":"Graham RL, Li M, Yao FF (2007) Optimal tree structures for group key management with batch updates. SIAM J Discrete Math 21(2):532\u2013547","journal-title":"SIAM J Discrete Math"},{"key":"9312_CR3","first-page":"525","volume-title":"WWW \u201901: Proceedings of the 10th international conference on World Wide Web","author":"XS Li","year":"2001","unstructured":"Li XS, Yang YR, Gouda MG, Lam SS (2001) Batch rekeying for secure group communications. In: WWW \u201901: Proceedings of the 10th international conference on World Wide Web. ACM, New York, pp 525\u2013534"},{"key":"9312_CR4","first-page":"2072","volume-title":"Global telecommunications conference","author":"M Onen","year":"2004","unstructured":"Onen M, Molva R (2004) Reliable group rekeying with a customer perspective. In: Global telecommunications conference, GLOBECOM, 2004, vol 4. IEEE, New York, pp 2072\u20132076"},{"issue":"3","key":"9312_CR5","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1016\/j.comnet.2004.09.001","volume":"47","author":"J Snoeyink","year":"2005","unstructured":"Snoeyink J, Suri S, Varghese G (2005) A lower bound for multicast key distribution. Comput Netw 47(3):429\u2013441","journal-title":"Comput Netw"},{"issue":"1","key":"9312_CR6","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1109\/90.836475","volume":"8","author":"CK Wong","year":"2000","unstructured":"Wong CK, Gouda M, Lam SS (2000) Secure group communications using key graphs. IEEE\/ACM Trans Netw 8(1):16\u201330","journal-title":"IEEE\/ACM Trans Netw"},{"key":"9312_CR7","first-page":"77","volume-title":"ISAAC \u201908: Proceedings of the 19th international symposium on algorithms and computation","author":"W Wu","year":"2008","unstructured":"Wu W, Li M, Chen E (2008) Optimal key tree structure for deleting two or more leaves. In: ISAAC \u201908: Proceedings of the 19th international symposium on algorithms and computation. Springer, Berlin\/Heidelberg, pp 77\u201388"},{"issue":"27\u201329","key":"9312_CR8","doi-asserted-by":"crossref","first-page":"2619","DOI":"10.1016\/j.tcs.2009.02.039","volume":"410","author":"W Wu","year":"2009","unstructured":"Wu W, Li M, Chen E (2009) Optimal tree structures for group key tree management considering insertion and deletion cost. Theor Comput Sci 410(27\u201329):2619\u20132631","journal-title":"Theor Comput Sci"},{"key":"9312_CR9","first-page":"773","volume-title":"Military communications conference","author":"F Zhu","year":"2003","unstructured":"Zhu F, Chan A, Noubir G (2003) Optimal tree structure for key management of simultaneous join\/leave in secure multicast. In: Military communications conference, MILCOM, 2003, vol 2. IEEE, New York, pp 773\u2013778"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-010-9312-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-010-9312-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-010-9312-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:18:16Z","timestamp":1559276296000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-010-9312-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,4,9]]},"references-count":9,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2011,11]]}},"alternative-id":["9312"],"URL":"https:\/\/doi.org\/10.1007\/s10878-010-9312-z","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,4,9]]}}}