{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,7]],"date-time":"2026-08-07T15:27:20Z","timestamp":1786116440859,"version":"build-2736575974"},"publisher-location":"Cham","reference-count":48,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032019004","type":"print"},{"value":"9783032019011","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-032-01901-1_13","type":"book-chapter","created":{"date-parts":[[2025,8,16]],"date-time":"2025-08-16T08:44:47Z","timestamp":1755333887000},"page":"404-436","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The Exact Multi-User Security of\u00a0Key-Alternating Feistel Ciphers with\u00a0a\u00a0Single Permutation"],"prefix":"10.1007","author":[{"given":"Yusuke","family":"Naito","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yu","family":"Sasaki","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Takeshi","family":"Sugawara","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,8,17]]},"reference":[{"key":"13_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/3-540-44983-3_4","volume-title":"Selected Areas in Cryptography","author":"K Aoki","year":"2001","unstructured":"Aoki, K., et al.: Camellia: a 128-bit block cipher suitable for multiple platforms \u2014 design and analysis. In: Stinson, D.R., Tavares, S. (eds.) SAC 2000. LNCS, vol. 2012, pp. 39\u201356. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44983-3_4"},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"Barker, E., Mouha, N.: NIST special publication 800-67 rev. 2: Recommendation for the triple data encryption algorithm (TDEA) block cipher (2017)","DOI":"10.6028\/NIST.SP.800-67r2"},{"key":"13_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/978-3-662-53018-4_10","volume-title":"Advances in Cryptology \u2013 CRYPTO 2016","author":"M Bellare","year":"2016","unstructured":"Bellare, M., Tackmann, B.: The multi-user security of authenticated encryption: AES-GCM in TLS 1.3. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016. LNCS, vol. 9814, pp. 247\u2013276. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53018-4_10"},{"issue":"1","key":"13_CR4","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/s10623-023-01288-4","volume":"92","author":"A Bhattacharjee","year":"2024","unstructured":"Bhattacharjee, A., Bhaumik, R., Dutta, A., Nandi, M., Raychaudhuri, A.: BBB security for 5-round Even-Mansour-based key-alternating Feistel ciphers. Des. Codes Cryptogr. 92(1), 13\u201349 (2024)","journal-title":"Des. Codes Cryptogr."},{"key":"13_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/978-3-642-29011-4_5","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"A Bogdanov","year":"2012","unstructured":"Bogdanov, A., Knudsen, L.R., Leander, G., Standaert, F.-X., Steinberger, J., Tischhauser, E.: Key-alternating ciphers in a provable setting: encryption using a small number of public permutations (extended abstract). In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 45\u201362. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_5"},{"key":"13_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/978-3-662-44371-2_3","volume-title":"Advances in Cryptology \u2013 CRYPTO 2014","author":"S Chen","year":"2014","unstructured":"Chen, S., Lampe, R., Lee, J., Seurin, Y., Steinberger, J.: Minimizing the two-round even-Mansour cipher. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014. LNCS, vol. 8616, pp. 39\u201356. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44371-2_3"},{"key":"13_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/978-3-662-47989-6_9","volume-title":"Advances in Cryptology \u2013 CRYPTO 2015","author":"B Cogliati","year":"2015","unstructured":"Cogliati, B., Lampe, R., Seurin, Y.: Tweaking even-Mansour ciphers. In: Gennaro, R., Robshaw, M. (eds.) CRYPTO 2015. LNCS, vol. 9215, pp. 189\u2013208. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-47989-6_9"},{"key":"13_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/978-3-662-48800-3_6","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2015","author":"B Cogliati","year":"2015","unstructured":"Cogliati, B., Seurin, Y.: Beyond-birthday-bound security for tweakable even- Mansour ciphers with linear tweak and key mixing. In: Iwata, T., Cheon, J.H. (eds.) ASIACRYPT 2015. LNCS, vol. 9453, pp. 134\u2013158. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48800-3_6"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Degabriele, J.P., Govinden, J., G\u00fcnther, F., Paterson, K.G.: The security of ChaCha20-Poly1305 in the multi-user setting. In: ACM CCS 2021, pp. 1981\u20132003 (2021)","DOI":"10.1145\/3460120.3484814"},{"key":"13_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1007\/978-3-540-71039-4_7","volume-title":"Fast Software Encryption","author":"H Demirci","year":"2008","unstructured":"Demirci, H., Sel\u00e7uk, A.A.: A meet-in-the-middle attack on 8-round AES. In: Nyberg, K. (ed.) FSE 2008. LNCS, vol. 5086, pp. 116\u2013126. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-71039-4_7"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Dolmatov, V.: GOST 28147-89: Encryption, decryption, and message authentication code (MAC) algorithms. RFC 5830 (2010)","DOI":"10.17487\/rfc5830"},{"key":"13_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1007\/978-3-642-29011-4_21","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"O Dunkelman","year":"2012","unstructured":"Dunkelman, O., Keller, N., Shamir, A.: Minimalism in cryptography: the even-Mansour scheme revisited. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 336\u2013354. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_21"},{"key":"13_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1007\/978-3-030-64837-4_20","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2020","author":"A Dutta","year":"2020","unstructured":"Dutta, A.: Minimizing the two-round tweakable Even-Mansour cipher. In: Moriai, S., Wang, H. (eds.) ASIACRYPT 2020. LNCS, vol. 12491, pp. 601\u2013629. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64837-4_20"},{"issue":"3","key":"13_CR14","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/s001459900025","volume":"10","author":"S Even","year":"1997","unstructured":"Even, S., Mansour, Y.: A construction of a cipher from a single pseudorandom permutation. J. Cryptol. 10(3), 151\u2013161 (1997). https:\/\/doi.org\/10.1007\/s001459900025","journal-title":"J. Cryptol."},{"key":"13_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/978-3-030-75539-3_15","volume-title":"Topics in Cryptology \u2013 CT-RSA 2021","author":"P Farshim","year":"2021","unstructured":"Farshim, P., Khati, L., Seurin, Y., Vergnaud, D.: The key-dependent message security of key-alternating Feistel ciphers. In: Paterson, K.G. (ed.) CT-RSA 2021. LNCS, vol. 12704, pp. 351\u2013374. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-75539-3_15"},{"key":"13_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/978-3-030-03326-2_8","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2018","author":"C Guo","year":"2018","unstructured":"Guo, C., Wang, L.: Revisiting key-alternating Feistel ciphers for shorter keys and multi-user security. In: Peyrin, T., Galbraith, S. (eds.) ASIACRYPT 2018. LNCS, vol. 11272, pp. 213\u2013243. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03326-2_8"},{"issue":"3","key":"13_CR17","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/s10623-020-00820-0","volume":"89","author":"C Guo","year":"2021","unstructured":"Guo, C., Zhang, G.: Beyond-birthday security for permutation-based Feistel networks. Des. Codes Crypt. 89(3), 407\u2013440 (2021). https:\/\/doi.org\/10.1007\/s10623-020-00820-0","journal-title":"Des. Codes Crypt."},{"key":"13_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1007\/978-3-662-45611-8_24","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2014","author":"J Guo","year":"2014","unstructured":"Guo, J., Jean, J., Nikoli\u0107, I., Sasaki, Yu.: Meet-in-the-middle attacks on generic Feistel constructions. In: Sarkar, P., Iwata, T. (eds.) ASIACRYPT 2014. LNCS, vol. 8873, pp. 458\u2013477. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-45611-8_24"},{"key":"13_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-662-53018-4_1","volume-title":"Advances in Cryptology \u2013 CRYPTO 2016","author":"VT Hoang","year":"2016","unstructured":"Hoang, V.T., Tessaro, S.: Key-alternating ciphers and key-length extension: exact bounds and multi-user security. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016. LNCS, vol. 9814, pp. 3\u201332. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53018-4_1"},{"key":"13_CR20","doi-asserted-by":"crossref","unstructured":"Hoang, V.T., Tessaro, S., Thiruvengadam, A.: The multi-user security of GCM, revisited: tight bounds for nonce randomization. In: ACM CCS 2018, pp. 1429\u20131440 (2018)","DOI":"10.1145\/3243734.3243816"},{"key":"13_CR21","unstructured":"ISO: ISO\/TR 18033-3:2010 information technology \u2014 security techniques \u2014 encryption algorithms part 3: Block ciphers (2010)"},{"key":"13_CR22","unstructured":"ISO: ISO\/IEC 29192-2:2019 information security \u2014 lightweight cryptography part 2: Block ciphers (2019)"},{"key":"13_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1007\/978-3-642-42033-7_24","volume-title":"Advances in Cryptology - ASIACRYPT 2013","author":"T Isobe","year":"2013","unstructured":"Isobe, T., Shibutani, K.: Generic key recovery attack on Feistel scheme. In: Sako, K., Sarkar, P. (eds.) ASIACRYPT 2013. LNCS, vol. 8269, pp. 464\u2013485. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-42033-7_24"},{"key":"13_CR24","unstructured":"Knudsen, L.R.: DEAL \u2014 a 128-bit block cipher. NIST AES Proposal (1998)"},{"issue":"3","key":"13_CR25","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/s00145-002-9839-y","volume":"15","author":"LR Knudsen","year":"2002","unstructured":"Knudsen, L.R.: The security of Feistel ciphers with six rounds or less. J. Cryptol. 15(3), 207\u2013222 (2002)","journal-title":"J. Cryptol."},{"key":"13_CR26","doi-asserted-by":"crossref","unstructured":"Lampe, R., Seurin, Y.: Security analysis of key-alternating Feistel ciphers. In: FSE 2014, pp. 243\u2013264 (2014)","DOI":"10.1007\/978-3-662-46706-0_13"},{"key":"13_CR27","doi-asserted-by":"crossref","unstructured":"Luby, M., Rackoff, C.: Pseudo-random permutation generators and cryptographic composition. In: STOC 1986, pp. 356\u2013363. ACM (1986)","DOI":"10.1145\/12130.12167"},{"key":"13_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1007\/978-3-319-70697-9_20","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2017","author":"A Luykx","year":"2017","unstructured":"Luykx, A., Mennink, B., Paterson, K.G.: Analyzing multi-key security degradation. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT 2017. LNCS, vol. 10625, pp. 575\u2013605. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70697-9_20"},{"key":"13_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/978-3-662-47989-6_10","volume-title":"Advances in Cryptology \u2013 CRYPTO 2015","author":"N Mouha","year":"2015","unstructured":"Mouha, N., Luykx, A.: Multi-key security: the Even-Mansour construction revisited. In: Gennaro, R., Robshaw, M. (eds.) CRYPTO 2015. LNCS, vol. 9215, pp. 209\u2013223. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-47989-6_10"},{"key":"13_CR30","doi-asserted-by":"crossref","unstructured":"Nachef, V., Patarin, J., Volte, E.: Feistel Ciphers - Security Proofs and Cryptanalysis (2017)","DOI":"10.1007\/978-3-319-49530-9"},{"key":"13_CR31","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/978-3-031-58868-6_5","volume-title":"CT-RSA 2024","author":"Y Naito","year":"2024","unstructured":"Naito, Y., Sasaki, Y., Sugawara, T.: The exact multi-user security of 2-key triple DES. In: Oswald, E. (ed.) CT-RSA 2024. LNCS, vol. 14643, pp. 112\u2013135. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-58868-6_5"},{"key":"13_CR32","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/978-3-031-58716-0_4","volume-title":"EUROCRYPT 2024","author":"Y Naito","year":"2024","unstructured":"Naito, Y., Sasaki, Y., Sugawara, T.: The exact multi-user security of (tweakable) key alternating ciphers with a single permutation. In: Joye, M., Leander, G. (eds.) EUROCRYPT 2024. LNCS, vol. 14651, pp. 97\u2013127. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-58716-0_4"},{"key":"13_CR33","doi-asserted-by":"crossref","unstructured":"Naito, Y., Sasaki, Y., Sugawara, T., Yasuda, K.: The multi-user security of triple encryption, revisited: exact security, strengthening, and application to TDES. In: ACM CCS 2022 (2022)","DOI":"10.1145\/3548606.3560674"},{"key":"13_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/978-3-642-17401-8_7","volume-title":"Progress in Cryptology - INDOCRYPT 2010","author":"M Nandi","year":"2010","unstructured":"Nandi, M.: The characterization of Luby-Rackoff and its optimum single-key variants. In: Gong, G., Gupta, K.C. (eds.) INDOCRYPT 2010. LNCS, vol. 6498, pp. 82\u201397. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-17401-8_7"},{"key":"13_CR35","unstructured":"NIST: FIPS pub. 46-3: Data encryption standard (1999)"},{"key":"13_CR36","doi-asserted-by":"crossref","unstructured":"Patarin, J.: Pseudorandom permutations based on the D.E.S. scheme. In: EUROCODE 1990. pp. 193\u2013204 (1990)","DOI":"10.1007\/3-540-54303-1_131"},{"key":"13_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/3-540-69710-1_8","volume-title":"Fast Software Encryption","author":"J Patarin","year":"1998","unstructured":"Patarin, J.: About Feistel schemes with six (or more) rounds. In: Vaudenay, S. (ed.) FSE 1998. LNCS, vol. 1372, pp. 103\u2013121. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/3-540-69710-1_8"},{"key":"13_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/3-540-45682-1_14","volume-title":"Advances in Cryptology \u2014 ASIACRYPT 2001","author":"J Patarin","year":"2001","unstructured":"Patarin, J.: Generic attacks on Feistel schemes. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 222\u2013238. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45682-1_14"},{"key":"13_CR39","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(1-\\varepsilon)}$$ Security. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 513\u2013529. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45146-4_30"},{"key":"13_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1007\/978-3-540-28628-8_7","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","author":"J Patarin","year":"2004","unstructured":"Patarin, J.: Security of random Feistel schemes with 5 or more rounds. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 106\u2013122. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-28628-8_7"},{"key":"13_CR41","doi-asserted-by":"crossref","unstructured":"Patarin, J.: The \u201cCoefficients H\u201d technique. In: SAC 2008, pp. 328\u2013345 (2008)","DOI":"10.1007\/978-3-642-04159-4_21"},{"issue":"2","key":"13_CR42","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/s10623-005-3562-2","volume":"39","author":"G Piret","year":"2006","unstructured":"Piret, G.: Luby-Rackoff revisited: on the use of permutations as inner functions of a Feistel scheme. Des. Codes Cryptogr. 39(2), 233\u2013245 (2006)","journal-title":"Des. Codes Cryptogr."},{"key":"13_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1007\/3-540-44598-6_24","volume-title":"Advances in Cryptology \u2014 CRYPTO 2000","author":"Z Ramzan","year":"2000","unstructured":"Ramzan, Z., Reyzin, L.: On the round security of symmetric-key cryptographic primitives. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol. 1880, pp. 376\u2013393. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44598-6_24"},{"key":"13_CR44","doi-asserted-by":"crossref","unstructured":"Shen, Y., Yan, H., Wang, L., Lai, X.: Secure key-alternating Feistel ciphers without key schedule. Sci. China Inf. Sci. 64(1) (2021)","DOI":"10.1007\/s11432-019-9938-0"},{"key":"13_CR45","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1007\/978-3-030-92078-4_15","volume-title":"ASIACRYPT 2021","author":"S Tessaro","year":"2021","unstructured":"Tessaro, S., Zhang, X.: Tight security for key-alternating ciphers with correlated sub-keys. In: Tibouchi, M., Wang, H. (eds.) ASIACRYPT 2021. LNCS, vol. 13092, pp. 435\u2013464. Springer, Cham. (2021). https:\/\/doi.org\/10.1007\/978-3-030-92078-4_15"},{"key":"13_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-642-02384-2_4","volume-title":"Progress in Cryptology \u2013 AFRICACRYPT 2009","author":"J Treger","year":"2009","unstructured":"Treger, J., Patarin, J.: Generic attacks on Feistel networks with internal permutations. In: Preneel, B. (ed.) AFRICACRYPT 2009. LNCS, vol. 5580, pp. 41\u201359. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02384-2_4"},{"key":"13_CR47","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"662","DOI":"10.1007\/978-3-030-64837-4_22","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2020","author":"Y Wu","year":"2020","unstructured":"Wu, Y., Yu, L., Cao, Z., Dong, X.: Tight security analysis of 3-round key-alternating cipher with a single permutation. In: Moriai, S., Wang, H. (eds.) ASIACRYPT 2020. LNCS, vol. 12491, pp. 662\u2013693. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64837-4_22"},{"key":"13_CR48","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/978-3-031-48615-9_9","volume-title":"TCC 2023","author":"L Yu","year":"2023","unstructured":"Yu, L., Wu, Y., Yu, Y., Cao, Z., Dong, X.: Security proofs for key-alternating ciphers with non-independent round permutations. In: Rothblum, G., Wee, H. (eds.) TCC 2023. LNCS, vol. 14369, pp. 238\u2013267. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-48615-9_9"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-01901-1_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,6]],"date-time":"2026-08-06T09:53:33Z","timestamp":1786010013000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-01901-1_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783032019004","9783032019011"],"references-count":48,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-01901-1_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"17 August 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CRYPTO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Cryptology Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Santa Barbara, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 August 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 August 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"45","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}