{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,15]],"date-time":"2025-10-15T10:38:19Z","timestamp":1760524699918,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031803079"},{"type":"electronic","value":"9783031803086"}],"license":[{"start":{"date-parts":[[2024,12,13]],"date-time":"2024-12-13T00:00:00Z","timestamp":1734048000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,13]],"date-time":"2024-12-13T00:00:00Z","timestamp":1734048000000},"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-031-80308-6_8","type":"book-chapter","created":{"date-parts":[[2024,12,12]],"date-time":"2024-12-12T04:56:38Z","timestamp":1733979398000},"page":"165-187","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Proving the\u00a0Security of\u00a0the\u00a0Extended Summation-Truncation Hybrid"],"prefix":"10.1007","author":[{"given":"Avijit","family":"Dutta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eik","family":"List","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,12,13]]},"reference":[{"key":"8_CR1","unstructured":"Bellare, M.,\u00a0Impagliazzo, R.: A tool for obtaining tighter security analyses of pseudorandom function based constructions, with applications to prp to prf conversion. Cryptology ePrint Archive, Report 1999\/024 (1999). http:\/\/eprint.iacr.org\/1999\/024"},{"key":"8_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":"8_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/978-3-319-78381-9_15","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"S Bhattacharya","year":"2018","unstructured":"Bhattacharya, S., Nandi, M.: Full indifferentiable security of the xor of two or more random permutations using the $${\\backslash }{\\rm chi} {\\hat{\\,}}2$$ Method. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10820, pp. 387\u2013412. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78381-9_15"},{"key":"8_CR4","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. LNCS, vol. 10403, pp. 497\u2013523. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63697-9_17"},{"issue":"3","key":"8_CR5","doi-asserted-by":"publisher","first-page":"36","DOI":"10.46586\/tosc.v2018.i3.36-92","volume":"2018","author":"N Datta","year":"2018","unstructured":"Datta, N., Dutta, A., Nandi, M., Paul, G.: Double-block hash-then-sum: a paradigm for constructing BBB secure PRF. IACR Trans. Symm. Cryptol. 2018(3), 36\u201392 (2018)","journal-title":"IACR Trans. Symm. Cryptol."},{"key":"8_CR6","doi-asserted-by":"publisher","unstructured":"Dinur, I.: Tight indistinguishability bounds for the xor of independent random permutations by fourier analysis. In: Joye, M., Leander, G. (eds.) EUROCRYPT I, vol. 14651, pp. 33\u201362. Springer, Heidelberg (2024). https:\/\/doi.org\/10.1007\/978-3-031-58716-0_2","DOI":"10.1007\/978-3-031-58716-0_2"},{"key":"8_CR7","unstructured":"Dutta, A., List, E.: Proving the security of the extended summation-truncation hybrid. Cryptology ePrint Archive, Paper 2024\/1723 (2024)"},{"issue":"9","key":"8_CR8","doi-asserted-by":"publisher","first-page":"6218","DOI":"10.1109\/TIT.2022.3171178","volume":"68","author":"A Dutta","year":"2022","unstructured":"Dutta, A., Nandi, M., Saha, A.: Proof of mirror theory for $$\\xi _{\\text{ max }}$$ = 2. IEEE Trans. Inf. Theory 68(9), 6218\u20136232 (2022)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"8_CR9","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1016\/j.dam.2021.01.029","volume":"294","author":"S Gilboa","year":"2021","unstructured":"Gilboa, S., Gueron, S.: The advantage of truncated permutations. Disc. Appl. Math. 294, 214\u2013223 (2021)","journal-title":"Disc. Appl. Math."},{"key":"8_CR10","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":"8_CR11","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":"8_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1007\/11799313_20","volume-title":"Fast Software Encryption","author":"T Iwata","year":"2006","unstructured":"Iwata, T.: New blockcipher modes of operation with beyond the birthday bound security. In: Robshaw, M. (ed.) FSE 2006. LNCS, vol. 4047, pp. 310\u2013327. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11799313_20"},{"key":"8_CR13","first-page":"1087","volume":"2016","author":"T Iwata","year":"2016","unstructured":"Iwata, T., Mennink, B., Viz\u00e1r, D.: CENC is optimally secure. IACR Cryptology ePrint Archive 2016, 1087 (2016)","journal-title":"IACR Cryptology ePrint Archive"},{"issue":"1","key":"8_CR14","doi-asserted-by":"publisher","first-page":"134","DOI":"10.46586\/tosc.v2016.i1.134-157","volume":"2016","author":"T Iwata","year":"2016","unstructured":"Iwata, T., Minematsu, K.: Stronger security variants of GCM-SIV. IACR Trans. Symm. Cryptol. 2016(1), 134\u2013157 (2016)","journal-title":"IACR Trans. Symm. Cryptol."},{"issue":"3","key":"8_CR15","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s00145-021-09397-w","volume":"34","author":"J Jean","year":"2021","unstructured":"Jean, J., Nikolic, I., Peyrin, T., Seurin, Y.: The deoxys AEAD family. J. Cryptol. 34(3), 31 (2021)","journal-title":"J. Cryptol."},{"key":"8_CR16","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":"8_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1007\/978-3-319-70700-6_16","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2017","author":"Y Naito","year":"2017","unstructured":"Naito, Y.: Blockcipher-based MACs: beyond the birthday bound without message length. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT 2017. LNCS, vol. 10626, pp. 446\u2013470. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70700-6_16"},{"key":"8_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1007\/978-3-642-22792-9_34","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"K Yasuda","year":"2011","unstructured":"Yasuda, K.: A new variant of PMAC: beyond the birthday bound. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 596\u2013609. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22792-9_34"},{"key":"8_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1007\/978-3-642-34961-4_19","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2012","author":"L Zhang","year":"2012","unstructured":"Zhang, L., Wu, W., Sui, H., Wang, P.: 3kf9: enhancing 3GPP-MAC beyond the birthday bound. In: Wang, X., Sako, K. (eds.) ASIACRYPT 2012. LNCS, vol. 7658, pp. 296\u2013312. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34961-4_19"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology \u2013 INDOCRYPT 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-80308-6_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,12]],"date-time":"2024-12-12T05:03:09Z","timestamp":1733979789000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-80308-6_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,13]]},"ISBN":["9783031803079","9783031803086"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-80308-6_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024,12,13]]},"assertion":[{"value":"13 December 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"INDOCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Cryptology in India","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chennai","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","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":"18 December 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 December 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"indocrypt2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}