{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T10:58:27Z","timestamp":1778065107696,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":35,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642033551","type":"print"},{"value":"9783642033568","type":"electronic"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-03356-8_21","type":"book-chapter","created":{"date-parts":[[2009,8,18]],"date-time":"2009-08-18T14:00:39Z","timestamp":1250604039000},"page":"355-373","source":"Crossref","is-referenced-by-count":17,"title":["Computational Indistinguishability Amplification: Tight Product Theorems for System Composition"],"prefix":"10.1007","author":[{"given":"Ueli","family":"Maurer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefano","family":"Tessaro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"21_CR1","doi-asserted-by":"crossref","unstructured":"Bellare, M., Impagliazzo, R., Naor, M.: Does parallel repetition lower the error in computationally sound protocols? In: FOCS 1997, pp. 374\u2013383 (1997)","DOI":"10.1109\/SFCS.1997.646126"},{"key":"21_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/11761679_25","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"M. Bellare","year":"2006","unstructured":"Bellare, M., Rogaway, P.: The security of triple encryption and a framework for code-based game-playing proofs. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol.\u00a04004, pp. 409\u2013426. Springer, Heidelberg (2006)"},{"key":"21_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/978-3-540-30576-7_2","volume-title":"Theory of Cryptography","author":"R. Canetti","year":"2005","unstructured":"Canetti, R., Halevi, S., Steiner, M.: Hardness amplification of weakly verifiable puzzles. In: Kilian, J. (ed.) TCC 2005. LNCS, vol.\u00a03378, pp. 17\u201333. Springer, Heidelberg (2005)"},{"key":"21_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1007\/978-3-540-74143-5_15","volume-title":"Advances in Cryptology - CRYPTO 2007","author":"R. Canetti","year":"2007","unstructured":"Canetti, R., Rivest, R.L., Sudan, M., Trevisan, L., Vadhan, S.P., Wee, H.: Amplifying collision resistance: A complexity-theoretic treatment. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol.\u00a04622, pp. 264\u2013283. Springer, Heidelberg (2007)"},{"key":"21_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1007\/3-540-45708-9_29","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"I.B. Damg\u00e5rd","year":"2002","unstructured":"Damg\u00e5rd, I.B., Nielsen, J.B.: Expanding pseudorandom functions; or: From known-plaintext security to chosen-plaintext security. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442, pp. 449\u2013464. Springer, Heidelberg (2002)"},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"Dodis, Y., Impagliazzo, R., Jaiswal, R., Kabanets, V.: Security amplification for interactive cryptographic primitives. In: TCC 2009. LNCS, vol.\u00a05444, pp. 128\u2013145 (2009)","DOI":"10.1007\/978-3-642-00457-5_9"},{"key":"21_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1007\/978-3-540-24676-3_21","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"C. Dwork","year":"2004","unstructured":"Dwork, C., Naor, M., Reingold, O.: Immunizing encryption schemes from decryption errors. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.\u00a03027, pp. 342\u2013360. Springer, Heidelberg (2004)"},{"issue":"2","key":"21_CR8","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1145\/214438.214442","volume":"3","author":"S. Even","year":"1985","unstructured":"Even, S., Goldreich, O.: On the power of cascade ciphers. ACM Trans. Comput. Syst.\u00a03(2), 108\u2013116 (1985)","journal-title":"ACM Trans. Comput. Syst."},{"key":"21_CR9","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Impagliazzo, R., Levin, L.A., Venkatesan, R., Zuckerman, D.: Security preserving amplification of hardness. In: FOCS 1990, pp. 318\u2013326 (1990)","DOI":"10.1109\/FSCS.1990.89550"},{"key":"21_CR10","unstructured":"Goldreich, O., Nisan, N., Wigderson, A.: On Yao\u2019s XOR-lemma. Electronic Colloquium on Computational Complexity (ECCC)\u00a02(50) (1995)"},{"key":"21_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1007\/11818175_2","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"I. Haitner","year":"2006","unstructured":"Haitner, I., Harnik, D., Reingold, O.: On the power of the randomized iterate. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol.\u00a04117, pp. 22\u201340. Springer, Heidelberg (2006)"},{"key":"21_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"626","DOI":"10.1007\/978-3-540-78524-8_34","volume-title":"Theory of Cryptography","author":"S. Halevi","year":"2008","unstructured":"Halevi, S., Rabin, T.: Degradation and amplification of computational hardness. In: Canetti, R. (ed.) TCC 2008. LNCS, vol.\u00a04948, pp. 626\u2013643. Springer, Heidelberg (2008)"},{"issue":"4","key":"21_CR13","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1137\/S0097539793244708","volume":"28","author":"J. H\u00e5stad","year":"1999","unstructured":"H\u00e5stad, J., Impagliazzo, R., Levin, L.A., Luby, M.: A pseudorandom generator from any one-way function. SIAM Journal on Computing\u00a028(4), 1364\u20131396 (1999)","journal-title":"SIAM Journal on Computing"},{"key":"21_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1007\/978-3-540-30574-3_13","volume-title":"Topics in Cryptology \u2013 CT-RSA 2005","author":"A. Herzberg","year":"2005","unstructured":"Herzberg, A.: On tolerant cryptographic constructions. In: Menezes, A. (ed.) CT-RSA 2005. LNCS, vol.\u00a03376, pp. 172\u2013190. Springer, Heidelberg (2005)"},{"key":"21_CR15","doi-asserted-by":"crossref","unstructured":"Holenstein, T.: Key agreement from weak bit agreement. In: STOC 2005, pp. 664\u2013673 (2005)","DOI":"10.1145\/1060590.1060689"},{"key":"21_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1007\/11535218_29","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"T. Holenstein","year":"2005","unstructured":"Holenstein, T., Renner, R.: One-way secret-key agreement and applications to circuit polarization and immunization of public-key encryption. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol.\u00a03621, pp. 478\u2013493. Springer, Heidelberg (2005)"},{"key":"21_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1007\/978-3-540-70936-7_20","volume-title":"Theory of Cryptography","author":"N. Hopper","year":"2007","unstructured":"Hopper, N., Molnar, D., Wagner, D.: From weak to strong watermarking. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol.\u00a04392, pp. 362\u2013382. Springer, Heidelberg (2007)"},{"key":"21_CR18","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R.: Hard-core distributions for somewhat hard problems. In: FOCS 1995, pp. 538\u2013545 (1995)","DOI":"10.1109\/SFCS.1995.492584"},{"key":"21_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1007\/978-3-540-74143-5_28","volume-title":"Advances in Cryptology - CRYPTO 2007","author":"R. Impagliazzo","year":"2007","unstructured":"Impagliazzo, R., Jaiswal, R., Kabanets, V.: Chernoff-type direct product theorems. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol.\u00a04622, pp. 500\u2013516. Springer, Heidelberg (2007)"},{"issue":"4","key":"21_CR20","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/BF02579323","volume":"7","author":"L.A. Levin","year":"1987","unstructured":"Levin, L.A.: One way functions and pseudorandom generators. Combinatorica\u00a07(4), 357\u2013363 (1987)","journal-title":"Combinatorica"},{"key":"21_CR21","doi-asserted-by":"crossref","unstructured":"Luby, M., Rackoff, C.: Pseudo-random permutation generators and cryptographic composition. In: STOC 1986, pp. 356\u2013363 (1986)","DOI":"10.1145\/12130.12167"},{"key":"21_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/3-540-46035-7_8","volume-title":"Advances in Cryptology - EUROCRYPT 2002","author":"U. Maurer","year":"2002","unstructured":"Maurer, U.: Indistinguishability of random systems. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol.\u00a02332, pp. 110\u2013132. Springer, Heidelberg (2002)"},{"issue":"1","key":"21_CR23","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/BF02620231","volume":"6","author":"U. Maurer","year":"1993","unstructured":"Maurer, U., Massey, J.L.: Cascade ciphers: The importance of being first. Journal of Cryptology\u00a06(1), 55\u201361 (1993)","journal-title":"Journal of Cryptology"},{"key":"21_CR24","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":"21_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1007\/978-3-540-72540-4_29","volume-title":"Advances in Cryptology - EUROCRYPT 2007","author":"U. Maurer","year":"2007","unstructured":"Maurer, U., Sj\u00f6din, J.: A fast and key-efficient reduction of chosen-ciphertext to known-plaintext security. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol.\u00a04515, pp. 498\u2013516. Springer, Heidelberg (2007)"},{"key":"21_CR26","unstructured":"Myers, S.: On the development of block-ciphers and pseudo-random function generators using the composition and XOR operators. Master\u2019s thesis, University of Toronto (1999)"},{"key":"21_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00145-002-0007-1","volume":"16","author":"S. Myers","year":"2003","unstructured":"Myers, S.: Efficient amplification of the security of weak pseudo-random function generators. Journal of Cryptology\u00a016, 1\u201324 (2003)","journal-title":"Journal of Cryptology"},{"issue":"2","key":"21_CR28","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1006\/jcss.1998.1618","volume":"58","author":"M. Naor","year":"1999","unstructured":"Naor, M., Reingold, O.: Synthesizers and their application to the parallel construction of pseudo-random functions. Journal of Computer and System Sciences\u00a058(2), 336\u2013375 (1999)","journal-title":"Journal of Computer and System Sciences"},{"key":"21_CR29","doi-asserted-by":"crossref","unstructured":"Pass, R., Venkitasubramaniam, M.: An efficient parallel repetition theorem for Arthur-Merlin games. In: STOC 2007, pp. 420\u2013429 (2007)","DOI":"10.1145\/1250790.1250853"},{"key":"21_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/978-3-540-70936-7_5","volume-title":"Theory of Cryptography","author":"K. Pietrzak","year":"2007","unstructured":"Pietrzak, K., Wikstr\u00f6m, D.: Parallel repetition of computationally sound protocols revisited. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol.\u00a04392, pp. 86\u2013102. Springer, Heidelberg (2007)"},{"key":"21_CR31","doi-asserted-by":"crossref","unstructured":"Shaltiel, R., Viola, E.: Hardness amplification proofs require majority. In: STOC 2008, pp. 589\u2013598 (2008)","DOI":"10.1145\/1374376.1374461"},{"key":"21_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/BFb0028566","volume-title":"STACS 98","author":"S. Vaudenay","year":"1998","unstructured":"Vaudenay, S.: Provable security for block ciphers by decorrelation. In: Meinel, C., Morvan, M. (eds.) STACS 1998. LNCS, vol.\u00a01373, pp. 249\u2013275. Springer, Heidelberg (1998)"},{"key":"21_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/3-540-46513-8_4","volume-title":"Selected Areas in Cryptography","author":"S. Vaudenay","year":"2000","unstructured":"Vaudenay, S.: Adaptive-attack norm for decorrelation and super-pseudorandomness. In: Heys, H.M., Adams, C.M. (eds.) SAC 1999. LNCS, vol.\u00a01758, pp. 49\u201361. Springer, Heidelberg (2000)"},{"key":"21_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1007\/978-3-540-72540-4_32","volume-title":"Advances in Cryptology - EUROCRYPT 2007","author":"J. Wullschleger","year":"2007","unstructured":"Wullschleger, J.: Oblivious-transfer amplification. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol.\u00a04515, pp. 555\u2013572. Springer, Heidelberg (2007)"},{"key":"21_CR35","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: Theory and applications of trapdoor functions. In: FOCS 1982, pp. 80\u201391 (1982)","DOI":"10.1109\/SFCS.1982.45"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology - CRYPTO 2009"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03356-8_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T12:48:38Z","timestamp":1552135718000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03356-8_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642033551","9783642033568"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03356-8_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}