{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T09:05:40Z","timestamp":1766048740620,"version":"3.41.0"},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662538890"},{"type":"electronic","value":"9783662538906"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-662-53890-6_27","type":"book-chapter","created":{"date-parts":[[2016,11,8]],"date-time":"2016-11-08T12:11:32Z","timestamp":1478607092000},"page":"807-840","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":23,"title":["Universal Composition with Responsive Environments"],"prefix":"10.1007","author":[{"given":"Jan","family":"Camenisch","sequence":"first","affiliation":[]},{"given":"Robert R.","family":"Enderlein","sequence":"additional","affiliation":[]},{"given":"Stephan","family":"Krenn","sequence":"additional","affiliation":[]},{"given":"Ralf","family":"K\u00fcsters","sequence":"additional","affiliation":[]},{"given":"Daniel","family":"Rausch","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,11,9]]},"reference":[{"key":"27_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1007\/978-3-642-10366-7_26","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2009","author":"M Abe","year":"2009","unstructured":"Abe, M., Ohkubo, M.: A framework for universally composable non-committing blind signatures. In: Matsui, M. (ed.) ASIACRYPT 2009. LNCS, vol. 5912, pp. 435\u2013450. Springer, Heidelberg (2009). doi:10.1007\/978-3-642-10366-7_26"},{"issue":"2","key":"27_CR2","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/s10207-007-0046-6","volume":"7","author":"M Backes","year":"2008","unstructured":"Backes, M., D\u00fcrmuth, M., Hofheinz, D., K\u00fcsters, R.: Conditional reactive simulatability. Int. J. Inf. Secur. (IJIS) 7(2), 155\u2013169 (2008)","journal-title":"Int. J. Inf. Secur. (IJIS)"},{"issue":"12","key":"27_CR3","doi-asserted-by":"publisher","first-page":"1685","DOI":"10.1016\/j.ic.2007.05.002","volume":"205","author":"M Backes","year":"2007","unstructured":"Backes, M., Pfitzmann, B., Waidner, M.: The reactive simulatability (RSIM) framework for asynchronous systems. Inf. Comput. 205(12), 1685\u20131720 (2007)","journal-title":"Inf. Comput."},{"key":"27_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-540-30144-8_6","volume-title":"Information Security","author":"M Backes","year":"2004","unstructured":"Backes, M., Hofheinz, D.: How to break and repair a universally composable signature functionality. In: Zhang, K., Zheng, Y. (eds.) ISC 2004. LNCS, vol. 3225, pp. 61\u201372. Springer, Heidelberg (2004). doi:10.1007\/978-3-540-30144-8_6"},{"key":"27_CR5","doi-asserted-by":"crossref","unstructured":"Camenisch, J., Dubovitskaya, M., Haralambiev, K., Kohlweiss, M.: Composable & modular anonymous credentials: definitions and practical constructions. In: ASIACRYPT 2015 (2015)","DOI":"10.1007\/978-3-662-48800-3_11"},{"key":"27_CR6","doi-asserted-by":"crossref","first-page":"807","DOI":"10.1007\/978-3-662-53890-6_27","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2016","author":"Jan Camenisch","year":"2016","unstructured":"Camenisch, J., Enderlein, R.R., Krenn, S., K\u00fcsters, R., Rausch, D.: Universal composition with responsive environments. Technical report, Cryptology ePrint Archive, Report 2016\/034 (2016). http:\/\/eprint.iacr.org\/2016\/034"},{"key":"27_CR7","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable signature, certification, and authentication. In: CSFW 2004, pp. 219\u2013233. IEEE (2004)","DOI":"10.1109\/CSFW.2004.1310743"},{"key":"27_CR8","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols. In: 42nd FOCS, pp. 136\u2013145. IEEE Computer Society Press, October 2001. For full and previous versions https:\/\/eprint.iacr.org\/2000\/067.pdf","DOI":"10.1109\/SFCS.2001.959888"},{"key":"27_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/11864219_17","volume-title":"Distributed Computing","author":"R Canetti","year":"2006","unstructured":"Canetti, R., Cheung, L., Kaynar, D., Liskov, M., Lynch, N., Pereira, O., Segala, R.: Time-bounded task-PIOAs: a framework for analyzing security protocols. In: Dolev, S. (ed.) DISC 2006. LNCS, vol. 4167, pp. 238\u2013253. Springer, Heidelberg (2006). doi:10.1007\/11864219_17"},{"key":"27_CR10","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. 4392, pp. 61\u201385. Springer, Heidelberg (2007). doi:10.1007\/978-3-540-70936-7_4"},{"key":"27_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1007\/978-3-540-30576-7_9","volume-title":"Theory of Cryptography","author":"R Canetti","year":"2005","unstructured":"Canetti, R., Halevi, S., Katz, J.: Adaptively-secure, non-interactive public-key encryption. In: Kilian, J. (ed.) TCC 2005. LNCS, vol. 3378, pp. 150\u2013168. Springer, Heidelberg (2005). doi:10.1007\/978-3-540-30576-7_9"},{"key":"27_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1007\/978-3-540-45146-4_33","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"R Canetti","year":"2003","unstructured":"Canetti, R., Krawczyk, H., Nielsen, J.B.: Relaxing chosen-ciphertext security. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 565\u2013582. Springer, Heidelberg (2003). doi:10.1007\/978-3-540-45146-4_33"},{"key":"27_CR13","unstructured":"Canetti, R., Shahaf, D., Vald, M.: Universally composable authentication and key-exchange with global PKI. Cryptology ePrint Archive, Report 2014\/432 (2014)"},{"key":"27_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/11818175_5","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"M Chase","year":"2006","unstructured":"Chase, M., Lysyanskaya, A.: On signatures of knowledge. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 78\u201396. Springer, Heidelberg (2006). doi:10.1007\/11818175_5"},{"key":"27_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/978-3-540-79263-5_15","volume-title":"Topics in Cryptology \u2013 CT-RSA 2008","author":"I Damg\u00e5rd","year":"2008","unstructured":"Damg\u00e5rd, I., Hofheinz, D., Kiltz, E., Thorbek, R.: Public-key encryption with non-interactive opening. In: Malkin, T. (ed.) CT-RSA 2008. LNCS, vol. 4964, pp. 239\u2013255. Springer, Heidelberg (2008). doi:10.1007\/978-3-540-79263-5_15"},{"issue":"2","key":"27_CR16","doi-asserted-by":"publisher","first-page":"725","DOI":"10.1587\/transfun.E94.A.725","volume":"94\u2013A","author":"R Dowsley","year":"2011","unstructured":"Dowsley, R., M\u00fcller-Quade, J., Otsuka, A., Hanaoka, G., Imai, H., Nascimento, A.C.A.: Universally composable and statistically secure verifiable secret sharing scheme based on pre-distributed data. IEICE Trans. 94\u2013A(2), 725\u2013734 (2011)","journal-title":"IEICE Trans."},{"key":"27_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-319-10879-7_1","volume-title":"Security and Cryptography for Networks","author":"ESV Freire","year":"2014","unstructured":"Freire, E.S.V., Hesse, J., Hofheinz, D.: Universally composable non-interactive key exchange. In: Abdalla, M., Prisco, R. (eds.) SCN 2014. LNCS, vol. 8642, pp. 1\u201320. Springer, Heidelberg (2014). doi:10.1007\/978-3-319-10879-7_1"},{"key":"27_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/978-3-662-48800-3_8","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2015","author":"C Hazay","year":"2015","unstructured":"Hazay, C., Venkitasubramaniam, M.: On black-box complexity of universally composable security in the CRS model. In: Iwata, T., Cheon, J.H. (eds.) ASIACRYPT 2015. LNCS, vol. 9453, pp. 183\u2013209. Springer, Heidelberg (2015). doi:10.1007\/978-3-662-48800-3_8"},{"key":"27_CR19","unstructured":"Hofheinz, D., Shoup, V.: GNUC: a new universal composability framework. Cryptology ePrint Archive, Report 2011\/303 (2011)"},{"issue":"3","key":"27_CR20","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/s00145-012-9127-4","volume":"26","author":"D Hofheinz","year":"2013","unstructured":"Hofheinz, D., Unruh, D., M\u00fcller-Quade, J.: Polynomial runtime and composability. J. Cryptology 26(3), 375\u2013441 (2013)","journal-title":"J. Cryptology"},{"key":"27_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1007\/978-3-540-70583-3_43","volume-title":"Automata, Languages and Programming","author":"K Kurosawa","year":"2008","unstructured":"Kurosawa, K., Furukawa, J.: Universally composable undeniable signature. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008. LNCS, vol. 5126, pp. 524\u2013535. Springer, Heidelberg (2008). doi:10.1007\/978-3-540-70583-3_43"},{"key":"27_CR22","doi-asserted-by":"crossref","unstructured":"K\u00fcsters, R.: Simulation-based security with inexhaustible interactive turing machines. In: CSFW 2006, pp. 309\u2013320. IEEE (2006)","DOI":"10.1109\/CSFW.2006.30"},{"key":"27_CR23","doi-asserted-by":"crossref","unstructured":"K\u00fcsters, R., Tuengerthal, M.: Joint state theorems for public-key encryption and digital signature functionalities with local computation. In: Proceedings of the 21st IEEE Computer Security Foundations Symposium (CSF 2008), pp. 270\u2013284. IEEE Computer Society (2008)","DOI":"10.1109\/CSF.2008.18"},{"key":"27_CR24","unstructured":"K\u00fcsters, R., Tuengerthal, M.: The IITM model: a simple and expressive model for universal composability. Cryptology ePrint Archive, Report 2013\/025 (2013)"},{"key":"27_CR25","doi-asserted-by":"crossref","unstructured":"Laud, P., Ngo, L.: Threshold homomorphic encryption in the universally composable cryptographic library. Cryptology ePrint Archive, Report 2008\/367 (2008)","DOI":"10.1007\/978-3-540-88733-1_21"},{"key":"27_CR26","unstructured":"Matsuo, T., Matsuo, S.: On universal composable security of time-stamping protocols. In: IWAP 2005, pp. 169\u2013181 (2005)"},{"key":"27_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-642-27375-9_3","volume-title":"Theory of Security and Applications","author":"U Maurer","year":"2012","unstructured":"Maurer, U.: Constructive cryptography \u2013 a new paradigm for security definitions and proofs. In: M\u00f6dersheim, S., Palamidessi, C. (eds.) TOSCA 2011. LNCS, vol. 6993, pp. 33\u201356. Springer, Heidelberg (2012). doi:10.1007\/978-3-642-27375-9_3"},{"key":"27_CR28","unstructured":"Maurer, U., Renner, R.: Abstract cryptography. In: ICS 2011, pp. 1\u201321. Tsinghua University Press (2011)"},{"key":"27_CR29","doi-asserted-by":"crossref","unstructured":"Pfitzmann, B., Waidner, M.: Composition and integrity preservation of secure reactive systems. In: ACM CCS 2000, pp. 245\u2013254. ACM Press (2000)","DOI":"10.1145\/352600.352639"},{"key":"27_CR30","unstructured":"Tian, Y., Peng, C.: Universally composable secure group communication. Cryptology ePrint Archive, Report 2014\/647 (2014). http:\/\/eprint.iacr.org\/"},{"key":"27_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/978-3-319-11698-3_9","volume-title":"Network and System Security","author":"S Zhao","year":"2014","unstructured":"Zhao, S., Zhang, Q., Qin, Y., Feng, D.: Universally composable secure tnc protocol based on IF-T binding to TLS. In: Au, M.H., Carminati, B., Kuo, C.-C.J. (eds.) NSS 2014. LNCS, vol. 8792, pp. 110\u2013123. Springer, Heidelberg (2014). doi:10.1007\/978-3-319-11698-3_9"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2016"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-53890-6_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,12]],"date-time":"2025-06-12T04:48:40Z","timestamp":1749703720000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-53890-6_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662538890","9783662538906"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-53890-6_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"9 November 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ASIACRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Theory and Application of Cryptology and Information Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hanoi","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vietnam","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 December 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 December 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"asiacrypt2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.asiacrypt2016.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}