{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T23:35:29Z","timestamp":1742945729231,"version":"3.40.3"},"publisher-location":"Cham","reference-count":50,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031828409"},{"type":"electronic","value":"9783031828416"}],"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-031-82841-6_3","type":"book-chapter","created":{"date-parts":[[2025,3,12]],"date-time":"2025-03-12T12:24:27Z","timestamp":1741782267000},"page":"56-82","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Provably Secure Online Authenticated Encryption and\u00a0Bidirectional Online Channels"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8835-246X","authenticated-orcid":false,"given":"Arghya","family":"Bhattacharjee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2883-4870","authenticated-orcid":false,"given":"Ritam","family":"Bhaumik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9379-1678","authenticated-orcid":false,"given":"Daniel","family":"Collins","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1029-6576","authenticated-orcid":false,"given":"Mridul","family":"Nandi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,3,13]]},"reference":[{"key":"3_CR1","unstructured":"CAESAR: Competition for Authenticated Encryption: Security, Applicability, and Robustness (2013\u20132019). https:\/\/competitions.cr.yp.to\/caesar-submissions.html"},{"key":"3_CR2","unstructured":"Abed, F., et al.: Poet v2.0. Submission to CAESAR Competition 2013\u20132019. https:\/\/competitions.cr.yp.to\/round2\/poetv20.pdf"},{"key":"3_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/978-3-662-46706-0_11","volume-title":"Fast Software Encryption","author":"F Abed","year":"2015","unstructured":"Abed, F., et al.: Pipelineable on-line encryption. In: Cid, C., Rechberger, C. (eds.) FSE 2014. LNCS, vol. 8540, pp. 205\u2013223. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46706-0_11"},{"key":"3_CR4","doi-asserted-by":"publisher","unstructured":"Albrecht, M.R., Marekov\u00e1, L., Paterson, K.G., Stepanovs, I.: Four attacks and a proof for telegram. In: 43rd IEEE Symposium on Security and Privacy, SP 2022, San Francisco, CA, USA, 22\u201326 May 2022, pp. 87\u2013106. IEEE (2022). https:\/\/doi.org\/10.1109\/SP46214.2022.9833666","DOI":"10.1109\/SP46214.2022.9833666"},{"key":"3_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1007\/978-3-030-81652-0_20","volume-title":"Selected Areas in Cryptography","author":"E Andreeva","year":"2021","unstructured":"Andreeva, E., Bhati, A.S., Viz\u00e1r, D.: Nonce-misuse security of the SAEF authenticated encryption mode. In: Dunkelman, O., Jacobson, Jr., M.J., O\u2019Flynn, C. (eds.) SAC 2020. LNCS, vol. 12804, pp. 512\u2013534. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-81652-0_20"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Andreeva, E., Bhati, A.S., Viz\u00e1r, D.: RUP security of the SAEF authenticated encryption mode. IACR Cryptology ePrint Archive, p.\u00a0103 (2021). https:\/\/eprint.iacr.org\/2021\/103","DOI":"10.1007\/978-3-030-81652-0_20"},{"key":"3_CR7","unstructured":"Andreeva, E., et al.: Primates v1.02. Submission to CAESAR Competition 2013\u20132019. https:\/\/competitions.cr.yp.to\/round2\/primatesv102.pdf"},{"key":"3_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1007\/978-3-662-46706-0_9","volume-title":"Fast Software Encryption","author":"E Andreeva","year":"2015","unstructured":"Andreeva, E., et al.: APE: authenticated permutation-based encryption for lightweight cryptography. In: Cid, C., Rechberger, C. (eds.) FSE 2014. LNCS, vol. 8540, pp. 168\u2013186. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46706-0_9"},{"key":"3_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/978-3-662-45611-8_6","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2014","author":"E Andreeva","year":"2014","unstructured":"Andreeva, E., Bogdanov, A., Luykx, A., Mennink, B., Mouha, N., Yasuda, K.: How to securely release unverified plaintext in authenticated encryption. In: Sarkar, P., Iwata, T. (eds.) ASIACRYPT 2014. LNCS, vol. 8873, pp. 105\u2013125. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-45611-8_6"},{"key":"3_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1007\/978-3-642-42033-7_22","volume-title":"Advances in Cryptology - ASIACRYPT 2013","author":"E Andreeva","year":"2013","unstructured":"Andreeva, E., Bogdanov, A., Luykx, A., Mennink, B., Tischhauser, E., Yasuda, K.: Parallelizable and authenticated online ciphers. In: Sako, K., Sarkar, P. (eds.) ASIACRYPT 2013. LNCS, vol. 8269, pp. 424\u2013443. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-42033-7_22"},{"key":"3_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/978-3-030-34621-8_6","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2019","author":"E Andreeva","year":"2019","unstructured":"Andreeva, E., Lallemand, V., Purnal, A., Reyhanitabar, R., Roy, A., Viz\u00e1r, D.: Forkcipher: a new primitive for authenticated encryption of very short messages. In: Galbraith, S.D., Moriai, S. (eds.) ASIACRYPT 2019. LNCS, vol. 11922, pp. 153\u2013182. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34621-8_6"},{"key":"3_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-63697-9_1","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"T Ashur","year":"2017","unstructured":"Ashur, T., Dunkelman, O., Luykx, A.: Boosting authenticated encryption robustness with minimal modifications. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017. LNCS, vol. 10403, pp. 3\u201333. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63697-9_1"},{"key":"3_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/3-540-44647-8_18","volume-title":"Advances in Cryptology \u2014 CRYPTO 2001","author":"M Bellare","year":"2001","unstructured":"Bellare, M., Boldyreva, A., Knudsen, L., Namprempre, C.: Online ciphers and the hash-CBC construction. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 292\u2013309. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44647-8_18"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"Bellare, M., Kohno, T., Namprempre, C.: Authenticated encryption in SSH: provably fixing the SSH binary packet protocol. In: CCS, pp. 1\u201311 (2002)","DOI":"10.1145\/586110.586112"},{"key":"3_CR15","unstructured":"Bellare, M., Rogaway, P.: The game-playing technique (2004)"},{"key":"3_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/3-540-44448-3_24","volume-title":"Advances in Cryptology \u2014 ASIACRYPT 2000","author":"M Bellare","year":"2000","unstructured":"Bellare, M., Rogaway, P.: Encode-then-encipher encryption: how to exploit nonces or redundancy in plaintexts for efficient cryptography. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol. 1976, pp. 317\u2013330. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44448-3_24"},{"key":"3_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1007\/978-3-319-63697-9_21","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"M Bellare","year":"2017","unstructured":"Bellare, M., Singh, A.C., Jaeger, J., Nyayapati, M., Stepanovs, I.: Ratcheted encryption and key exchange: the security of messaging. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017. LNCS, vol. 10403, pp. 619\u2013650. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63697-9_21"},{"key":"3_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-36563-X_1","volume-title":"Topics in Cryptology \u2014 CT-RSA 2003","author":"M Bellare","year":"2003","unstructured":"Bellare, M., Yee, B.: Forward-security in private-key cryptography. In: Joye, M. (ed.) CT-RSA 2003. LNCS, vol. 2612, pp. 1\u201318. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36563-X_1"},{"key":"3_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/11502760_3","volume-title":"Fast Software Encryption","author":"DJ Bernstein","year":"2005","unstructured":"Bernstein, D.J.: The poly1305-AES message-authentication code. In: Gilbert, H., Handschuh, H. (eds.) FSE 2005. LNCS, vol. 3557, pp. 32\u201349. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11502760_3"},{"key":"3_CR20","doi-asserted-by":"publisher","unstructured":"Bhattacharjee, A., L\u00f3pez, C.M., List, E., Nandi, M.: The oribatida v1.3 family of lightweight authenticated encryption schemes. J. Math. Cryptol. 15(1), 305\u2013344 (2021). https:\/\/doi.org\/10.1515\/JMC-2020-0018","DOI":"10.1515\/JMC-2020-0018"},{"key":"3_CR21","doi-asserted-by":"publisher","unstructured":"Bhaumik, R., Nandi, M.: Olef: an inverse-free online cipher. an online SPRP with an optimal inverse-free construction. IACR Trans. Symmetric Cryptol. 2016(2), 30\u201351 (2016). https:\/\/doi.org\/10.13154\/tosc.v2016.i2.30-51","DOI":"10.13154\/tosc.v2016.i2.30-51"},{"key":"3_CR22","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols. In: Proceedings 42nd IEEE Symposium on Foundations of Computer Science, pp. 136\u2013145. IEEE (2001)","DOI":"10.1109\/SFCS.2001.959888"},{"key":"3_CR23","doi-asserted-by":"publisher","unstructured":"Chakraborti, A., Datta, N., Jha, A., Mancillas-L\u00f3pez, C., Nandi, M., Sasaki, Y.: INT-RUP secure lightweight parallel AE modes. IACR Trans. Symmetric Cryptol. 2019(4), 81\u2013118 (2019). https:\/\/doi.org\/10.13154\/TOSC.V2019.I4.81-118","DOI":"10.13154\/TOSC.V2019.I4.81-118"},{"key":"3_CR24","doi-asserted-by":"publisher","unstructured":"Chakraborti, A., Datta, N., Jha, A., Mancillas-L\u00f3pez, C., Nandi, M., Sasaki, Y.: ESTATE: a lightweight and low energy authenticated encryption mode. IACR Trans. Symmetric Cryptol. 2020(S1), 350\u2013389 (2020). https:\/\/doi.org\/10.13154\/TOSC.V2020.IS1.350-389","DOI":"10.13154\/TOSC.V2020.IS1.350-389"},{"key":"3_CR25","doi-asserted-by":"publisher","unstructured":"Chang, D., et al.: Release of unverified plaintext: tight unified model and application to ANYDAE. IACR Trans. Symmetric Cryptol. 2019(4), 119\u2013146 (2019). https:\/\/doi.org\/10.13154\/TOSC.V2019.I4.119-146","DOI":"10.13154\/TOSC.V2019.I4.119-146"},{"key":"3_CR26","doi-asserted-by":"publisher","unstructured":"Datta, N., Dutta, A., Ghosh, S.: INT-RUP security of SAEB and tinyjambu. In: Isobe, T., Sarkar, S. (eds.) INDOCRYPT 2022. LNCS, vol. 13774, pp. 146\u2013170. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22912-1_7","DOI":"10.1007\/978-3-031-22912-1_7"},{"key":"3_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1007\/978-3-030-03332-3_19","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2018","author":"JP Degabriele","year":"2018","unstructured":"Degabriele, J.P., Fischlin, M.: Simulatable channels: extended security that is universally composable and easier to prove. In: Peyrin, T., Galbraith, S. (eds.) ASIACRYPT 2018. LNCS, vol. 11274, pp. 519\u2013550. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03332-3_19"},{"key":"3_CR28","unstructured":"Duong, T., Rizzo, J.: Here come the $$\\oplus $$ ninjas (2011)"},{"key":"3_CR29","unstructured":"Fischlin, M., G\u00fcnther, F., Janson, C.: Robust channels: handling unreliable networks in the record layers of quic and dtls 1.3. Cryptology ePrint Archive, Paper 2020\/718 (2020). https:\/\/eprint.iacr.org\/2020\/718"},{"key":"3_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/978-3-642-34047-5_12","volume-title":"Fast Software Encryption","author":"E Fleischmann","year":"2012","unstructured":"Fleischmann, E., Forler, C., Lucks, S.: McOE: a family of almost foolproof on-line authenticated encryption schemes. In: Canteaut, A. (ed.) FSE 2012. LNCS, vol. 7549, pp. 196\u2013215. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34047-5_12"},{"key":"3_CR31","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Micali, S.: Probabilistic encryption. J. Comput. Syst. Sci. 28(2), 270\u2013299 (1984). https:\/\/doi.org\/10.1016\/0022-0000(84)90070-9","DOI":"10.1016\/0022-0000(84)90070-9"},{"key":"3_CR32","unstructured":"Hasan, M., Chang, D.: Lynx: family of lightweight authenticated encryption schemes based on tweakable blockcipher. IACR Cryptology ePrint Archive, p.\u00a0241 (2023). https:\/\/eprint.iacr.org\/2023\/241"},{"key":"3_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1007\/978-3-662-47989-6_24","volume-title":"Advances in Cryptology \u2013 CRYPTO 2015","author":"VT Hoang","year":"2015","unstructured":"Hoang, V.T., Reyhanitabar, R., Rogaway, P., Viz\u00e1r, D.: Online authenticated-encryption and its nonce-reuse misuse-resistance. In: Gennaro, R., Robshaw, M. (eds.) CRYPTO 2015. LNCS, vol. 9215, pp. 493\u2013517. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-47989-6_24"},{"key":"3_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/978-3-030-88323-2_6","volume-title":"Information Security and Cryptology","author":"L Huguenin-Dumittan","year":"2021","unstructured":"Huguenin-Dumittan, L., Leontiadis, I.: A message franking channel. In: Yu, Yu., Yung, M. (eds.) Inscrypt 2021. LNCS, vol. 13007, pp. 111\u2013128. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-88323-2_6"},{"key":"3_CR35","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":"3_CR36","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":"3_CR37","doi-asserted-by":"publisher","unstructured":"Marson, G.A., Poettering, B.: Security notions for bidirectional channels. IACR Trans. Symmetric Cryptol. 2017(1), 405\u2013426 (2017). https:\/\/doi.org\/10.13154\/tosc.v2017.i1.405-426","DOI":"10.13154\/tosc.v2017.i1.405-426"},{"key":"3_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/978-3-540-30556-9_27","volume-title":"Progress in Cryptology - INDOCRYPT 2004","author":"DA McGrew","year":"2004","unstructured":"McGrew, D.A., Viega, J.: The security and performance of the Galois\/Counter Mode (GCM) of operation. In: Canteaut, A., Viswanathan, K. (eds.) INDOCRYPT 2004. LNCS, vol. 3348, pp. 343\u2013355. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30556-9_27"},{"key":"3_CR39","unstructured":"Naito, Y., Matsui, M., Sakai, Y., Suzuki, D., Sakiyama, K., Sugawara, T.: Saeaes. Submission to NIST Lightweight Cryptography Standardisation Process 2018\u20132023. https:\/\/csrc.nist.gov\/CSRC\/media\/Projects\/lightweight-cryptography\/documents\/round-2\/spec-doc-rnd2\/SAEAES-spec-round2.pdf"},{"key":"3_CR40","doi-asserted-by":"publisher","unstructured":"Naito, Y., Matsui, M., Sugawara, T., Suzuki, D.: SAEB: a lightweight blockcipher-based AEAD mode of operation. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2018(2), 192\u2013217 (2018). https:\/\/doi.org\/10.13154\/TCHES.V2018.I2.192-217","DOI":"10.13154\/TCHES.V2018.I2.192-217"},{"key":"3_CR41","unstructured":"Nandi, M.: On the optimality of non-linear computations of length-preserving encryption schemes. IACR Cryptology ePrint Archive 2015, 414 (2015). http:\/\/eprint.iacr.org\/2015\/414"},{"key":"3_CR42","unstructured":"NIST: Submission requirements and evaluation criteria for the Lightweight Cryptography Standardization Process (2018). https:\/\/csrc.nist.gov\/CSRC\/media\/Projects\/Lightweight-Cryptography\/documents\/final-lwc-submission-requirements-august2018.pdf"},{"key":"3_CR43","doi-asserted-by":"publisher","unstructured":"Rogaway, P.: Authenticated-encryption with associated-data. In: Atluri, V. (ed.) Proceedings of the 9th ACM Conference on Computer and Communications Security, CCS 2002, Washington, DC, USA, 18\u201322 November 2002, pp. 98\u2013107. ACM (2002). https:\/\/doi.org\/10.1145\/586110.586125","DOI":"10.1145\/586110.586125"},{"key":"3_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1007\/978-3-540-25937-4_22","volume-title":"Fast Software Encryption","author":"P Rogaway","year":"2004","unstructured":"Rogaway, P.: Nonce-based symmetric encryption. In: Roy, B., Meier, W. (eds.) FSE 2004. LNCS, vol. 3017, pp. 348\u2013358. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-25937-4_22"},{"key":"3_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/11761679_23","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"P Rogaway","year":"2006","unstructured":"Rogaway, P., Shrimpton, T.: A provable-security treatment of the key-wrap problem. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp. 373\u2013390. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11761679_23"},{"key":"3_CR46","unstructured":"Sasaki, Y., et al.: Minalpher. DIAC 2014: Directions in Authenticated Ciphers 23\u201324 August 2014, Santa Barbara, USA. https:\/\/info.isl.ntt.co.jp\/crypt\/minalpher\/files\/minalpher-diac2014.pdf"},{"key":"3_CR47","unstructured":"Sasaki, Y., et al.: Minalpher v1.1. Submission to CAESAR Competition 2013\u20132019. https:\/\/competitions.cr.yp.to\/round2\/minalpherv11.pdf"},{"key":"3_CR48","unstructured":"Wu, H., Huang, T.: Tinyjambu v2. Submission to NIST Lightweight Cryptography Standardisation Process 2018\u20132023"},{"key":"3_CR49","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/bxab209","author":"H Yan","year":"2022","unstructured":"Yan, H., Vaudenay, S., Collins, D., Caforio, A.: Optimal symmetric ratcheting for secure communication. Comput. J. (2022). https:\/\/doi.org\/10.1093\/comjnl\/bxab209","journal-title":"Comput. J."},{"key":"3_CR50","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/978-3-319-48965-0_19","volume-title":"Cryptology and Network Security","author":"J Zhang","year":"2016","unstructured":"Zhang, J., Wu, W.: Security of online AE schemes in RUP setting. In: Foresti, S., Persiano, G. (eds.) CANS 2016. LNCS, vol. 10052, pp. 319\u2013334. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-48965-0_19"}],"container-title":["Lecture Notes in Computer Science","Selected Areas in Cryptography \u2013 SAC 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-82841-6_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,12]],"date-time":"2025-03-12T12:24:35Z","timestamp":1741782275000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-82841-6_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031828409","9783031828416"],"references-count":50,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-82841-6_3","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":"13 March 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Selected Areas in Cryptography","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Montreal, QC","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","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":"29 August 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 August 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sacrypt2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sacworkshop.org\/SAC24\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}