{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,4]],"date-time":"2025-12-04T09:47:22Z","timestamp":1764841642806,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642146220"},{"type":"electronic","value":"9783642146237"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14623-7_24","type":"book-chapter","created":{"date-parts":[[2010,8,10]],"date-time":"2010-08-10T08:15:26Z","timestamp":1281428126000},"page":"447-464","source":"Crossref","is-referenced-by-count":6,"title":["Equivalence of Uniform Key Agreement and Composition Insecurity"],"prefix":"10.1007","author":[{"given":"Chongwon","family":"Cho","sequence":"first","affiliation":[]},{"given":"Chen-Kuei","family":"Lee","sequence":"additional","affiliation":[]},{"given":"Rafail","family":"Ostrovsky","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"24_CR1","doi-asserted-by":"crossref","unstructured":"Cho, C., Lee, C.K., Ostrovsky, R.: Equivalence of uniform key agreement and composition insecurity. Electronic Colloquium on Computational Complexity (ECCC), Report No. 108 (2009)","DOI":"10.1007\/978-3-642-14623-7_24"},{"issue":"4","key":"24_CR2","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1145\/6490.6503","volume":"33","author":"O. Goldreich","year":"1986","unstructured":"Goldreich, O., Goldwasser, S., Micali, S.: How to construct random functions. J. ACM\u00a033(4), 792\u2013807 (1986)","journal-title":"J. ACM"},{"key":"24_CR3","doi-asserted-by":"publisher","first-page":"664","DOI":"10.1145\/1060590.1060689","volume-title":"STOC 2005: Proceedings of the 37th Annual ACM Symposium on Theory of Computing","author":"T. Holenstein","year":"2005","unstructured":"Holenstein, T.: Key agreement from weak bit agreement. In: STOC 2005: Proceedings of the 37th Annual ACM Symposium on Theory of Computing, pp. 664\u2013673. ACM, New York (2005)"},{"key":"24_CR4","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1109\/SCT.1995.514853","volume-title":"SCT 1995: Proceedings of the 10th Annual Structure in Complexity Theory Conference","author":"R. Impagliazzo","year":"1995","unstructured":"Impagliazzo, R.: A personal view of average-case complexity. In: SCT 1995: Proceedings of the 10th Annual Structure in Complexity Theory Conference, p. 134. IEEE Computer Society, Washington (1995)"},{"key":"24_CR5","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1145\/12130.12167","volume-title":"STOC 1986: Proceedings of the 18th Annual ACM Symposium on Theory of Computing","author":"M. Luby","year":"1986","unstructured":"Luby, M., Rackoff, C.: Pseudo-random permutation generators and cryptographic composition. In: STOC 1986: Proceedings of the 18th Annual ACM Symposium on Theory of Computing, pp. 356\u2013363. ACM, New York (1986)"},{"key":"24_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/978-3-540-24638-1_23","volume-title":"Theory of Cryptography","author":"U. Maurer","year":"2004","unstructured":"Maurer, U., Pietrzak, K.: Composition of random systems: When two weak make one strong. In: Naor, M. (ed.) TCC 2004. LNCS, vol.\u00a02951, pp. 410\u2013427. Springer, Heidelberg (2004)"},{"key":"24_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/978-3-540-74143-5_8","volume-title":"Advances in Cryptology - CRYPTO 2007","author":"U. Maurer","year":"2007","unstructured":"Maurer, U., Pietrzak, K., Renner, R.: Indistinguishability amplification. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol.\u00a04622, pp. 130\u2013149. Springer, Heidelberg (2007)"},{"key":"24_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/978-3-540-24676-3_12","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"S. Myers","year":"2004","unstructured":"Myers, S.: Black-box composition does not imply adaptive security. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.\u00a03027, pp. 189\u2013206. Springer, Heidelberg (2004)"},{"key":"24_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/11535218_4","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"K. Pietrzak","year":"2005","unstructured":"Pietrzak, K.: Composition does not imply adaptive security. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol.\u00a03621, pp. 55\u201365. Springer, Heidelberg (2005)"},{"key":"24_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1007\/11761679_20","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"K. Pietrzak","year":"2006","unstructured":"Pietrzak, K.: Composition implies adaptive security in minicrypt. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol.\u00a04004, pp. 328\u2013338. Springer, Heidelberg (2006)"},{"issue":"4","key":"24_CR11","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/s00145-003-0220-6","volume":"16","author":"S. Vaudenay","year":"2003","unstructured":"Vaudenay, S.: Decorrelation: A theory for block cipher security. J. Cryptology\u00a016(4), 249\u2013286 (2003)","journal-title":"J. Cryptology"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14623-7_24.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,24]],"date-time":"2025-02-24T01:24:18Z","timestamp":1740360258000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14623-7_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642146220","9783642146237"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14623-7_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}