{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T13:26:40Z","timestamp":1778074000408,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642174001","type":"print"},{"value":"9783642174018","type":"electronic"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-17401-8_6","type":"book-chapter","created":{"date-parts":[[2010,12,1]],"date-time":"2010-12-01T06:36:50Z","timestamp":1291185410000},"page":"69-81","source":"Crossref","is-referenced-by-count":19,"title":["Indifferentiability beyond the Birthday Bound for the Xor of Two Public Random Permutations"],"prefix":"10.1007","author":[{"given":"Avradip","family":"Mandal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jacques","family":"Patarin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Valerie","family":"Nachef","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol.\u00a01070, pp. 307\u2013320. Springer, Heidelberg (1996)"},{"key":"6_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 (1999)"},{"key":"6_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":"6_CR4","series-title":"Lecture Notes in Computer Science","volume-title":"FSE","author":"R. Bhattacharyya","year":"2010","unstructured":"Bhattacharyya, R., Mandal, A., Nandi, M.: Security analysis of the mode of jh hash function. In: beyer, i. (ed.) FSE 2010. LNCS, vol.\u00a06147, Springer, Heidelberg (2010)"},{"key":"6_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/11935230_19","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2006","author":"D. Chang","year":"2006","unstructured":"Chang, D., Lee, S., Nandi, M., Yung, M.: Indifferentiable security analysis of popular hash functions with prefix-free padding. In: Lai, X., Chen, K. (eds.) ASIACRYPT 2006. LNCS, vol.\u00a04284, pp. 283\u2013298. Springer, Heidelberg (2006)"},{"key":"6_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1007\/11535218_26","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"J.C. Coron","year":"2005","unstructured":"Coron, J.C., Dodis, Y., Malinaud, C., Puniya, P.: Merkle-Damg\u00e5rd Revisited: How to Construct a Hash Function. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol.\u00a03621, pp. 430\u2013448. Springer, Heidelberg (2005)"},{"key":"6_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-85174-5_1","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"J.-S. Coron","year":"2008","unstructured":"Coron, J.-S., Patarin, J., Seurin, Y.: The Random Oracle Model and the Ideal Cipher Model are Equivalent. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol.\u00a05157, pp. 1\u201320. Springer, Heidelberg (2008)"},{"key":"6_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1007\/978-3-540-78967-3_12","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"Y. Dodis","year":"2008","unstructured":"Dodis, Y., Pietrzak, K., Puniya, P.: A new mode of operation for block ciphers and length-preserving macs. In: Smart, N.P. (ed.) EUROCRYPT 2008. LNCS, vol.\u00a04965, pp. 198\u2013219. Springer, Heidelberg (2008)"},{"key":"6_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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":"6_CR10","doi-asserted-by":"publisher","first-page":"584","DOI":"10.1090\/S0002-9939-1952-0050579-7","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":"6_CR11","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":"6_CR12","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":"6_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-540-24638-1_2","volume-title":"Theory of Cryptography","author":"U. Maurer","year":"2004","unstructured":"Maurer, U., Renner, R., Holenstein, C.: Indifferentiability Impossibility Results on Reductions, and Applications to the Random Oracle Methodology. In: Naor, M. (ed.) TCC 2004. LNCS, vol.\u00a02951, pp. 21\u201339. Springer, Heidelberg (2004)"},{"key":"6_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/978-3-540-74143-5_11","volume-title":"Advances in Cryptology - CRYPTO 2007","author":"U.M. Maurer","year":"2007","unstructured":"Maurer, U.M., Tessaro, S.: Domain extension of public random functions: Beyond the birthday barrier. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol.\u00a04622, pp. 187\u2013204. Springer, Heidelberg (2007)"},{"key":"6_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/11941378_23","volume-title":"Progress in Cryptology - INDOCRYPT 2006","author":"M. Nandi","year":"2006","unstructured":"Nandi, M.: A simple and unified method of proving indistinguishability. In: Barua, R., Lange, T. (eds.) INDOCRYPT 2006. LNCS, vol.\u00a04329, pp. 317\u2013334. Springer, Heidelberg (2006)"},{"key":"6_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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":"6_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/11734727_25","volume-title":"Information Security and Cryptology - ICISC 2005","author":"J. Patarin","year":"2006","unstructured":"Patarin, J.: On linear systems of equations with distinct variables and Small block size. In: Won, D.H., Kim, S. (eds.) ICISC 2005. LNCS, vol.\u00a03935, pp. 299\u2013321. Springer, Heidelberg (2006)"},{"key":"6_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/978-3-540-68164-9_14","volume-title":"Progress in Cryptology \u2013 AFRICACRYPT 2008","author":"J. Patarin","year":"2008","unstructured":"Patarin, J.: A proof of security in O(2\n                    n\n                  ) for the Benes schemes. In: Vaudenay, S. (ed.) AFRICACRYPT 2008. LNCS, vol.\u00a05023, pp. 209\u2013220. Springer, Heidelberg (2008)"},{"key":"6_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/978-3-540-85093-9_22","volume-title":"Information Theoretic Security","author":"J. Patarin","year":"2008","unstructured":"Patarin, J.: A Proof of Security in O(2\n                    n\n                  ) for the Xor of Two Random Permutations. In: Safavi-Naini, R. (ed.) ICITS 2008. LNCS, vol.\u00a05155, pp. 232\u2013248. Springer, Heidelberg (2008)"},{"key":"6_CR20","unstructured":"Patarin, J.: A Proof of Security in O(2\n                    n\n                  ) for the Xor of Two Random Permutations - Extended Version. Cryptology ePrint archive: 2008\/010: Listing for 2008 (2008)"},{"key":"6_CR21","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"},{"key":"6_CR22","unstructured":"Seurin, Y.: Primitives et Protocoles cryptographics \u00e0 s\u00e9curit\u00e9 prouv\u00e9e. In: Ph. Thesis. Universit\u00e9 de Versailles - Saint Quentin \u2013 France (2009)"},{"key":"6_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1007\/978-3-540-70583-3_52","volume-title":"Automata, Languages and Programming","author":"T. Shrimpton","year":"2008","unstructured":"Shrimpton, T., Stam, M.: Building a collision-resistant compression function from non-compressing primitives. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part II. LNCS, vol.\u00a05126, pp. 643\u2013654. Springer, Heidelberg (2008)"},{"key":"6_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/978-3-540-85174-5_22","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"M. Stam","year":"2008","unstructured":"Stam, M.: Beyond uniformity: Better security\/efficiency tradeoffs for compression functions. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol.\u00a05157, pp. 397\u2013412. Springer, Heidelberg (2008)"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology - INDOCRYPT 2010"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17401-8_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T19:19:41Z","timestamp":1558293581000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17401-8_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642174001","9783642174018"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17401-8_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}