{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,18]],"date-time":"2026-07-18T18:35:53Z","timestamp":1784399753126,"version":"3.55.0"},"publisher-location":"Cham","reference-count":48,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031229688","type":"print"},{"value":"9783031229695","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-22969-5_22","type":"book-chapter","created":{"date-parts":[[2023,1,24]],"date-time":"2023-01-24T11:48:42Z","timestamp":1674560922000},"page":"645-674","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":20,"title":["Exploring SAT for\u00a0Cryptanalysis: (Quantum) Collision Attacks Against 6-Round SHA-3"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8847-6748","authenticated-orcid":false,"given":"Jian","family":"Guo","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0556-6404","authenticated-orcid":false,"given":"Guozhen","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9298-7313","authenticated-orcid":false,"given":"Ling","family":"Song","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2051-8806","authenticated-orcid":false,"given":"Yi","family":"Tu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,1,25]]},"reference":[{"key":"22_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/978-3-319-69453-5_18","volume-title":"Selected Areas in Cryptography \u2013 SAC 2016","author":"M Amy","year":"2017","unstructured":"Amy, M., Di Matteo, O., Gheorghiu, V., Mosca, M., Parent, A., Schanck, J.: Estimating the cost of generic quantum pre-image attacks on SHA-2 and SHA-3. In: Avanzi, R., Heys, H. (eds.) SAC 2016. LNCS, vol. 10532, pp. 317\u2013337. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-69453-5_18"},{"key":"22_CR2","unstructured":"Bertoni, G., Daemen, J., Peeters, M., Van Assche, G.: Sponge functions. In: ECRYPT Hash Workshop, vol. 2007. Citeseer (2007)"},{"key":"22_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/978-3-642-38348-9_19","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2013","author":"G Bertoni","year":"2013","unstructured":"Bertoni, G., Daemen, J., Peeters, M., Van Assche, G.: Keccak. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol. 7881, pp. 313\u2013314. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38348-9_19"},{"key":"22_CR4","unstructured":"Bernstein, D.J.: Second preimages for 6 (7?(8??)) rounds of keccak. NIST mailing list (2010)"},{"key":"22_CR5","unstructured":"Bao, Z., Guo, J., Li, S., Pham, P.: Quantum multi-collision distinguishers (2020)"},{"key":"22_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/BFb0054319","volume-title":"LATIN\u201998: Theoretical Informatics","author":"G Brassard","year":"1998","unstructured":"Brassard, G., H\u00d8yer, P., Tapp, A.: Quantum cryptanalysis of hash and claw-free functions. In: Lucchesi, C.L., Moura, A.V. (eds.) LATIN 1998. LNCS, vol. 1380, pp. 163\u2013169. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0054319"},{"key":"22_CR7","unstructured":"Bertoni, G., Peeters, M., Van Assche, G., et al. The keccak reference (2011)"},{"key":"22_CR8","unstructured":"Chang, D., Kumar, A., Morawiecki, P., Sanadhya, S.K.: 1st and 2nd Preimage Attacks on 7, 8 and 9 Rounds of Keccak-224,256,384,512. SHA-3 workshop, August 2014"},{"key":"22_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/978-3-319-70697-9_8","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2017","author":"A Chailloux","year":"2017","unstructured":"Chailloux, A., Naya-Plasencia, M., Schrottenloher, A.: An efficient quantum collision search algorithm and implications on symmetric cryptography. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT 2017. LNCS, vol. 10625, pp. 211\u2013240. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70697-9_8"},{"key":"22_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1007\/978-3-642-34047-5_25","volume-title":"Fast Software Encryption","author":"I Dinur","year":"2012","unstructured":"Dinur, I., Dunkelman, O., Shamir, A.: New attacks on keccak-224 and keccak-256. In: Canteaut, A. (ed.) FSE 2012. LNCS, vol. 7549, pp. 442\u2013461. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34047-5_25"},{"key":"22_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/978-3-662-43933-3_12","volume-title":"Fast Software Encryption","author":"I Dinur","year":"2014","unstructured":"Dinur, I., Dunkelman, O., Shamir, A.: Collision attacks on up to 5 rounds of SHA-3 using generalized internal differentials. In: Moriai, S. (ed.) FSE 2013. LNCS, vol. 8424, pp. 219\u2013240. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-43933-3_12"},{"issue":"2","key":"22_CR12","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/s00145-012-9142-5","volume":"27","author":"I Dinur","year":"2014","unstructured":"Dinur, I.: Dunkelman, orr, shamir, adi: improved practical attacks on round-reduced keccak. J. Cryptol. 27(2), 183\u2013209 (2014)","journal-title":"J. Cryptol."},{"key":"22_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"727","DOI":"10.1007\/978-3-030-64834-3_25","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2020","author":"X Dong","year":"2020","unstructured":"Dong, X., Sun, S., Shi, D., Gao, F., Wang, X., Hu, L.: Quantum aHashing with Low Quantum Random Access Memories. In: Moriai, S., Wang, H. (eds.) ASIACRYPT 2020. LNCS, vol. 12492, pp. 727\u2013757. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64834-3_25"},{"key":"22_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1007\/978-3-642-34047-5_24","volume-title":"Fast Software Encryption","author":"Joan Daemen","year":"2012","unstructured":"Daemen, Joan, Van Assche, Gilles: Differential propagation analysis of Keccak. In: Canteaut, Anne (ed.) FSE 2012. LNCS, vol. 7549, pp. 422\u2013441. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34047-5_24"},{"key":"22_CR15","unstructured":"Dworkin, M.J.: SHA-3 standard: Permutation-based hash and extendable-output functions (2015)"},{"key":"22_CR16","unstructured":"Guido, B., Joan, D., Micha\u00ebl, P., Gilles, V.A.: Cryptographic sponge functions (2011)"},{"issue":"1","key":"22_CR17","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/s00145-019-09313-3","volume":"33","author":"J Guo","year":"2020","unstructured":"Guo, J.: Liao, Guohong, Liu, Guozhen, Liu, Meicheng, Qiao, Kexin, Song, Ling: Practical collision attacks against round-reduced sha-3. J. Cryptol. 33(1), 228\u2013270 (2020)","journal-title":"J. Cryptol."},{"key":"22_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/978-3-662-53887-6_9","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2016","author":"J Guo","year":"2016","unstructured":"Guo, J., Liu, M., Song, L.: Linear structures: applications to cryptanalysis of round-reduced Keccak. In: Cheon, J.H., Takagi, T. (eds.) ASIACRYPT 2016. LNCS, vol. 10031, pp. 249\u2013274. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53887-6_9"},{"key":"22_CR19","doi-asserted-by":"crossref","unstructured":"Guo, J., Liu, G., Song, L., Tu, Y.: Exploring SAT for cryptanalysis: (Quantum) collision attacks against 6-Round SHA-3 (Full Version) (2022). https:\/\/eprint.iacr.org\/2022\/184","DOI":"10.1007\/978-3-031-22969-5_22"},{"key":"22_CR20","doi-asserted-by":"crossref","unstructured":"Grover, L.K.: A fast quantum mechanical algorithm for database search. In: Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, pp. 212\u2013219 (1996)","DOI":"10.1145\/237814.237866"},{"key":"22_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/978-3-642-31424-7_31","volume-title":"Computer Aided Verification","author":"C-S Han","year":"2012","unstructured":"Han, C.-S., Jiang, J.-H.R.: When Boolean satisfiability meets gaussian elimination in a simplex way. In: Madhusudan, P., Seshia, S.A. (eds.) CAV 2012. LNCS, vol. 7358, pp. 410\u2013426. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31424-7_31"},{"key":"22_CR22","doi-asserted-by":"crossref","unstructured":"He, L., Lin, X., Hongbo, Yu.: Improved preimage attacks on 4-round keccak-224\/256. IACR Trans. Symmetric Cryptol. 2021(1), 217\u2013238 (2021)","DOI":"10.46586\/tosc.v2021.i1.217-238"},{"key":"22_CR23","doi-asserted-by":"crossref","unstructured":"Hosoyamada, A., Sasaki, Y.: Finding hash collisions with quantum computers by using differential trails with smaller probability than birthday bound. In: Advances Cryptology-EUROCRYPT, vol. 249, p. 12106 (2020)","DOI":"10.1007\/978-3-030-45724-2_9"},{"key":"22_CR24","doi-asserted-by":"crossref","unstructured":"Hosoyamada, A., Sasaki, Y.: Quantum collision attacks on reduced sha-256 and sha-512. IACR Cryptol. ePrint Arch. 292 (2021)","DOI":"10.1007\/978-3-030-84242-0_22"},{"key":"22_CR25","doi-asserted-by":"crossref","unstructured":"Lin, X., He, L., Hongbo, Y.: Improved preimage attacks on 3-round KECCAK-224\/256. IACR Trans. Symmetric Cryptol.2021(3), 84\u2013101 (2021)","DOI":"10.46586\/tosc.v2021.i3.84-101"},{"key":"22_CR26","doi-asserted-by":"crossref","unstructured":"Liu, G., Qiu, W., Tu, T.: New techniques for searching differential trails in keccak. IACR Trans. Symmet. Cryptol. 2019, 407\u2013437 (2019)","DOI":"10.46586\/tosc.v2019.i4.407-437"},{"key":"22_CR27","doi-asserted-by":"crossref","unstructured":"Ting Li and Yao Sun. Preimage attacks on round-reduced KECCAK-224\/256 via an allocating approach. In Yuval Ishai and Vincent Rijmen, editors, Advances in Cryptology - EUROCRYPT 2019\u201338th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Darmstadt, Germany, May 19\u201323, 2019, Proceedings, Part III, volume 11478 of LNCS, pages 556\u2013584. Springer, 2019","DOI":"10.1007\/978-3-030-17659-4_19"},{"issue":"4","key":"22_CR28","doi-asserted-by":"publisher","first-page":"39","DOI":"10.46586\/tosc.v2017.i4.39-57","volume":"2017","author":"T Li","year":"2017","unstructured":"Li, T.: Sun, Yao, Liao, Maodong, Wang, Dingkang: Preimage attacks on the round-reduced KECCAK with cross-linear structures. IACR Trans. Symmetric Cryptol. 2017(4), 39\u201357 (2017)","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"22_CR29","doi-asserted-by":"crossref","unstructured":"Mella, S., Daemen, J.J.C., Van Assche, G.: New techniques for trail bounds and application to differential trails in Keccak . IACR Trans. Symmet. Cryptol. 2017(1), 329\u2013357 (2017)","DOI":"10.46586\/tosc.v2017.i1.329-357"},{"key":"22_CR30","unstructured":"Mouha, N., Preneel, B.: Towards finding optimal differential characteristics for ARX: application to salsa20. Cryptology ePrint Archive, Report 2013\/328 (2013). https:\/\/eprint.iacr.org\/2013\/328"},{"key":"22_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/978-3-662-43933-3_13","volume-title":"Fast Software Encryption","author":"P Morawiecki","year":"2014","unstructured":"Morawiecki, P., Pieprzyk, J., Srebrny, M.: Rotational cryptanalysis of round-reduced Keccak. In: Moriai, S. (ed.) FSE 2013. LNCS, vol. 8424, pp. 241\u2013262. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-43933-3_13"},{"issue":"10\u201311","key":"22_CR32","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1016\/j.ipl.2013.03.004","volume":"113","author":"P Morawiecki","year":"2013","unstructured":"Morawiecki, P.: Srebrny, Marian: a sat-based preimage analysis of reduced Keccak hash functions. Inf. Process. Lett. 113(10\u201311), 392\u2013397 (2013)","journal-title":"Inf. Process. Lett."},{"key":"22_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/978-3-642-25578-6_18","volume-title":"Progress in Cryptology \u2013 INDOCRYPT 2011","author":"M Naya-Plasencia","year":"2011","unstructured":"Naya-Plasencia, M., R\u00f6ck, A., Meier, W.: Practical analysis of reduced-round Keccak. In: Bernstein, D.J., Chatterjee, S. (eds.) INDOCRYPT 2011. LNCS, vol. 7107, pp. 236\u2013254. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25578-6_18"},{"key":"22_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/978-3-319-56617-7_8","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2017","author":"K Qiao","year":"2017","unstructured":"Qiao, K., Song, L., Liu, M., Guo, J.: New collision attacks on round-reduced keccak. In: Coron, J.-S., Nielsen, J.B. (eds.) EUROCRYPT 2017. LNCS, vol. 10212, pp. 216\u2013243. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-56617-7_8"},{"key":"22_CR35","unstructured":"SEPARATE DECISION QUEUE. Cadical at the sat race 2019. SAT RACE 2019, p. 8 (2019)"},{"key":"22_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/978-3-030-35423-7_9","volume-title":"Progress in Cryptology \u2013 INDOCRYPT 2019","author":"MS Rajasree","year":"2019","unstructured":"Rajasree, M.S.: Cryptanalysis of round-reduced KECCAK using non-linear structures. In: Hao, F., Ruj, S., Sen Gupta, S. (eds.) INDOCRYPT 2019. LNCS, vol. 11898, pp. 175\u2013192. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-35423-7_9"},{"key":"22_CR37","unstructured":"Soos, M., Biere, A., Heule, M., Jarvisalo, M., Suda, M.: Cryptominisat 5.6 with yalsat at the sat race 2019. In: Proceedings of SAT Race, pp. 14\u201315 (2019)"},{"key":"22_CR38","unstructured":"Soos, M., Devriendt, J., Gocht, S.,. Shaw, A., Meel, K.S.: CryptoMiniSat with CCAnr at the sat competition 2020. In: SAT Competition , p. 27 (2020)"},{"key":"22_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"827","DOI":"10.1007\/11564751_73","volume-title":"Principles and Practice of Constraint Programming - CP 2005","author":"C Sinz","year":"2005","unstructured":"Sinz, C.: Towards an optimal CNF encoding of Boolean cardinality constraints. In: van Beek, P. (ed.) CP 2005. LNCS, vol. 3709, pp. 827\u2013831. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11564751_73"},{"key":"22_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1007\/978-3-319-63715-0_15","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"L Song","year":"2017","unstructured":"Song, L., Liao, G., Guo, J.: Non-full Sbox linearization: applications to collision attacks on round-reduced Keccak. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017. LNCS, vol. 10402, pp. 428\u2013451. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63715-0_15"},{"key":"22_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/978-3-642-02777-2_24","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2009","author":"M Soos","year":"2009","unstructured":"Soos, M., Nohl, K., Castelluccia, C.: Extending SAT solvers to cryptographic problems. In: Kullmann, O. (ed.) SAT 2009. LNCS, vol. 5584, pp. 244\u2013257. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02777-2_24"},{"key":"22_CR42","unstructured":"Soos, M., Nohl, K., Castelluccia, K.: Cryptominisat, SAT Race solver descriptions (2010)"},{"key":"22_CR43","unstructured":"Soos, M.: Cryptominisat v4. SAT Competition, p. 23 (2014)"},{"key":"22_CR44","unstructured":"Soos, M.: The CryptoMiniSat 5 set of solvers at sat competition 2016. In: Proceedings of SAT Competition, p. 28 (2016)"},{"key":"22_CR45","unstructured":"Soos, M., Selman, B., Kautz, H., Devriendt, J., Gocht, S.: CryptoMiniSat with Walksat at the SAT competition 2020. In: SAT Competition 2020, pp. 29 (2020)"},{"key":"22_CR46","doi-asserted-by":"crossref","unstructured":"Sun, L., Wang, W., Wang. M.: More accurate differential properties of led64 and midori64. IACR Trans. Symmet. Cryptol. 2018, 93\u2013123 (2018)","DOI":"10.46586\/tosc.v2018.i3.93-123"},{"key":"22_CR47","doi-asserted-by":"crossref","unstructured":"Sun, L., Wang, W., Wang, W.: Accelerating the search of differential and linear characteristics with the sat method. IACR Trans. Symmet. Cryptol. 2021, 269\u2013315 (2021)","DOI":"10.46586\/tosc.v2021.i1.269-315"},{"key":"22_CR48","doi-asserted-by":"crossref","unstructured":"Van Oorschot, P.C., Wiener, M.J.: Parallel collision search with application to hash functions and discrete logarithms. In: Proceedings of the 2nd ACM Conference on Computer and Communications Security, pp. 210\u2013218 (1994)","DOI":"10.1145\/191177.191231"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2022"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-22969-5_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T01:02:53Z","timestamp":1769216573000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22969-5_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031229688","9783031229695"],"references-count":48,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22969-5_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"25 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ASIACRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Theory and Application of Cryptology and Information Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taipei","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taiwan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 December 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 December 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"asiacrypt2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/asiacrypt.iacr.org\/2022\/","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":"364","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":"98","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":"27% - 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":"10","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)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}