{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T10:54:35Z","timestamp":1778064875304,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540850922","type":"print"},{"value":"9783540850939","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-85093-9_22","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T10:24:37Z","timestamp":1218536677000},"page":"232-248","source":"Crossref","is-referenced-by-count":50,"title":["A Proof of Security in O(2 n ) for the Xor of Two Random Permutations"],"prefix":"10.1007","author":[{"given":"Jacques","family":"Patarin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"22_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/3-540-68339-9_27","volume-title":"Advances in Cryptology - EUROCRYPT \u201996","author":"W. Aiello","year":"1996","unstructured":"Aiello, W., Venkatesan, R.: Foiling Birthday Attacks in Length-Doubling Transformations - Benes: A Non-Reversible Alternative to Feistel. In: Ueli, M. (ed.) EUROCRYPT 1996. LNCS, vol.\u00a01070, pp. 307\u2013320. Springer, Heidelberg (1996)"},{"key":"22_CR2","unstructured":"Bellare, M., Impagliazzo, R.: A Tool for Obtaining Tighter Security Analyses of Pseudorandom Function Based Constructions, with Applications to PRP to PRF Conversion; ePrint Archive 1999\/024: Listing for 1999"},{"key":"22_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/BFb0054132","volume-title":"Advances in Cryptology - EUROCRYPT \u201998","author":"M. Bellare","year":"1998","unstructured":"Bellare, M., Krovetz, T., Rogaway, P.: Luby-Rackoff Backwards: Increasing Security by Making Block Ciphers Non-invertible.. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol.\u00a01403, pp. 266\u2013280. Springer, Heidelberg (1998)"},{"key":"22_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"370","DOI":"10.1007\/BFb0055742","volume-title":"Advances in Cryptology - CRYPTO \u201998","author":"C. Hall","year":"1998","unstructured":"Hall, C., Wagner, D., Kelsey, J., Schneier, B.: Building PRFs from PRPs.. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol.\u00a01462, pp. 370\u2013389. Springer, Heidelberg (1998)"},{"issue":"4","key":"22_CR5","doi-asserted-by":"publisher","first-page":"584","DOI":"10.2307\/2032592","volume":"3","author":"M. Hall Jr.","year":"1952","unstructured":"Hall Jr., M.: A Combinatorial Problem on Abelian Groups. Proceedings of the Americal Mathematical Society\u00a03(4), 584\u2013587 (1952)","journal-title":"Proceedings of the Americal Mathematical Society"},{"key":"22_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1007\/3-540-45539-6_34","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"S. Lucks","year":"2000","unstructured":"Lucks, S.: The Sum of PRPs Is a Secure PRF. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, pp. 470\u2013487. Springer, Heidelberg (2000)"},{"key":"22_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1007\/3-540-39200-9_34","volume-title":"Advances in Cryptology \u2013 EUROCRPYT 2003","author":"U. Maurer","year":"2003","unstructured":"Maurer, U., Pietrzak, K.: The Security of Many-Round Luby-Rackoff Pseudo-Random Permutations. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol.\u00a02656, pp. 544\u2013561. Springer, Heidelberg (2003)"},{"key":"22_CR8","unstructured":"Patarin, J.: A Proof of Security in O(2n) for the Xor of Two Random Permutations - Extended Version; Cryptology ePrint archive: 2008\/010: Listing for 2008"},{"key":"22_CR9","unstructured":"Patarin, J.: Generic Attacks for the Xor of k Random Permutations; Cryptology ePrint archive: 2008\/009: Listing for 2008"},{"key":"22_CR10","unstructured":"Patarin, J.: Etude de G\u00e9n\u00e9rateurs de Permutations Bas\u00e9s sur les Sch\u00e9mas du DES. In: Ph. Thesis. Inria, Domaine de Voluceau, France (1991)"},{"key":"22_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1007\/978-3-540-45146-4_30","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"J. Patarin","year":"2003","unstructured":"Patarin, J.: Luby-Rackoff: 7 Rounds are Enough for 2\n                    n(1\u2009\u2212\u2009\u03b5) Security. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol.\u00a02729, pp. 513\u2013529. Springer, Heidelberg (2003)"},{"key":"22_CR12","first-page":"3","volume":"7","author":"F. Salzborn","year":"1979","unstructured":"Salzborn, F., Szekeres, G.: A Problem in Combinatorial Group Theory. Ars Combinatoria\u00a07, 3\u20135 (1979)","journal-title":"Ars Combinatoria"}],"container-title":["Lecture Notes in Computer Science","Information Theoretic Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85093-9_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:40:49Z","timestamp":1619523649000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-85093-9_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540850922","9783540850939"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85093-9_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[]}}