{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T10:59:10Z","timestamp":1778065150665,"version":"3.51.4"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031587153","type":"print"},{"value":"9783031587160","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-58716-0_2","type":"book-chapter","created":{"date-parts":[[2024,4,28]],"date-time":"2024-04-28T03:01:57Z","timestamp":1714273317000},"page":"33-62","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Tight Indistinguishability Bounds for\u00a0the\u00a0XOR of\u00a0Independent Random Permutations by\u00a0Fourier Analysis"],"prefix":"10.1007","author":[{"given":"Itai","family":"Dinur","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,4,29]]},"reference":[{"key":"2_CR1","unstructured":"Bellare, M., Impagliazzo, R.: A tool for obtaining tighter security analyses of pseudorandom function based constructions, with applications to PRP to PRF conversion. IACR Cryptol. ePrint Arch, p.\u00a024 (1999). http:\/\/eprint.iacr.org\/1999\/024"},{"key":"2_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/BFb0054132","volume-title":"Advances in Cryptology \u2014 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. 1403, pp. 266\u2013280. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0054132"},{"key":"2_CR3","doi-asserted-by":"publisher","unstructured":"Bhattacharya, S., Nandi, M.: Revisiting variable output length XOR pseudorandom function. IACR Trans. Symmetric Cryptol. 2018(1), 314\u2013335 (2018). https:\/\/doi.org\/10.13154\/tosc.v2018.i1.314-335","DOI":"10.13154\/tosc.v2018.i1.314-335"},{"key":"2_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/978-3-030-92078-4_12","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2021","author":"S Bhattacharya","year":"2021","unstructured":"Bhattacharya, S., Nandi, M.: Luby-Rackoff backwards with\u00a0more users and\u00a0more security. In: Tibouchi, M., Wang, H. (eds.) ASIACRYPT 2021, Part III. LNCS, vol. 13092, pp. 345\u2013375. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92078-4_12"},{"issue":"4","key":"2_CR5","doi-asserted-by":"publisher","first-page":"1064","DOI":"10.1007\/s00145-018-9295-y","volume":"31","author":"S Chen","year":"2018","unstructured":"Chen, S., Lampe, R., Lee, J., Seurin, Y., Steinberger, J.P.: Minimizing the two-round even-Mansour cipher. J. Cryptol. 31(4), 1064\u20131119 (2018). https:\/\/doi.org\/10.1007\/s00145-018-9295-y","journal-title":"J. Cryptol."},{"key":"2_CR6","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"694","DOI":"10.1007\/978-3-031-38545-2_23","volume-title":"CRYPTO 2023","author":"YL Chen","year":"2023","unstructured":"Chen, Y.L., Choi, W., Lee, C.: Improved multi-user security using the squared-ratio method. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO 2023. LNCS, vol. 14082, pp. 694\u2013724. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38545-2_23"},{"key":"2_CR7","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"682","DOI":"10.1007\/978-3-031-22966-4_23","volume-title":"ASIACRYPT 2022","author":"W Choi","year":"2022","unstructured":"Choi, W., Kim, H., Lee, J., Lee, Y.: Multi-user security of the sum of truncated random permutations. In: Agrawal, S., Lin, D. (eds.) ASIACRYPT 2022. LNCS, vol. 13792, pp. 682\u2013710. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22966-4_23"},{"key":"2_CR8","doi-asserted-by":"publisher","unstructured":"Cogliati, B., Dutta, A., Nandi, M., Patarin, J., Saha, A.: Proof of mirror theory for a wide range of $$\\xi _{\\rm max}$$. In: Hazay, C., Stam, M. (eds.) EUROCRYPT 2023. Lecture Notes in Computer Science, vol. 14007, pp. 470\u2013501. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30634-1_16","DOI":"10.1007\/978-3-031-30634-1_16"},{"key":"2_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/978-3-662-46706-0_15","volume-title":"Fast Software Encryption","author":"B Cogliati","year":"2015","unstructured":"Cogliati, B., Lampe, R., Patarin, J.: The indistinguishability of the XOR of $$k$$ permutations. In: Cid, C., Rechberger, C. (eds.) FSE 2014. LNCS, vol. 8540, pp. 285\u2013302. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46706-0_15"},{"key":"2_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1007\/978-3-319-63697-9_17","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"W Dai","year":"2017","unstructured":"Dai, W., Hoang, V.T., Tessaro, S.: Information-theoretic indistinguishability via the chi-squared method. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017, Part III. LNCS, vol. 10403, pp. 497\u2013523. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63697-9_17"},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"Dinur, I.: Tight indistinguishability bounds for the XOR of independent random permutations by Fourier analysis. IACR Cryptol. ePrint Arch. (2024). http:\/\/eprint.iacr.org\/2024\/338","DOI":"10.1007\/978-3-031-58716-0_2"},{"key":"2_CR12","doi-asserted-by":"publisher","unstructured":"Dutta, A., Nandi, M., Saha, A.: Proof of mirror theory for $$\\xi _{\\rm max}$$ = 2. IEEE Trans. Inf. Theory 68(9), 6218\u20136232 (2022). https:\/\/doi.org\/10.1109\/TIT.2022.3171178","DOI":"10.1109\/TIT.2022.3171178"},{"key":"2_CR13","unstructured":"Eberhard, S.: More on additive triples of bijections (2017). https:\/\/arxiv.org\/abs\/1704.02407"},{"issue":"2","key":"2_CR14","doi-asserted-by":"publisher","first-page":"441","DOI":"10.4171\/JEMS\/841","volume":"21","author":"S Eberhard","year":"2018","unstructured":"Eberhard, S., Manners, F., Mrazovi\u0107, R.: Additive triples of bijections, or the toroidal semiqueens problem. J. Eur. Math. Soc. 21(2), 441\u2013463 (2018). https:\/\/doi.org\/10.4171\/JEMS\/841","journal-title":"J. Eur. Math. Soc."},{"key":"2_CR15","unstructured":"Gessel, I.M., Stanley, R.P.: Algebraic enumeration. In: Handbook of Combinatorics, vol.\u00a02, pp. 1021\u20131061. MIT Press, Cambridge (1996)"},{"key":"2_CR16","series-title":"NCS","doi-asserted-by":"publisher","first-page":"628","DOI":"10.1007\/978-3-031-38548-3_21","volume-title":"CRYPTO 2023","author":"A Gunsing","year":"2023","unstructured":"Gunsing, A., Bhaumik, R., Jha, A., Mennink, B., Shen, Y.: Revisiting the indifferentiability of the sum of permutations. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO 2023. NCS, vol. 14083, pp. 628\u2013660. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38548-3_21"},{"key":"2_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/978-3-030-56784-2_7","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"A Gunsing","year":"2020","unstructured":"Gunsing, A., Mennink, B.: The summation-truncation hybrid: reusing discarded bits for free. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. LNCS, vol. 12170, pp. 187\u2013217. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56784-2_7"},{"key":"2_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1007\/BFb0055742","volume-title":"Advances in Cryptology \u2014 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. 1462, pp. 370\u2013389. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0055742"},{"key":"2_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"454","DOI":"10.1007\/978-3-030-84259-8_16","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"T Liu","year":"2021","unstructured":"Liu, T., Tessaro, S., Vaikuntanathan, V.: The t-wise independence of\u00a0substitution-permutation networks. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12828, pp. 454\u2013483. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84259-8_16"},{"key":"2_CR20","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 \u2014 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. 1807, pp. 470\u2013484. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-45539-6_34"},{"key":"2_CR21","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. 4622, pp. 130\u2013149. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74143-5_8"},{"key":"2_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1007\/978-3-319-28166-7_30","volume-title":"Applied Cryptography and Network Security","author":"B Mennink","year":"2015","unstructured":"Mennink, B., Preneel, B.: On the XOR of multiple random permutations. In: Malkin, T., Kolesnikov, V., Lewko, A.B., Polychronakis, M. (eds.) ACNS 2015. LNCS, vol. 9092, pp. 619\u2013634. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-28166-7_30"},{"key":"2_CR23","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139814782","volume-title":"Analysis of Boolean Functions","author":"R O\u2019Donnell","year":"2014","unstructured":"O\u2019Donnell, R.: Analysis of Boolean Functions. Cambridge University Press, New York (2014)"},{"key":"2_CR24","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(2n) for the Xor of Two Random Permutations. In: Safavi-Naini, R. (ed.) ICITS 2008. LNCS, vol. 5155, pp. 232\u2013248. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85093-9_22"},{"key":"2_CR25","unstructured":"Patarin, J.: Generic attacks for the XOR of K random permutations. IACR Cryptol. ePrint Arch. p.\u00a09 (2008). http:\/\/eprint.iacr.org\/2008\/009"},{"key":"2_CR26","unstructured":"Patarin, J.: Introduction to mirror theory: analysis of systems of linear equalities and linear non equalities for cryptography. IACR Cryptol. ePrint Arch., p.\u00a0287 (2010). http:\/\/eprint.iacr.org\/2010\/287"},{"key":"2_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/978-3-642-38980-1_10","volume-title":"Applied Cryptography and Network Security","author":"J Patarin","year":"2013","unstructured":"Patarin, J.: Generic attacks for the Xor of k random permutations. In: Jacobson, M., Locasto, M., Mohassel, P., Safavi-Naini, R. (eds.) ACNS 2013. LNCS, vol. 7954, pp. 154\u2013169. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38980-1_10"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-58716-0_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T00:02:19Z","timestamp":1777334539000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-58716-0_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031587153","9783031587160"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-58716-0_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"29 April 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EUROCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Conference on the Theory and Applications of Cryptographic Techniques","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Zurich","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Switzerland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 May 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 May 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"43","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurocrypt2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocrypt.iacr.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}