{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,6]],"date-time":"2025-01-06T19:10:09Z","timestamp":1736190609377,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":46,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540310334"},{"type":"electronic","value":"9783540326489"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11605805_16","type":"book-chapter","created":{"date-parts":[[2005,12,22]],"date-time":"2005-12-22T11:08:03Z","timestamp":1135249683000},"page":"244-261","source":"Crossref","is-referenced-by-count":3,"title":["How to Construct Multicast Cryptosystems Provably Secure Against Adaptive Chosen Ciphertext Attack"],"prefix":"10.1007","author":[{"given":"Yitao","family":"Duan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John","family":"Canny","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"16_CR1","doi-asserted-by":"crossref","unstructured":"Fenner, W.: Internet group management protocol, version 2. RFC-2236 (1997)","DOI":"10.17487\/rfc2236"},{"key":"16_CR2","doi-asserted-by":"crossref","unstructured":"Harney, H., Muckenhirn, C.: Group key management protocol (gkmp) architecture. IETF Request for Comments, RFC 2094 (1997)","DOI":"10.17487\/rfc2094"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"Wallner, D., Harder, E., Agee, R.: Key management for multicast: Issues and architectures. IETF Request For Comments, RFC 2627 (1999)","DOI":"10.17487\/rfc2627"},{"key":"16_CR4","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1109\/90.836475","volume":"8","author":"C.K. Wong","year":"2000","unstructured":"Wong, C.K., Gouda, M., Lam, S.S.: Secure group communications using key graphs. IEEE\/ACM Trans. Netw.\u00a08, 16\u201330 (2000)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"16_CR5","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 (1999)","DOI":"10.1109\/INFCOM.1999.751457"},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"Chang, I., Engel, R., Kandlur, D., Pendarakis, D., Saha, D.: Key management for secure internet multicast using boolean function minimization techniques. In: Proceedings IEEE Infocomm 1999, vol.\u00a02, pp. 689\u2013698 (1999)","DOI":"10.1109\/INFCOM.1999.751455"},{"key":"16_CR7","unstructured":"Wong, C.K., Lam, S.S.: Keystone: A group key management service. In: International Conference on Telecommunications, ICT 2000 (2000)"},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"Li, X.S., Yang, Y.R., Gouda, M.G., Lam, S.S.: Batch rekeying for secure group communications. In: Proceedings of the tenth international World Wide Web conference on World Wide Web, Orlando, FL USA, pp. 525\u2013534 (2001)","DOI":"10.1145\/371920.372153"},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"Setia, S., Koussih, S., Jajodia, S., Harder, E.: A scalable group re-keying approach for secure multicast. In: IEEE Symposium on Security and Privacy, pp. 215\u2013228 (2000)","DOI":"10.1109\/SECPRI.2000.848459"},{"key":"16_CR10","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1145\/383059.383062","volume-title":"Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications","author":"Y.R. Yang","year":"2001","unstructured":"Yang, Y.R., Li, X.S., Zhang, X.B., Lam, S.S.: Reliable group rekeying: a performance analysis. In: Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications, pp. 27\u201338. ACM Press, New York (2001)"},{"key":"16_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/3-540-48658-5_25","volume-title":"Advances in Cryptology - CRYPTO \u201994","author":"B. Chor","year":"1994","unstructured":"Chor, B., Fiat, A., Naor, M.: Tracing traitors. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol.\u00a0839, pp. 257\u2013270. Springer, Heidelberg (1994)"},{"key":"16_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"480","DOI":"10.1007\/3-540-48329-2_40","volume-title":"Advances in Cryptology - CRYPTO \u201993","author":"A. Fiat","year":"1994","unstructured":"Fiat, A., Naor, M.: Broadcast encryption. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol.\u00a0773, pp. 480\u2013491. Springer, Heidelberg (1994)"},{"key":"16_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1007\/3-540-48405-1_22","volume-title":"Advances in Cryptology - CRYPTO \u201999","author":"D. Boneh","year":"1999","unstructured":"Boneh, D., Franklin, M.: An efficient public key traitor tracing scheme. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol.\u00a01666, pp. 338\u2013353. Springer, Heidelberg (1999)"},{"key":"16_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/978-3-540-48000-6_27","volume-title":"Advances in Cryptology - ASIACRYPT\u201999","author":"J. Anzai","year":"1999","unstructured":"Anzai, J., Matsuzaki, N., Matsumoto, T.: A quick group key distribution scheme with entity revocation. In: Lam, K.-Y., Okamoto, E., Xing, C. (eds.) ASIACRYPT 1999. LNCS, vol.\u00a01716, pp. 333\u2013347. Springer, Heidelberg (1999)"},{"key":"16_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1007\/BFb0054150","volume-title":"Advances in Cryptology - EUROCRYPT \u201998","author":"M. Luby","year":"1998","unstructured":"Luby, M., Staddon, J.: Combinatorial bounds for broadcast encryption. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol.\u00a01403, pp. 512\u2013526. Springer, Heidelberg (1998)"},{"key":"16_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/3-540-44598-6_21","volume-title":"Advances in Cryptology - CRYPTO 2000","author":"J.A. Garay","year":"2000","unstructured":"Garay, J.A., Staddon, J., Wool, A.: Long-lived broadcast encryption. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol.\u00a01880, pp. 333\u2013352. Springer, Heidelberg (2000)"},{"key":"16_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-45472-1_1","volume-title":"Financial Cryptography","author":"M. Naor","year":"2001","unstructured":"Naor, M., Pinkas, B.: Efficient trace and revoke schemes. In: Frankel, Y. (ed.) FC 2000. LNCS, vol.\u00a01962, p. 1. Springer, Heidelberg (2001)"},{"key":"16_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/3-540-45708-9_4","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"D. Halevy","year":"2002","unstructured":"Halevy, D., Shamir, A.: The LSD broadcast encryption scheme. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442, pp. 47\u201360. Springer, Heidelberg (2002)"},{"key":"16_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/3-540-44647-8_3","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"D. Naor","year":"2001","unstructured":"Naor, D., Naor, M., Lotspiech, J.B.: Revocation and tracing schemes for stateless receivers. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, pp. 41\u201362. Springer, Heidelberg (2001)"},{"key":"16_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/BFb0055717","volume-title":"Advances in Cryptology - CRYPTO \u201998","author":"R. Cramer","year":"1998","unstructured":"Cramer, R., Shoup, V.: A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol.\u00a01462, pp. 13\u201325. Springer, Heidelberg (1998)"},{"key":"16_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1007\/11535218_16","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"D. Boneh","year":"2005","unstructured":"Boneh, D., Gentry, C., Waters, B.: Collusion resistant broadcast encryption with short ciphertexts and private keys. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol.\u00a03621, pp. 258\u2013275. Springer, Heidelberg (2005)"},{"key":"16_CR22","first-page":"207","volume-title":"Proceedings of the 4th International Workshop on Practice and Theory in Public Key Cryptography","author":"W.G. Tzeng","year":"2001","unstructured":"Tzeng, W.G., Tzeng, Z.J.: A public-key traitor tracing scheme with revocation using dynamic shares. In: Proceedings of the 4th International Workshop on Practice and Theory in Public Key Cryptography, pp. 207\u2013224. Springer, Heidelberg (2001)"},{"key":"16_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1007\/3-540-36288-6_8","volume-title":"Public Key Cryptography - PKC 2003","author":"Y. Dodis","year":"2002","unstructured":"Dodis, Y., Fazio, N.: Public key trace and revoke scheme secure against adaptive chosen ciphertext attack. In: Desmedt, Y.G. (ed.) PKC 2003. LNCS, vol.\u00a02567, pp. 100\u2013115. Springer, Heidelberg (2002)"},{"key":"16_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/978-3-540-40061-5_23","volume-title":"Advances in Cryptology - ASIACRYPT 2003","author":"C.H. Kim","year":"2003","unstructured":"Kim, C.H., Hwang, Y.H., Lee, P.J.: An efficient public key trace and revoke scheme secure against adaptive chosen ciphertext attack. In: Laih, C.-S. (ed.) ASIACRYPT 2003. LNCS, vol.\u00a02894, pp. 359\u2013373. Springer, Heidelberg (2003)"},{"key":"16_CR25","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1145\/948109.948141","volume-title":"Proceedings of the 10th ACM conference on Computer and communication security","author":"D. Liu","year":"2003","unstructured":"Liu, D., Ning, P., Sun, K.: Efficient self-healing group key distribution with revocation capability. In: Proceedings of the 10th ACM conference on Computer and communication security, pp. 231\u2013240. ACM Press, New York (2003)"},{"key":"16_CR26","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1109\/SECPRI.2002.1004375","volume-title":"Proceedings of the 2002 IEEE Symposium on Security and Privacy","author":"J. Staddon","year":"2002","unstructured":"Staddon, J., Miner, S., Franklin, M., Balfanz, D., Malkin, M., Dean, D.: Self-healing key distribution with revocation. In: Proceedings of the 2002 IEEE Symposium on Security and Privacy, p. 241. IEEE Computer Society, Los Alamitos (2002)"},{"key":"16_CR27","unstructured":"Wang, H.: Resilient lkh: Secure multicast key distribution schemes. In: Proceedings of the 2003 International Workshop on Advanced Developments in Software and Systems Security, WADIS (2003)"},{"key":"16_CR28","unstructured":"Boyd, C.: Digital multisignatures. Cryptography and Coding, 241\u2013246 (1986)"},{"key":"16_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1007\/3-540-48184-2_8","volume-title":"Advances in Cryptology - CRYPTO \u201987","author":"Y. Desmedt","year":"1988","unstructured":"Desmedt, Y.: Society and group oriented cryptography: A new concept. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol.\u00a0293, pp. 120\u2013127. Springer, Heidelberg (1988)"},{"key":"16_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/0-387-34805-0_28","volume-title":"Advances in Cryptology - CRYPTO \u201989","author":"Y.G. Desmedt","year":"1990","unstructured":"Desmedt, Y.G., Frankel, Y.: Threshold cryptosystems. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol.\u00a0435, pp. 307\u2013315. Springer, Heidelberg (1990)"},{"key":"16_CR31","doi-asserted-by":"publisher","first-page":"522","DOI":"10.1145\/195058.195405","volume-title":"Proceedings of the twenty-sixth annual ACM symposium on Theory of computing","author":"A. Santis De","year":"1994","unstructured":"De Santis, A., Desmedt, Y., Frankel, Y., Yung, M.: How to share a function securely. In: Proceedings of the twenty-sixth annual ACM symposium on Theory of computing, pp. 522\u2013533. ACM Press, New York (1994)"},{"key":"16_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1007\/3-540-48910-X_7","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"R. Canetti","year":"1999","unstructured":"Canetti, R., Goldwasser, S.: An efficient threshold public key cryptosystem secure against adaptive chosen ciphertext attack. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 90\u2013106. Springer, Heidelberg (1999)"},{"key":"16_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1007\/3-540-48405-1_9","volume-title":"Advances in Cryptology - CRYPTO \u201999","author":"M. Abe","year":"1999","unstructured":"Abe, M.: Robust distributed multiplication without interaction. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol.\u00a01666, pp. 130\u2013147. Springer, Heidelberg (1999)"},{"key":"16_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/3-540-45539-6_16","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"S. Jarecki","year":"2000","unstructured":"Jarecki, S., Lysyanskaya, A.: Adaptively secure threshold cryptography: Introducing concurrency, removing erasures (extended abstract). In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, pp. 221\u2013242. Springer, Heidelberg (2000)"},{"key":"16_CR35","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/s00145-001-0020-9","volume":"15","author":"V. Shoup","year":"2002","unstructured":"Shoup, V., Gennaro, R.: Securing threshold cryptosystems against chosen ciphertext attack. J. Cryptology\u00a015, 75\u201396 (2002)","journal-title":"J. Cryptology"},{"key":"16_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/3-540-45682-1_21","volume-title":"Advances in Cryptology - ASIACRYPT 2001","author":"P.A. Fouque","year":"2001","unstructured":"Fouque, P.A., Pointcheval, D.: Threshold cryptosystems secure against chosen-ciphertext attacks. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol.\u00a02248, pp. 351\u2013368. Springer, Heidelberg (2001)"},{"key":"16_CR37","series-title":"Lecture Notes in Computer Science","first-page":"223","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"P. Paillier","year":"1999","unstructured":"Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, p. 223. Springer, Heidelberg (1999)"},{"key":"16_CR38","unstructured":"RSA Labs: PKCS#1 v2.1: RSA cryptography standard (2002)"},{"key":"16_CR39","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1145\/168588.168596","volume-title":"Proceedings of the 1st ACM conference on Computer and communications security","author":"M. Bellare","year":"1993","unstructured":"Bellare, M., Rogaway, P.: Random oracles are practical: a paradigm for designing efficient protocols. In: Proceedings of the 1st ACM conference on Computer and communications security, pp. 62\u201373. ACM Press, New York (1993)"},{"key":"16_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/BFb0053428","volume-title":"Advances in Cryptology - EUROCRYPT \u201994","author":"M. Bellare","year":"1995","unstructured":"Bellare, M., Rogaway, P.: Optimal asymmetric encryption. In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol.\u00a0950, pp. 92\u2013111. Springer, Heidelberg (1995)"},{"key":"16_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/3-540-44647-8_15","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"V. Shoup","year":"2001","unstructured":"Shoup, V.: OAEP reconsidered. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, pp. 239\u2013259. Springer, Heidelberg (2001)"},{"key":"16_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/3-540-44647-8_16","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"E. Fujisaki","year":"2001","unstructured":"Fujisaki, E., Okamoto, T., Pointcheval, D., Stern, J.: RSA-OAEP is secure under the rsa assumption. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, pp. 260\u2013274. Springer, Heidelberg (2001)"},{"key":"16_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1007\/3-540-48329-2_36","volume-title":"Advances in Cryptology - CRYPTO \u201993","author":"C.H. Lim","year":"1994","unstructured":"Lim, C.H., Lee, P.J.: Another method for attaining security against adaptively chosen ciphertext attacks. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol.\u00a0773, pp. 420\u2013434. Springer, Heidelberg (1994)"},{"key":"16_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/3-540-68697-5_13","volume-title":"Advances in Cryptology - CRYPTO \u201996","author":"R. Gennaro","year":"1996","unstructured":"Gennaro, R., Jarecki, S., Krawczyk, H., Rabin, T.: Robust and efficient sharing of RSA functions. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol.\u00a01109, pp. 157\u2013172. Springer, Heidelberg (1996)"},{"key":"16_CR45","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1145\/100216.100273","volume-title":"Proceedings of the twenty-second annual ACM symposium on Theory of computing","author":"M. Naor","year":"1990","unstructured":"Naor, M., Yung, M.: Public-key cryptosystems provably secure against chosen ciphertext attacks. In: Proceedings of the twenty-second annual ACM symposium on Theory of computing, pp. 427\u2013437. ACM Press, New York (1990)"},{"key":"16_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1007\/3-540-46766-1_35","volume-title":"Advances in Cryptology - CRYPTO \u201991","author":"C. Rackoff","year":"1992","unstructured":"Rackoff, C., Simon, D.R.: Non-interactive zero-knowledge proof of knowledge and chosen ciphertext attack. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol.\u00a0576, pp. 433\u2013444. Springer, Heidelberg (1992)"}],"container-title":["Lecture Notes in Computer Science","Topics in Cryptology \u2013 CT-RSA 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11605805_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,6]],"date-time":"2025-01-06T18:29:39Z","timestamp":1736188179000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11605805_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540310334","9783540326489"],"references-count":46,"URL":"https:\/\/doi.org\/10.1007\/11605805_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}