{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T12:12:47Z","timestamp":1742991167974,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":39,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540858546"},{"type":"electronic","value":"9783540858553"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-85855-3_26","type":"book-chapter","created":{"date-parts":[[2008,8,28]],"date-time":"2008-08-28T13:27:52Z","timestamp":1219930072000},"page":"392-408","source":"Crossref","is-referenced-by-count":9,"title":["A Universally Composable Group Key Exchange Protocol with Minimum Communication Effort"],"prefix":"10.1007","author":[{"given":"Jun","family":"Furukawa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frederik","family":"Armknecht","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kaoru","family":"Kurosawa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"26_CR1","unstructured":"Barak, B., Lindell, Y., Rabin, T.: Protocol initialization for the framework of universal composability. Cryptology ePrint Archive, Report2004\/006 (2004), \n                      http:\/\/eprint.iacr.org\/"},{"issue":"3","key":"26_CR2","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/s00145-002-0120-1","volume":"16","author":"M. Bellare","year":"2003","unstructured":"Bellare, M., Namprempre, C., Pointcheval, D., Semanko, M.: The one-more-rsa-inversion problems and the security of chaum\u2019s blind signature scheme. J. Cryptology\u00a016(3), 185\u2013215 (2003)","journal-title":"J. Cryptology"},{"key":"26_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/3-540-45708-9_11","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"M. Bellare","year":"2002","unstructured":"Bellare, M., Palacio, A.: Gq and schnorr identification schemes: Proofs of security against impersonation under active and concurrent attacks. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442, pp. 162\u2013177. Springer, Heidelberg (2002)"},{"key":"26_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/3-540-45539-6_11","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"M. Bellare","year":"2000","unstructured":"Bellare, M., Pointcheval, D., Rogaway, P.: Authenticated key exchange secure against dictionary attacks. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, pp. 139\u2013155. Springer, Heidelberg (2000)"},{"key":"26_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1007\/3-540-48329-2_21","volume-title":"Advances in Cryptology - CRYPTO \u201993","author":"M. Bellare","year":"1994","unstructured":"Bellare, M., Rogaway, P.: Entity authentication and key distribution. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol.\u00a0773, pp. 232\u2013249. Springer, Heidelberg (1994)"},{"key":"26_CR6","first-page":"57","volume-title":"STOC","author":"M. Bellare","year":"1995","unstructured":"Bellare, M., Rogaway, P.: Provably secure session key distribution: the three party case. In: STOC, pp. 57\u201366. ACM, New York (1995)"},{"key":"26_CR7","doi-asserted-by":"crossref","unstructured":"Boneh, D., Boyen, X., Shacham, H.: Short group signatures. In: Franklin [13], pp. 41\u201355","DOI":"10.1007\/978-3-540-28628-8_3"},{"key":"26_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/3-540-45682-1_18","volume-title":"Advances in Cryptology - ASIACRYPT 2001","author":"E. Bresson","year":"2001","unstructured":"Bresson, E., Chevassut, O., Pointcheval, D.: Provably authenticated group diffie-hellman key exchange - the dynamic case. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol.\u00a02248, pp. 290\u2013309. Springer, Heidelberg (2001)"},{"key":"26_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/3-540-46035-7_21","volume-title":"Advances in Cryptology - EUROCRYPT 2002","author":"E. Bresson","year":"2002","unstructured":"Bresson, E., Chevassut, O., Pointcheval, D.: Dynamic group diffie-hellman key exchange under standard assumptions. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol.\u00a02332, pp. 321\u2013336. Springer, Heidelberg (2002)"},{"key":"26_CR10","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1145\/501983.502018","volume-title":"CCS 2001: Proceedings of the 8th ACM conference on Computer and Communications Security","author":"E. Bresson","year":"2001","unstructured":"Bresson, E., Chevassut, O., Pointcheval, D., Quisquater, J.-J.: Provably authenticated group diffie-hellman key exchange. In: CCS 2001: Proceedings of the 8th ACM conference on Computer and Communications Security, pp. 255\u2013264. ACM Press, New York (2001)"},{"key":"26_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/978-3-540-75651-4_20","volume-title":"Advances in Information and Computer Security","author":"E. Bresson","year":"2007","unstructured":"Bresson, E., Manulis, M., Schwenk, J.: On Security Models and Compilers for Group Key Exchange Protocols. In: Miyaji, A., Kikuchi, H., Rannenberg, K. (eds.) IWSEC 2007. LNCS, vol.\u00a04752, pp. 292\u2013307. Springer, Heidelberg (2007)"},{"key":"26_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/BFb0053443","volume-title":"Advances in Cryptology - EUROCRYPT \u201994","author":"M. Burmester","year":"1995","unstructured":"Burmester, M., Desmedt, Y.: A secure and efficient conference key distribution system (extended abstract). In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol.\u00a0950, pp. 275\u2013286. Springer, Heidelberg (1995)"},{"key":"26_CR13","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1145\/1011767.1011820","volume-title":"Proceedings of the 23rd Annual ACM Symposium on Principles of Distributed Computing (PODC 2004)","author":"C. Cachin","year":"2004","unstructured":"Cachin, C., Strobl, R.: Asynchronous Group Key Exchange with Failures. In: Proceedings of the 23rd Annual ACM Symposium on Principles of Distributed Computing (PODC 2004), pp. 357\u2013366. ACM Press, New York (2004)"},{"key":"26_CR14","doi-asserted-by":"crossref","unstructured":"Camenisch, J., Lysyanskaya, A.: Signature schemes and anonymous credentials from bilinear maps. In: Franklin [31], pp. 56\u201372","DOI":"10.1007\/978-3-540-28628-8_4"},{"key":"26_CR15","unstructured":"Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols. Cryptology ePrint Archive, Report 2000\/067 (revised in 2005) (2000), \n                      http:\/\/eprint.iacr.org\/"},{"key":"26_CR16","first-page":"219","volume-title":"CSFW","author":"R. Canetti","year":"2004","unstructured":"Canetti, R.: Universally composable signature, certification, and authentication. In: CSFW, p. 219. IEEE Computer Society, Los Alamitos (2004)"},{"key":"26_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-540-70936-7_4","volume-title":"Theory of Cryptography","author":"R. Canetti","year":"2007","unstructured":"Canetti, R., Dodis, Y., Pass, R., Walfish, S.: Universally composable security with global setup. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol.\u00a04392, pp. 61\u201385. Springer, Heidelberg (2007)"},{"key":"26_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/3-540-44647-8_2","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"R. Canetti","year":"2001","unstructured":"Canetti, R., Fischlin, M.: Universally composable commitments. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, pp. 19\u201340. Springer, Heidelberg (2001)"},{"key":"26_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"404","DOI":"10.1007\/11426639_24","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"R. Canetti","year":"2005","unstructured":"Canetti, R., Halevi, S., Katz, J., Lindell, Y., MacKenzie, P.D.: Universally composable password-based key exchange. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol.\u00a03494, pp. 404\u2013421. Springer, Heidelberg (2005)"},{"key":"26_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/3-540-44987-6_28","volume-title":"Advances in Cryptology - EUROCRYPT 2001","author":"R. Canetti","year":"2001","unstructured":"Canetti, R., Krawczyk, H.: Analysis of key-exchange protocols and their use for building secure channels. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol.\u00a02045, pp. 453\u2013474. Springer, Heidelberg (2001)"},{"key":"26_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/3-540-46035-7_22","volume-title":"Advances in Cryptology - EUROCRYPT 2002","author":"R. Canetti","year":"2002","unstructured":"Canetti, R., Krawczyk, H.: Universally composable notions of key exchange and secure channels. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol.\u00a02332, pp. 337\u2013351. Springer, Heidelberg (2002)"},{"issue":"2","key":"26_CR22","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/s00145-005-0419-9","volume":"19","author":"R. Canetti","year":"2006","unstructured":"Canetti, R., Kushilevitz, E., Lindell, Y.: On the limitations of universally composable two-party computation without set-up assumptions. J. Cryptology\u00a019(2), 135\u2013167 (2006)","journal-title":"J. Cryptology"},{"key":"26_CR23","doi-asserted-by":"crossref","unstructured":"Canetti, R., Lindell, Y., Ostrovsky, R., Sahai, A.: Universally composable two-party and multi-party secure computation. In: STOC, pp. 494\u2013503 (2002)","DOI":"10.1145\/509907.509980"},{"key":"26_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/978-3-540-45146-4_16","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"R. Canetti","year":"2003","unstructured":"Canetti, R., Rabin, T.: Universal composition with joint state. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol.\u00a02729, pp. 265\u2013281. Springer, Heidelberg (2003)"},{"key":"26_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/3-540-44987-6_4","volume-title":"Advances in Cryptology - EUROCRYPT 2001","author":"G.D. Crescenzo","year":"2001","unstructured":"Crescenzo, G.D., Katz, J., Ostrovsky, R., Smith, A.: Efficient and non-interactive non-malleable commitment. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol.\u00a02045, pp. 40\u201359. Springer, Heidelberg (2001)"},{"key":"26_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/11836810_33","volume-title":"Information Security","author":"Y.G. Desmedt","year":"2006","unstructured":"Desmedt, Y.G., Pieprzyk, J., Steinfeld, R., Wang, H.: A Non-Malleable Group Key Exchange Protocol Robust Against Active Insiders. In: Katsikas, S.K., L\u00f3pez, J., Backes, M., Gritzalis, S., Preneel, B. (eds.) ISC 2006. LNCS, vol.\u00a04176, pp. 459\u2013475. Springer, Heidelberg (2006)"},{"key":"26_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1007\/978-3-540-30191-2_8","volume-title":"Information and Communications Security","author":"R. Dutta","year":"2004","unstructured":"Dutta, R., Barua, R., Sarkar, P.: Provably secure authenticated tree based group key agreement. In: L\u00f3pez, J., Qing, S., Okamoto, E. (eds.) ICICS 2004. LNCS, vol.\u00a03269, pp. 92\u2013104. Springer, Heidelberg (2004)"},{"key":"26_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/11818175_4","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"M. Fischlin","year":"2006","unstructured":"Fischlin, M.: Round-optimal composable blind signatures in the common reference string model. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol.\u00a04117, pp. 60\u201377. Springer, Heidelberg (2006)"},{"key":"26_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1007\/11605805_21","volume-title":"Topics in Cryptology \u2013 CT-RSA 2006","author":"M. Fischlin","year":"2006","unstructured":"Fischlin, M.: Universally composable oblivious transfer in the multi-party setting. In: Pointcheval, D. (ed.) CT-RSA 2006. LNCS, vol.\u00a03860, pp. 332\u2013349. Springer, Heidelberg (2006)"},{"key":"26_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/3-540-44598-6_26","volume-title":"Advances in Cryptology - CRYPTO 2000","author":"M. Fischlin","year":"2000","unstructured":"Fischlin, M., Fischlin, R.: Efficient non-malleable commitment schemes. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol.\u00a01880, pp. 413\u2013431. Springer, Heidelberg (2000)"},{"key":"26_CR31","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","year":"2004","unstructured":"Franklin, M. (ed.): CRYPTO 2004. LNCS, vol.\u00a03152. Springer, Heidelberg (2004)"},{"key":"26_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/978-3-540-39650-5_4","volume-title":"Computer Security \u2013 ESORICS 2003","author":"D. Hofheinz","year":"2003","unstructured":"Hofheinz, D., M\u00fcller-Quade, J., Steinwandt, R.: Initiator-resilient universally composable key exchange. In: Snekkenes, E., Gollmann, D. (eds.) ESORICS 2003. LNCS, vol.\u00a02808, pp. 61\u201384. Springer, Heidelberg (2003)"},{"key":"26_CR33","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1145\/73007.73009","volume-title":"STOC 1989: Proceedings of the twenty-first annual ACM symposium on Theory of computing","author":"R. Impagliazzo","year":"1989","unstructured":"Impagliazzo, R., Levin, L.A., Luby, M.: Pseudo-random generation from one-way functions. In: STOC 1989: Proceedings of the twenty-first annual ACM symposium on Theory of computing, pp. 12\u201324. ACM Press, New York (1989)"},{"key":"26_CR34","first-page":"248","volume-title":"FOCS","author":"R. Impagliazzo","year":"1989","unstructured":"Impagliazzo, R., Zuckerman, D.: How to recycle random bits. In: FOCS, pp. 248\u2013253. IEEE, Los Alamitos (1989)"},{"key":"26_CR35","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1145\/1102120.1102146","volume-title":"CCS 2005: Proceedings of the 12th ACM conference on Computer and communications security","author":"J. Katz","year":"2005","unstructured":"Katz, J., Shin, J.S.: Modeling insider attacks on group key-exchange protocols. In: CCS 2005: Proceedings of the 12th ACM conference on Computer and communications security, pp. 180\u2013189. ACM Press, New York (2005)"},{"issue":"1","key":"26_CR36","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/s00145-006-0361-5","volume":"20","author":"J. Katz","year":"2007","unstructured":"Katz, J., Yung, M.: Scalable protocols for authenticated group key exchange. J. Cryptol.\u00a020(1), 85\u2013113 (2007)","journal-title":"J. Cryptol."},{"key":"26_CR37","unstructured":"Kurosawa, K., Furukawa, J.: Universally composable undeniable signature. Cryptology ePrint Archive, Report 2008\/094 (2008), \n                      http:\/\/eprint.iacr.org\/"},{"key":"26_CR38","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1145\/1229285.1229319","volume-title":"ASIACCS","author":"T.V. Le","year":"2007","unstructured":"Le, T.V., Burmester, M., de Medeiros, B.: Universally composable and forward-secure rfid authentication and authenticated key exchange. In: Bao, F., Miller, S. (eds.) ASIACCS, pp. 242\u2013252. ACM, New York (2007)"},{"key":"26_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1007\/978-3-540-24638-1_18","volume-title":"Theory of Cryptography","author":"D. Wikstr\u00f6m","year":"2004","unstructured":"Wikstr\u00f6m, D.: A universally composable mix-net. In: Naor, M. (ed.) TCC 2004. LNCS, vol.\u00a02951, pp. 317\u2013335. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","Security and Cryptography for Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85855-3_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,10]],"date-time":"2024-05-10T03:38:04Z","timestamp":1715312284000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-85855-3_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540858546","9783540858553"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85855-3_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}