{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,26]],"date-time":"2025-09-26T00:16:18Z","timestamp":1758845778244},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,11,30]],"date-time":"2011-11-30T00:00:00Z","timestamp":1322611200000},"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":[[2013,7]]},"DOI":"10.1007\/s10878-011-9431-1","type":"journal-article","created":{"date-parts":[[2011,12,1]],"date-time":"2011-12-01T03:57:16Z","timestamp":1322711836000},"page":"44-70","source":"Crossref","is-referenced-by-count":3,"title":["Optimal key tree structure for two-user replacement and deletion problems"],"prefix":"10.1007","volume":"26","author":[{"given":"Weiwei","family":"Wu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Minming","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Enhong","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,11,30]]},"reference":[{"key":"9431_CR1","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1007\/978-3-642-02882-3_16","volume-title":"Proceedings of the 15th annual international conference on computing and combinatorics (COCOON)","author":"A Chan","year":"2009","unstructured":"Chan A, Rajaraman R, Sun Z, Zhu F (2009) Approximation algorithms for key management in secure multicast. In: Proceedings of the 15th annual international conference on computing and combinatorics (COCOON), pp 148\u2013157"},{"key":"9431_CR2","unstructured":"Chan Y-K, Li M, Wu W (2010) Optimal tree structure with loyal users and batch updates. J\u00a0Combin\u00a0Optim 1\u201310"},{"key":"9431_CR3","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 FF (2008) Optimizing deletion cost for secure multicast key management. Theor Comput Sci 401:52\u201361","journal-title":"Theor Comput Sci"},{"key":"9431_CR4","first-page":"511","volume-title":"Proceedings of the twenty-fourth annual international cryptology conference (CRYPTO)","author":"MT Goodrich","year":"2004","unstructured":"Goodrich MT, Sun JZ, Tamassia R (2004) Efficient tree-based revocation in groups of low-state devices. In: Proceedings of the twenty-fourth annual international cryptology conference (CRYPTO), pp 511\u2013527"},{"issue":"2","key":"9431_CR5","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":"9431_CR6","first-page":"525","volume-title":"Proceedings of the tenth international conference on world wide web","author":"XS Li","year":"2001","unstructured":"Li XS, Yang YR, Gouda MG, Lam SS (2001) Batch re-keying for secure group communications. In: Proceedings of the tenth international conference on world wide web, pp 525\u2013534"},{"key":"9431_CR7","first-page":"422","volume-title":"Proceedings of the twentieth annual ieee conference on computer communications","author":"J Snoeyink","year":"2001","unstructured":"Snoeyink J, Suri S, Varghese G (2001) A lower bound for multicast key distribution. In: Proceedings of the twentieth annual ieee conference on computer communications, pp 422\u2013431"},{"key":"9431_CR8","doi-asserted-by":"crossref","unstructured":"Wallner D, Harder E, Agee RC (1999) Key management for multicast: issues and architectures, RFC 2627, June","DOI":"10.17487\/rfc2627"},{"issue":"1","key":"9431_CR9","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1109\/90.836475","volume":"8","author":"CK Wong","year":"2000","unstructured":"Wong CK, Gouda MG, Lam SS (2000) Secure group communications using key graphs. IEEE\/ACM Trans Netw 8(1):16\u201330","journal-title":"IEEE\/ACM Trans Netw"},{"key":"9431_CR10","volume-title":"14th annual international computing and combinatorics conference","author":"W Wu","year":"2008","unstructured":"Wu W, Li M, Chen E (2008a) Optimal tree structures for group key tree management considering insertion and deletion cost. In: 14th annual international computing and combinatorics conference"},{"key":"9431_CR11","volume-title":"ISAAC08","author":"W Wu","year":"2008","unstructured":"Wu W, Li M, Chen E (2008b) Optimal key tree structure for deleting two or more leaves. In: ISAAC08"},{"key":"9431_CR12","first-page":"773","volume-title":"Proceedings of 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: Proceedings of military communications conference, pp 773\u2013778"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-011-9431-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-011-9431-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-011-9431-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,20]],"date-time":"2019-06-20T04:32:50Z","timestamp":1561005170000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-011-9431-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,11,30]]},"references-count":12,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,7]]}},"alternative-id":["9431"],"URL":"https:\/\/doi.org\/10.1007\/s10878-011-9431-1","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,11,30]]}}}