{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T21:04:03Z","timestamp":1757624643278,"version":"3.44.0"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783032019004"},{"type":"electronic","value":"9783032019011"}],"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_14","type":"book-chapter","created":{"date-parts":[[2025,8,16]],"date-time":"2025-08-16T08:44:55Z","timestamp":1755333895000},"page":"437-466","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Tweakable Permutation-Based Luby-Rackoff Constructions"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8729-6163","authenticated-orcid":false,"given":"Bishwajit","family":"Chakraborty","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abishanka","family":"Saha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,8,17]]},"reference":[{"key":"14_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":"14_CR2","unstructured":"Banik, S., et al.: GIFT-COFB. Cryptology ePrint Archive, Report 2020\/738 (2020). https:\/\/eprint.iacr.org\/2020\/738"},{"key":"14_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-662-53008-5_5","volume-title":"Advances in Cryptology \u2013 CRYPTO 2016","author":"C Beierle","year":"2016","unstructured":"Beierle, C., et al.: The SKINNY family of block ciphers and its low-latency variant MANTIS. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016, Part II. LNCS, vol. 9815, pp. 123\u2013153. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53008-5_5"},{"key":"14_CR4","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\u00a0for\u00a0code-based\u00a0game-playing\u00a0proofs. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp. 409\u2013426. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11761679_25"},{"key":"14_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/978-3-642-55220-5_19","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2014","author":"S Chen","year":"2014","unstructured":"Chen, S., Steinberger, J.: Tight security bounds for key-alternating ciphers. In: Nguyen, P.Q., Oswald, E. (eds.) EUROCRYPT 2014. LNCS, vol. 8441, pp. 327\u2013350. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-55220-5_19"},{"key":"14_CR6","doi-asserted-by":"publisher","unstructured":"Choi, W., Lee, J., Lee, Y.: Toward full n-bit security and nonce misuse resistance of block cipher-based macs. In: Chung, K., Sasaki, Y. (eds.) ASIACRYPT 2024, Part IX. LNCS, vol. 15492, pp. 251\u2013279. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-981-96-0947-5_9","DOI":"10.1007\/978-981-96-0947-5_9"},{"key":"14_CR7","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 _{\\max }$$. In: Hazay, C., Stam, M. (eds.) EUROCRYPT\u00a02023, Part\u00a0IV. LNCS, vol. 14007, pp. 470\u2013501. Springer, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-30634-1_16","DOI":"10.1007\/978-3-031-30634-1_16"},{"key":"14_CR8","doi-asserted-by":"publisher","unstructured":"Dolmatov, V.: GOST 28147-89: Encryption, Decryption, and Message Authentication Code (MAC) Algorithms. RFC 5830 (2010). https:\/\/doi.org\/10.17487\/RFC5830. https:\/\/www.rfc-editor.org\/info\/rfc5830","DOI":"10.17487\/RFC5830"},{"key":"14_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1007\/978-3-540-76900-2_21","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2007","author":"D Goldenberg","year":"2007","unstructured":"Goldenberg, D., Hohenberger, S., Liskov, M., Schwartz, E.C., Seyalioglu, H.: On tweaking luby-rackoff blockciphers. In: Kurosawa, K. (ed.) ASIACRYPT 2007. LNCS, vol. 4833, pp. 342\u2013356. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-76900-2_21"},{"key":"14_CR10","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, 407\u2013440 (2021)","journal-title":"Des. Codes Crypt."},{"key":"14_CR11","doi-asserted-by":"publisher","unstructured":"Iwata, T., Khairallah, M., Minematsu, K., Peyrin, T.: Duel of the titans: the Romulus and Remus families of lightweight AEAD algorithms. IACR Trans. Symmetric Cryptol. 2020(1), 43\u2013120 (2020). https:\/\/doi.org\/10.13154\/tosc.v2020.i1.43-120","DOI":"10.13154\/tosc.v2020.i1.43-120"},{"key":"14_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1007\/978-3-662-45608-8_15","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2014","author":"J Jean","year":"2014","unstructured":"Jean, J., Nikoli\u0107, I., Peyrin, T.: Tweaks and keys for block ciphers: the TWEAKEY framework. In: Sarkar, P., Iwata, T. (eds.) ASIACRYPT 2014, Part II. LNCS, vol. 8874, pp. 274\u2013288. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-45608-8_15"},{"key":"14_CR13","doi-asserted-by":"publisher","unstructured":"Jha, A., Khairallah, M., Nandi, M., Saha, A.: Tight security of TNT and beyond - attacks, proofs and possibilities for the cascaded LRW paradigm. In: Joye, M., Leander, G. (eds.) EUROCRYPT 2024, Part I. LNCS, vol. 14651, pp. 249\u2013279. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-58716-0_9","DOI":"10.1007\/978-3-031-58716-0_9"},{"key":"14_CR14","doi-asserted-by":"publisher","unstructured":"Jha, A., Nandi, M.: Tight security of cascaded LRW2. J. Cryptol. 33(3), 1272\u20131317 (2020). https:\/\/doi.org\/10.1007\/S00145-020-09347-Y","DOI":"10.1007\/S00145-020-09347-Y"},{"key":"14_CR15","unstructured":"Knudsen, L.: Deal-a 128-bit block cipher. Complexity 258(2), 216 (1998)"},{"key":"14_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1007\/978-3-642-21702-9_18","volume-title":"Fast Software Encryption","author":"T Krovetz","year":"2011","unstructured":"Krovetz, T., Rogaway, P.: The software performance of authenticated-encryption modes. In: Joux, A. (ed.) FSE 2011. LNCS, vol. 6733, pp. 306\u2013327. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-21702-9_18"},{"key":"14_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/3-540-45708-9_3","volume-title":"Advances in Cryptology \u2014 CRYPTO 2002","author":"M Liskov","year":"2002","unstructured":"Liskov, M., Rivest, R.L., Wagner, D.: Tweakable block ciphers. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 31\u201346. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45708-9_3"},{"key":"14_CR18","doi-asserted-by":"publisher","unstructured":"Luby, M., Rackoff, C.: Pseudo-random permutation generators and cryptographic composition. In: 18th Annual ACM Symposium on Theory of Computing, Berkeley, CA, USA, pp. 356\u2013363. ACM Press (1986). https:\/\/doi.org\/10.1145\/12130.12167","DOI":"10.1145\/12130.12167"},{"key":"14_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1007\/978-3-030-03810-6_8","volume-title":"Theory of Cryptography","author":"B Mennink","year":"2018","unstructured":"Mennink, B.: Towards tight security of cascaded LRW2. In: Beimel, A., Dziembowski, S. (eds.) TCC 2018, Part II. LNCS, vol. 11240, pp. 192\u2013222. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03810-6_8"},{"key":"14_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"556","DOI":"10.1007\/978-3-319-63697-9_19","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"B Mennink","year":"2017","unstructured":"Mennink, B., Neves, S.: Encrypted Davies-Meyer and its dual: towards optimal security using mirror theory. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017, Part III. LNCS, vol. 10403, pp. 556\u2013583. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63697-9_19"},{"key":"14_CR21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-49530-9","volume-title":"Feistel Ciphers","author":"V Nachef","year":"2017","unstructured":"Nachef, V., Patarin, J., Volte, E.: Feistel Ciphers. Springer, Cham (2017)"},{"key":"14_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/3-540-54303-1_131","volume-title":"EUROCODE \u201990","author":"J Patarin","year":"1991","unstructured":"Patarin, J.: Pseudorandom permutations based on the D.E.S. scheme. In: Cohen, G., Charpin, P. (eds.) EUROCODE 1990. LNCS, vol. 514, pp. 193\u2013204. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/3-540-54303-1_131"},{"key":"14_CR23","unstructured":"Patarin, J.: Etude des G\u00e9n\u00e9rateurs de Permutations Pseudo-al\u00e9atoires Bas\u00e9s sur le Sch\u00e9ma du DES. Ph.D. thesis, Universit\u00e9 de Paris (1991)"},{"key":"14_CR24","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":"14_CR25","doi-asserted-by":"crossref","unstructured":"Patarin, J.: The \u201ccoefficients H\u201d technique. In: Selected Areas in Cryptography - SAC 2008. Revised Selected Papers, pp. 328\u2013345 (2008)","DOI":"10.1007\/978-3-642-04159-4_21"},{"key":"14_CR26","unstructured":"Patarin, J.: Introduction to mirror theory: analysis of systems of linear equalities and linear non equalities for cryptography. IACR Cryptol. ePrint Arch. 287 (2010). http:\/\/eprint.iacr.org\/2010\/287"},{"key":"14_CR27","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 Crypt. 39, 233\u2013245 (2006)","journal-title":"Des. Codes Crypt."},{"key":"14_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/978-3-540-74619-5_12","volume-title":"Fast Software Encryption","author":"T Shirai","year":"2007","unstructured":"Shirai, T., Shibutani, K., Akishita, T., Moriai, S., Iwata, T.: The 128-bit blockcipher CLEFIA (extended abstract). In: Biryukov, A. (ed.) FSE 2007. LNCS, vol. 4593, pp. 181\u2013195. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74619-5_12"}],"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_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T14:57:47Z","timestamp":1757429867000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-01901-1_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783032019004","9783032019011"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-01901-1_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"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"}}]}}