{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,26]],"date-time":"2025-04-26T15:44:00Z","timestamp":1745682240155,"version":"3.40.4"},"publisher-location":"Cham","reference-count":40,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031306334"},{"type":"electronic","value":"9783031306341"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-30634-1_18","type":"book-chapter","created":{"date-parts":[[2023,4,14]],"date-time":"2023-04-14T23:03:07Z","timestamp":1681513387000},"page":"532-561","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["XOCB: Beyond-Birthday-Bound Secure Authenticated Encryption Mode with\u00a0Rate-One Computation"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2839-6687","authenticated-orcid":false,"given":"Zhenzhen","family":"Bao","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2166-6421","authenticated-orcid":false,"given":"Seongha","family":"Hwang","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0173-7245","authenticated-orcid":false,"given":"Akiko","family":"Inoue","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2736-6830","authenticated-orcid":false,"given":"Byeonghak","family":"Lee","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5471-9350","authenticated-orcid":false,"given":"Jooyoung","family":"Lee","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3427-6772","authenticated-orcid":false,"given":"Kazuhiko","family":"Minematsu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,4,15]]},"reference":[{"key":"18_CR1","unstructured":"Recommendation for Block Cipher Modes of Operation: Galois\/Counter Mode (GCM) and GMAC. NIST Special Publication 800\u201338D (2007), National Institute of Standards and Technology"},{"key":"18_CR2","doi-asserted-by":"publisher","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, Part I. LNCS, vol. 8873, pp. 105\u2013125. Springer, Heidelberg (Dec 2014). https:\/\/doi.org\/10.1007\/978-3-662-45611-8_6","DOI":"10.1007\/978-3-662-45611-8_6"},{"key":"18_CR3","doi-asserted-by":"publisher","unstructured":"Banik, S., Bogdanov, A., Isobe, T., Shibutani, K., Hiwatari, H., Akishita, T., Regazzoni, F.: Midori: A block cipher for low energy. In: Iwata, T., Cheon, J.H. (eds.) ASIACRYPT 2015, Part II. LNCS, vol. 9453, pp. 411\u2013436. Springer, Heidelberg (Nov \/ Dec 2015). https:\/\/doi.org\/10.1007\/978-3-662-48800-3_17","DOI":"10.1007\/978-3-662-48800-3_17"},{"key":"18_CR4","doi-asserted-by":"publisher","unstructured":"Banik, S., Pandey, S.K., Peyrin, T., Sasaki, Y., Sim, S.M., Todo, Y.: GIFT: A small present - towards reaching the limit of lightweight encryption. In: Fischer, W., Homma, N. (eds.) CHES 2017. LNCS, vol. 10529, pp. 321\u2013345. Springer, Heidelberg (Sep 2017). https:\/\/doi.org\/10.1007\/978-3-319-66787-4_16","DOI":"10.1007\/978-3-319-66787-4_16"},{"key":"18_CR5","doi-asserted-by":"publisher","unstructured":"Beierle, C., Biryukov, A., dos Santos, L.C., Gro\u00dfsch\u00e4dl, J., Perrin, L., Udovenko, A., Velichkov, V., Wang, Q.: Alzette: A 64-bit ARX-box - (feat. CRAX and TRAX). In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020, Part III. LNCS, vol. 12172, pp. 419\u2013448. Springer, Heidelberg (Aug 2020). https:\/\/doi.org\/10.1007\/978-3-030-56877-1_15","DOI":"10.1007\/978-3-030-56877-1_15"},{"key":"18_CR6","doi-asserted-by":"publisher","unstructured":"Bellare, M., Namprempre, C.: Authenticated encryption: Relations among notions and analysis of the generic composition paradigm. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol. 1976, pp. 531\u2013545. Springer, Heidelberg (Dec 2000). https:\/\/doi.org\/10.1007\/3-540-44448-3_41","DOI":"10.1007\/3-540-44448-3_41"},{"key":"18_CR7","doi-asserted-by":"publisher","unstructured":"Bhargavan, K., Leurent, G.: On the practical (in-)security of 64-bit block ciphers: Collision attacks on HTTP over TLS and OpenVPN. In: Weippl, E.R., Katzenbeisser, S., Kruegel, C., Myers, A.C., Halevi, S. (eds.) ACM CCS 2016. pp. 456\u2013467. ACM Press (Oct 2016). https:\/\/doi.org\/10.1145\/2976749.2978423","DOI":"10.1145\/2976749.2978423"},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Bhattacharjee, A., Bhaumik, R., Nandi, M.: Offset-based bbb-secure tweakable block-ciphers with updatable caches. In: INDOCRYPT. Lecture Notes in Computer Science, vol. 13774, pp. 171\u2013194. Springer (2022)","DOI":"10.1007\/978-3-031-22912-1_8"},{"key":"18_CR9","doi-asserted-by":"publisher","unstructured":"Bhaumik, R., Nandi, M.: Improved security for OCB3. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT 2017, Part II. LNCS, vol. 10625, pp. 638\u2013666. Springer, Heidelberg (Dec 2017). https:\/\/doi.org\/10.1007\/978-3-319-70697-9_22","DOI":"10.1007\/978-3-319-70697-9_22"},{"key":"18_CR10","doi-asserted-by":"publisher","unstructured":"Bogdanov, A., Knudsen, L.R., Leander, G., Paar, C., Poschmann, A., Robshaw, M.J.B., Seurin, Y., Vikkelsoe, C.: PRESENT: An ultra-lightweight block cipher. In: Paillier, P., Verbauwhede, I. (eds.) CHES 2007. LNCS, vol. 4727, pp. 450\u2013466. Springer, Heidelberg (Sep 2007). https:\/\/doi.org\/10.1007\/978-3-540-74735-2_31","DOI":"10.1007\/978-3-540-74735-2_31"},{"key":"18_CR11","doi-asserted-by":"publisher","unstructured":"Borghoff, J., Canteaut, A., G\u00fcneysu, T., Kavun, E.B., Kne\u017eevi\u0107, M., Knudsen, L.R., Leander, G., Nikov, V., Paar, C., Rechberger, C., Rombouts, P., Thomsen, S.S., Yal\u00e7in, T.: PRINCE - A low-latency block cipher for pervasive computing applications - extended abstract. In: Wang, X., Sako, K. (eds.) ASIACRYPT 2012. LNCS, vol. 7658, pp. 208\u2013225. Springer, Heidelberg (Dec 2012). https:\/\/doi.org\/10.1007\/978-3-642-34961-4_14","DOI":"10.1007\/978-3-642-34961-4_14"},{"key":"18_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"697","DOI":"10.1007\/978-3-030-64837-4_23","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2020","author":"W Choi","year":"2020","unstructured":"Choi, W., Lee, B., Lee, Y., Lee, J.: Improved Security Analysis for Nonce-Based Enhanced Hash-then-Mask MACs. In: Moriai, S., Wang, H. (eds.) ASIACRYPT 2020. LNCS, vol. 12491, pp. 697\u2013723. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64837-4_23"},{"key":"18_CR13","unstructured":"Cogliati, B., Dutta, A., Nandi, M., Patarin, J., Saha, A.: Proof of Mirror Theory for any xi_max. Cryptology ePrint Archive, Paper 2022\/686 (2022), https:\/\/eprint.iacr.org\/2022\/686, https:\/\/eprint.iacr.org\/2022\/686"},{"key":"18_CR14","unstructured":"Cogliati, B., Patarin, J.: Mirror theory: A simple proof of the pi+pj theorem with xi_max=2. Cryptology ePrint Archive, Paper 2020\/734 (2020), https:\/\/eprint.iacr.org\/2020\/734, https:\/\/eprint.iacr.org\/2020\/734"},{"key":"18_CR15","doi-asserted-by":"crossref","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). 10.13154\/tosc.v2018.i3.36-92","DOI":"10.46586\/tosc.v2018.i3.36-92"},{"key":"18_CR16","doi-asserted-by":"publisher","unstructured":"Datta, N., Dutta, A., Nandi, M., Yasuda, K.: Encrypt or Decrypt? To Make a Single-Key Beyond Birthday Secure Nonce-Based MAC. In: Shacham, H., Boldyreva, A. (eds.) Advances in Cryptology - CRYPTO 2018 (Proceedings, Part I). LNCS, vol. 10991, pp. 631\u2013661. Springer (2018). https:\/\/doi.org\/10.1007\/978-3-319-96884-1_21","DOI":"10.1007\/978-3-319-96884-1_21"},{"issue":"9","key":"18_CR17","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_max=2. IEEE Transactions on Information Theory 68(9), 6218\u20136232 (2022). https:\/\/doi.org\/10.1109\/TIT.2022.3171178","journal-title":"IEEE Transactions on Information Theory"},{"key":"18_CR18","doi-asserted-by":"publisher","unstructured":"Dutta, A., Nandi, M., Talnikar, S.: Beyond Birthday Bound Secure MAC in Faulty Nonce Model. In: Ishai, Y., Rijmen, V. (eds.) Advances in Cryptology - EUROCRYPT 2019 (Proceedings, Part I). LNCS, vol. 11476, pp. 437\u2013466. Springer (2019). https:\/\/doi.org\/10.1007\/978-3-030-17653-2_15","DOI":"10.1007\/978-3-030-17653-2_15"},{"key":"18_CR19","doi-asserted-by":"publisher","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.) Advances in Cryptology - CRYPTO 2016 (Proceedings, Part I). LNCS, vol. 9814, pp. 3\u201332. Springer (2016). https:\/\/doi.org\/10.1007\/978-3-662-53018-4_1","DOI":"10.1007\/978-3-662-53018-4_1"},{"key":"18_CR20","doi-asserted-by":"publisher","unstructured":"Inoue, A., Iwata, T., Minematsu, K., Poettering, B.: Cryptanalysis of OCB2: Attacks on authenticity and confidentiality. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019, Part I. LNCS, vol. 11692, pp. 3\u201331. Springer, Heidelberg (Aug 2019). https:\/\/doi.org\/10.1007\/978-3-030-26948-7_1","DOI":"10.1007\/978-3-030-26948-7_1"},{"key":"18_CR21","doi-asserted-by":"publisher","unstructured":"Iwata, T.: New blockcipher modes of operation with beyond the birthday bound security. In: Robshaw, M.J.B. (ed.) FSE 2006. LNCS, vol. 4047, pp. 310\u2013327. Springer, Heidelberg (Mar 2006). https:\/\/doi.org\/10.1007\/11799313_20","DOI":"10.1007\/11799313_20"},{"key":"18_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/978-3-540-68164-9_9","volume-title":"Progress in Cryptology \u2013 AFRICACRYPT 2008","author":"T Iwata","year":"2008","unstructured":"Iwata, T.: Authenticated Encryption Mode for Beyond the Birthday Bound Security. In: Vaudenay, S. (ed.) AFRICACRYPT 2008. LNCS, vol. 5023, pp. 125\u2013142. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-68164-9_9"},{"key":"18_CR23","doi-asserted-by":"publisher","unstructured":"Iwata, T., Ohashi, K., Minematsu, K.: Breaking and repairing GCM security proofs. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 31\u201349. Springer, Heidelberg (Aug 2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_3","DOI":"10.1007\/978-3-642-32009-5_3"},{"key":"18_CR24","doi-asserted-by":"publisher","unstructured":"Jha, A., List, E., Minematsu, K., Mishra, S., Nandi, M.: XHX - A framework for optimally secure tweakable block ciphers from classical block ciphers and universal hashing. In: Lange, T., Dunkelman, O. (eds.) LATINCRYPT 2017. LNCS, vol. 11368, pp. 207\u2013227. Springer, Heidelberg (Sep 2017). https:\/\/doi.org\/10.1007\/978-3-030-25283-0_12","DOI":"10.1007\/978-3-030-25283-0_12"},{"key":"18_CR25","doi-asserted-by":"publisher","unstructured":"Katz, J., Yung, M.: Unforgeable encryption and chosen ciphertext secure modes of operation. In: Schneier, B. (ed.) FSE 2000. LNCS, vol. 1978, pp. 284\u2013299. Springer, Heidelberg (Apr 2001). https:\/\/doi.org\/10.1007\/3-540-44706-7_20","DOI":"10.1007\/3-540-44706-7_20"},{"key":"18_CR26","doi-asserted-by":"publisher","unstructured":"Kim, S., Lee, B., Lee, J.: Tight security bounds for double-block hash-then-sum MACs. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020, Part I. LNCS, vol. 12105, pp. 435\u2013465. Springer, Heidelberg (May 2020). https:\/\/doi.org\/10.1007\/978-3-030-45721-1_16","DOI":"10.1007\/978-3-030-45721-1_16"},{"key":"18_CR27","doi-asserted-by":"publisher","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 (Feb 2011). https:\/\/doi.org\/10.1007\/978-3-642-21702-9_18","DOI":"10.1007\/978-3-642-21702-9_18"},{"issue":"3","key":"18_CR28","doi-asserted-by":"publisher","first-page":"588","DOI":"10.1007\/s00145-010-9073-y","volume":"24","author":"M Liskov","year":"2011","unstructured":"Liskov, M., Rivest, R.L., Wagner, D.: Tweakable block ciphers. Journal of Cryptology 24(3), 588\u2013613 (2011). https:\/\/doi.org\/10.1007\/s00145-010-9073-y","journal-title":"Journal of Cryptology"},{"key":"18_CR29","doi-asserted-by":"publisher","unstructured":"Mennink, B.: Optimally secure tweakable blockciphers. In: Leander, G. (ed.) FSE 2015. LNCS, vol. 9054, pp. 428\u2013448. Springer, Heidelberg (Mar 2015). https:\/\/doi.org\/10.1007\/978-3-662-48116-5_21","DOI":"10.1007\/978-3-662-48116-5_21"},{"key":"18_CR30","doi-asserted-by":"publisher","unstructured":"Mennink, B.: Insuperability of the standard versus ideal model gap for tweakable blockcipher security. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017, Part II. LNCS, vol. 10402, pp. 708\u2013732. Springer, Heidelberg (Aug 2017). https:\/\/doi.org\/10.1007\/978-3-319-63715-0_24","DOI":"10.1007\/978-3-319-63715-0_24"},{"key":"18_CR31","doi-asserted-by":"publisher","unstructured":"Naito, Y.: Improved XKX-based AEAD scheme: Removing the birthday terms. In: Lange, T., Dunkelman, O. (eds.) LATINCRYPT 2017. LNCS, vol. 11368, pp. 228\u2013246. Springer, Heidelberg (Sep 2017). https:\/\/doi.org\/10.1007\/978-3-030-25283-0_13","DOI":"10.1007\/978-3-030-25283-0_13"},{"key":"18_CR32","doi-asserted-by":"crossref","unstructured":"Naito, Y.: Tweakable blockciphers for efficient authenticated encryptions with beyond the birthday-bound security. IACR Trans. Symm. Cryptol. 2017(2), 1\u201326 (2017). 10.13154\/tosc.v2017.i2.1-26","DOI":"10.46586\/tosc.v2017.i2.1-26"},{"key":"18_CR33","doi-asserted-by":"publisher","unstructured":"Niwa, Y., Ohashi, K., Minematsu, K., Iwata, T.: GCM security bounds reconsidered. In: Leander, G. (ed.) FSE 2015. LNCS, vol. 9054, pp. 385\u2013407. Springer, Heidelberg (Mar 2015). https:\/\/doi.org\/10.1007\/978-3-662-48116-5_19","DOI":"10.1007\/978-3-662-48116-5_19"},{"key":"18_CR34","unstructured":"Patarin, J.: Introduction to Mirror Theory: Analysis of Systems of Linear Equalities and Linear Non Equalities for Cryptography. IACR Cryptology ePrint Archive, Report 2010\/287 (2010), available at https:\/\/eprint.iacr.org\/2010\/287"},{"key":"18_CR35","unstructured":"Patarin, J.: Mirror Theory and Cryptography. IACR Cryptology ePrint Archive, Report 2016\/702 (2016), available at https:\/\/eprint.iacr.org\/2016\/702"},{"key":"18_CR36","doi-asserted-by":"publisher","unstructured":"Rogaway, P.: Authenticated-encryption with associated-data. In: Atluri, V. (ed.) ACM CCS 2002. pp. 98\u2013107. ACM Press (Nov 2002). https:\/\/doi.org\/10.1145\/586110.586125","DOI":"10.1145\/586110.586125"},{"key":"18_CR37","doi-asserted-by":"publisher","unstructured":"Rogaway, P.: Efficient instantiations of tweakable blockciphers and refinements to modes OCB and PMAC. In: Lee, P.J. (ed.) ASIACRYPT 2004. LNCS, vol. 3329, pp. 16\u201331. Springer, Heidelberg (Dec 2004). https:\/\/doi.org\/10.1007\/978-3-540-30539-2_2","DOI":"10.1007\/978-3-540-30539-2_2"},{"key":"18_CR38","doi-asserted-by":"publisher","unstructured":"Rogaway, P., Bellare, M., Black, J., Krovetz, T.: OCB: A block-cipher mode of operation for efficient authenticated encryption. In: Reiter, M.K., Samarati, P. (eds.) ACM CCS 2001. pp. 196\u2013205. ACM Press (Nov 2001). https:\/\/doi.org\/10.1145\/501983.502011","DOI":"10.1145\/501983.502011"},{"key":"18_CR39","doi-asserted-by":"publisher","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 (May \/ Jun 2006). https:\/\/doi.org\/10.1007\/11761679_23","DOI":"10.1007\/11761679_23"},{"issue":"1","key":"18_CR40","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1109\/JIOT.2019.2953230","volume":"7","author":"Y Sovyn","year":"2020","unstructured":"Sovyn, Y., Khoma, V., Podpora, M.: Comparison of Three CPU-Core Families for IoT Applications in Terms of Security and Performance of AES-GCM. IEEE Internet of Things Journal 7(1), 339\u2013348 (2020). https:\/\/doi.org\/10.1109\/JIOT.2019.2953230","journal-title":"IEEE Internet of Things Journal"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2023"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-30634-1_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,15]],"date-time":"2025-04-15T22:03:47Z","timestamp":1744754627000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-30634-1_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031306334","9783031306341"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-30634-1_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"15 April 2023","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":"Lyon","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 April 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 April 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"42","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurocrypt2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocrypt.iacr.org\/2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"HotCRP","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"415","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"109","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"16","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}