{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,4]],"date-time":"2025-12-04T09:45:48Z","timestamp":1764841548647},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540345466"},{"type":"electronic","value":"9783540345473"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11761679_20","type":"book-chapter","created":{"date-parts":[[2006,7,4]],"date-time":"2006-07-04T10:11:19Z","timestamp":1152007879000},"page":"328-338","source":"Crossref","is-referenced-by-count":17,"title":["Composition Implies Adaptive Security in Minicrypt"],"prefix":"10.1007","author":[{"given":"Krzysztof","family":"Pietrzak","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"6","key":"20_CR1","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"IT-22","author":"W. Diffie","year":"1976","unstructured":"Diffie, W., Hellman, M.E.: New directions in cryptography. IEEE Transactions on Information Theory\u00a0IT-22(6), 644\u2013654 (1976)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"4","key":"20_CR2","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","volume":"31","author":"T. El-Gamal","year":"1985","unstructured":"El-Gamal, T.: A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Transactions on Information Theory\u00a031(4), 469\u2013472 (1985)","journal-title":"IEEE Transactions on Information Theory"},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"Gertner, Y., Kannan, S., Malkin, T., Reingold, O., Viswanathan, M.: The Relationship between Public Key Encryption and Oblivious Transfer. In: FOCS, pp. 325\u2013335 (2000)","DOI":"10.1109\/SFCS.2000.892121"},{"issue":"4","key":"20_CR4","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":"20_CR5","doi-asserted-by":"crossref","unstructured":"Harnik, D., Naor, M.: On the Compressibility of NP instances and Cryptographic Applications (manuscript, 2005)","DOI":"10.1109\/FOCS.2006.54"},{"key":"20_CR6","unstructured":"Holenstein, T.: Personal Communication (2005)"},{"key":"20_CR7","unstructured":"Holenstein, T.: Immunization of key-agreement schemes, PhD.thesis. PhD thesis, ETH Z\u00fcrich (to appear, 2006)"},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R.: A personal view of average-case complexity. In: Structure in Complexity Theory Conference, pp. 134\u2013147 (1995)","DOI":"10.1109\/SCT.1995.514853"},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., Rudich, S.: Limits on the Provable Consequences of One-way Permutations. In: Proc,\u00a021th ACM Symposium on the Theory of Computing (STOC), pp. 44\u201361 (1989)","DOI":"10.1145\/73007.73012"},{"issue":"3","key":"20_CR10","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1109\/18.256484","volume":"39","author":"U.M. Maurer","year":"1993","unstructured":"Maurer, U.M.: Secret key agreement by public discussion from common information. IEEE Transactions on Information Theory\u00a039(3), 733\u2013742 (1993)","journal-title":"IEEE Transactions on Information Theory"},{"key":"20_CR11","unstructured":"Maurer, U., Pietrzak, K., Renner, R.: Indistinguishability Amplification (manuscript, 2006)"},{"key":"20_CR12","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":"20_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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":"20_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-24638-1_1","volume-title":"Theory of Cryptography","author":"O. Reingold","year":"2004","unstructured":"Reingold, O., Trevisan, L., Vadhan, S.P.: Notions of reducibility between cryptographic primitives. In: Naor, M. (ed.) TCC 2004. LNCS, vol.\u00a02951, pp. 1\u201320. Springer, Heidelberg (2004)"},{"key":"20_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1007\/3-540-46766-1_19","volume-title":"Advances in Cryptology - CRYPTO \u201991","author":"S. Rudich","year":"1992","unstructured":"Rudich, S.: The use of interaction in public cryptosystems (extended abstract). In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol.\u00a0576, pp. 242\u2013251. Springer, Heidelberg (1992)"},{"key":"20_CR16","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1002\/j.1538-7305.1948.tb01338.x","volume":"27","author":"C.E. Shannon","year":"1948","unstructured":"Shannon, C.E.: A mathematical theory of communication. Bell Systems Technical Journal\u00a027, 373\u2013423, 623\u2013656 (1948)","journal-title":"Bell Systems Technical Journal"},{"key":"20_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/11681878_22","volume-title":"Theory of Cryptography","author":"H. Wee","year":"2006","unstructured":"Wee, H.: Finding pessiland. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol.\u00a03876, pp. 429\u2013442. Springer, Heidelberg (2006)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology - EUROCRYPT 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11761679_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,19]],"date-time":"2019-04-19T15:49:58Z","timestamp":1555688998000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11761679_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540345466","9783540345473"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11761679_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}