{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:34:08Z","timestamp":1725514448524},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540725039"},{"type":"electronic","value":"9783540725046"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-72504-6_26","type":"book-chapter","created":{"date-parts":[[2007,7,22]],"date-time":"2007-07-22T07:36:39Z","timestamp":1185089799000},"page":"284-295","source":"Crossref","is-referenced-by-count":4,"title":["Approximately Optimal Trees for Group Key Management with Batch Updates"],"prefix":"10.1007","author":[{"given":"Minming","family":"Li","sequence":"first","affiliation":[]},{"given":"Ze","family":"Feng","sequence":"additional","affiliation":[]},{"given":"Ronald L.","family":"Graham","sequence":"additional","affiliation":[]},{"given":"Frances F.","family":"Yao","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"26_CR1","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1145\/937503.937506","volume":"35","author":"S. Rafaeli","year":"2003","unstructured":"Rafaeli, S., Hutchison, D.: A Survey of Key Management for Secure Group Communication. ACM Computing Surveys\u00a035(3), 309\u2013329 (2003)","journal-title":"ACM Computing Surveys"},{"key":"26_CR2","series-title":"Lecture Notes in Computer Science","first-page":"511","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","author":"R. Tamassia","year":"2004","unstructured":"Tamassia, R., Goodrich, M.T., Sun, J.Z.: Efficient Tree-Based Revocation in Groups of Low-State Devices. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol.\u00a03152, pp. 511\u2013527. Springer, Heidelberg (2004)"},{"issue":"1","key":"26_CR3","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1109\/90.836475","volume":"8","author":"C.K. Wong","year":"2003","unstructured":"Wong, C.K., Gouda, M.G., Lam, S.S.: Secure Group Communications Using Key Graphs. IEEE\/ACM Transactions on Networking\u00a08(1), 16\u201330 (2003)","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"26_CR4","doi-asserted-by":"crossref","unstructured":"Li, X.S., et al.: Batch Re-keying for Secure Group Communications. In: WWW10, Hong Kong, May 2-5 (2001)","DOI":"10.1145\/371920.372153"},{"key":"26_CR5","unstructured":"Zhu, F., Chan, A., Noubir, G.: Optimal Tree Structure for Key Management of Simultaneous Join\/Leave in Secure Multicast. In: Proceedings of MILCOM (2003)"},{"key":"26_CR6","unstructured":"Graham, R.L., Li, M., Yao, F.F.: Optimal Tree Structures for Group Key Management with Batch Updates. To appear in SIAM Journal on Discrete Mathematics."},{"key":"26_CR7","doi-asserted-by":"crossref","unstructured":"Wallner, D., Harder, E., Agee, R.C.: Key Management for Multicast: Issues and Architectures. RFC 2627 (June 1999)","DOI":"10.17487\/rfc2627"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72504-6_26.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,13]],"date-time":"2023-05-13T10:09:17Z","timestamp":1683972557000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72504-6_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540725039","9783540725046"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72504-6_26","relation":{},"subject":[]}}