{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T04:04:21Z","timestamp":1742961861180,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":45,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819709441"},{"type":"electronic","value":"9789819709458"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-981-97-0945-8_10","type":"book-chapter","created":{"date-parts":[[2024,2,24]],"date-time":"2024-02-24T20:02:14Z","timestamp":1708804934000},"page":"172-192","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Automatic Search of\u00a0Linear Structure: Applications to\u00a0Keccak and\u00a0Ascon"],"prefix":"10.1007","author":[{"given":"Huina","family":"Li","sequence":"first","affiliation":[]},{"given":"Guozhen","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Haochen","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Peng","family":"Tang","sequence":"additional","affiliation":[]},{"given":"Weidong","family":"Qiu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,2,25]]},"reference":[{"unstructured":"Aumasson, J.P., Meier, W.: Zero-sum distinguishers for reduced Keccak-f and for the core functions of luffa and Hamsi. rump session of Cryptographic Hardware and Embedded Systems-CHES 2009, p. 67 (2009)","key":"10_CR1"},{"key":"10_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"771","DOI":"10.1007\/978-3-030-77870-5_27","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2021","author":"Z Bao","year":"2021","unstructured":"Bao, Z., et al.: Automatic search of meet-in-the-middle preimage attacks on AES-like hashing. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021. LNCS, vol. 12696, pp. 771\u2013804. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77870-5_27"},{"doi-asserted-by":"publisher","unstructured":"Bao, Z., Guo, J., Shi, D., Tu, Y.: Superposition meet-in-the-middle attacks: updates on fundamental security of AES-like hashing. In: Dodis, Y., Shrimpton, T. (eds.) Advances in Cryptology - CRYPTO 2022, CRYPTO 2022. LNCS, vol. 13507, pp. 64\u201393. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15802-5_3","key":"10_CR3","DOI":"10.1007\/978-3-031-15802-5_3"},{"unstructured":"Bertoni, G., Peeters, M., Van Assche, G., et al.: The keccak reference (2011). http:\/\/keccak.noekeon.org","key":"10_CR4"},{"unstructured":"Biere, A.: CADICAL at the SAT Race 2019 (2019). https:\/\/github.com\/arminbiere\/cadical","key":"10_CR5"},{"key":"10_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-19574-7_1","volume-title":"Selected Areas in Cryptography","author":"C Boura","year":"2011","unstructured":"Boura, C., Canteaut, A.: Zero-sum distinguishers for iterated permutations and application to Keccak-f and Hamsi-256. In: Biryukov, A., Gong, G., Stinson, D.R. (eds.) SAC 2010. LNCS, vol. 6544, pp. 1\u201317. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19574-7_1"},{"key":"10_CR7","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":"J Daemen","year":"2012","unstructured":"Daemen, J., Van Assche, G.: Differential propagation analysis of Keccak. In: Canteaut, A. (ed.) FSE 2012. LNCS, vol. 7549, pp. 422\u2013441. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34047-5_24"},{"key":"10_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/978-3-030-77870-5_14","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2021","author":"I Dinur","year":"2021","unstructured":"Dinur, I.: Cryptanalytic applications of the polynomial method for solving multivariate equation systems over GF(2). In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021. LNCS, vol. 12696, pp. 374\u2013403. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77870-5_14"},{"unstructured":"Dobraunig, C., Eichlseder, M., Mendel, F., Schl\u00e4ffer, M.: Ascon v1. 2 submission to the caesar competition, September 15 2016. submission to the caesar competition","key":"10_CR9"},{"key":"10_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1007\/978-3-030-84252-9_10","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"X Dong","year":"2021","unstructured":"Dong, X., Hua, J., Sun, S., Li, Z., Wang, X., Hu, L.: Meet-in-the-middle attacks revisited: key-recovery, collision, and preimage attacks. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12827, pp. 278\u2013308. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84252-9_10"},{"issue":"1","key":"10_CR11","doi-asserted-by":"crossref","first-page":"64","DOI":"10.46586\/tosc.v2022.i1.64-87","volume":"2022","author":"J Erlacher","year":"2022","unstructured":"Erlacher, J., Mendel, F., Eichlseder, M.: Bounds for the security of ascon against differential and linear cryptanalysis. IACR Trans. Symmetric Cryptol. 2022(1), 64\u201387 (2022)","journal-title":"IACR Trans. Symmetric Cryptol."},{"doi-asserted-by":"publisher","unstructured":"Guo, J., Liu, G., Song, L., Tu, Y.: Exploring SAT for cryptanalysis: (Quantum) collision attacks against 6-round SHA-3. In: Agrawal, S., Lin, D. (eds.) Advances in Cryptology - ASIACRYPT 2022, ASIACRYPT 2022, LNCS, vol. 13793, pp. 645\u2013674. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22969-5_22","key":"10_CR12","DOI":"10.1007\/978-3-031-22969-5_22"},{"key":"10_CR13","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"},{"doi-asserted-by":"publisher","unstructured":"He, L., Lin, X., Yu, H.: Improved preimage attacks on 4-round keccak-224\/256. IACR Trans. Symmetric Cryptol. 2021(1), 217\u2013238 (2021). https:\/\/doi.org\/10.46586\/tosc.v2021.i1.217-238","key":"10_CR14","DOI":"10.46586\/tosc.v2021.i1.217-238"},{"unstructured":"He, L., Lin, X., Yu, H.: Improved preimage attacks on round-reduced keccak-384\/512 via restricted linear structures. IACR Cryptol. ePrint Arch. p. 788 (2022)","key":"10_CR15"},{"unstructured":"Hu, K., Peyrin, T.: Revisiting higher-order differential(-Linear) attacks from an Algebraic perspective - applications to Ascon, Grain v1, Xoodoo, and ChaCha. IACR Cryptol. ePrint Arch. p. 1335 (2022)","key":"10_CR16"},{"key":"10_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/978-3-319-56614-6_9","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2017","author":"S Huang","year":"2017","unstructured":"Huang, S., Wang, X., Xu, G., Wang, M., Zhao, J.: Conditional cube attack on reduced-round keccak sponge function. In: Coron, J.-S., Nielsen, J.B. (eds.) EUROCRYPT 2017. LNCS, vol. 10211, pp. 259\u2013288. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-56614-6_9"},{"doi-asserted-by":"publisher","unstructured":"Ignatiev, A., Morgado, A., Marques-Silva, J.: PySAT: a python toolkit for prototyping with SAT oracles. In: SAT, pp. 428\u2013437 (2018). https:\/\/doi.org\/10.1007\/978-3-319-94144-8_26","key":"10_CR18","DOI":"10.1007\/978-3-319-94144-8_26"},{"doi-asserted-by":"publisher","unstructured":"Li, H., He, L., Chen, S., Guo, J., Qiu, W.: Automatic preimage attack framework on ascon using a linearize-and-guess approach 2023(3), 74\u2013100 (2023). https:\/\/doi.org\/10.46586\/tosc.v2023.i3.74-100","key":"10_CR19","DOI":"10.46586\/tosc.v2023.i3.74-100"},{"unstructured":"Li, H., Liu, G., Zhang, H., Hu, K., Guo, J., Qiu, W.: AlgSAT \u2013 a SAT method for search and verification of differential characteristics from algebraic perspective. Cryptology ePrint Archive, Report 2022\/1641 (2022). https:\/\/eprint.iacr.org\/2022\/1641","key":"10_CR20"},{"key":"10_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"556","DOI":"10.1007\/978-3-030-17659-4_19","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"T Li","year":"2019","unstructured":"Li, T., Sun, Y.: Preimage attacks on round-reduced Keccak-224\/256 via an allocating approach. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS, vol. 11478, pp. 556\u2013584. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17659-4_19"},{"doi-asserted-by":"publisher","unstructured":"Li, T., Sun, Y., Liao, M., Wang, D.: Preimage attacks on the round-reduced Keccak with cross-linear structures 2017(4), 39\u201357 (2017). https:\/\/doi.org\/10.13154\/tosc.v2017.i4.39-57","key":"10_CR22","DOI":"10.13154\/tosc.v2017.i4.39-57"},{"doi-asserted-by":"publisher","unstructured":"Lin, X., He, L., Yu, H.: Improved preimage attacks on 3-round Keccak-224\/256. IACR Trans. Symmetric Cryptol. 2021(3), 84\u2013101 (2021). https:\/\/doi.org\/10.46586\/tosc.v2021.i3.84-101","key":"10_CR23","DOI":"10.46586\/tosc.v2021.i3.84-101"},{"unstructured":"Lin, X., He, L., Yu, H.: Practical preimage attack on 3-round keccak-256. IACR Cryptol. ePrint Arch. p. 101 (2023)","key":"10_CR24"},{"key":"10_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/978-3-030-56877-1_8","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"F Liu","year":"2020","unstructured":"Liu, F., Isobe, T., Meier, W.: Automatic verification of differential characteristics: application to reduced Gimli. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. LNCS, vol. 12172, pp. 219\u2013248. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56877-1_8"},{"key":"10_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/978-3-030-90567-5_5","volume-title":"Information Security and Privacy","author":"F Liu","year":"2021","unstructured":"Liu, F., Isobe, T., Meier, W., Yang, Z.: Algebraic attacks on round-reduced Keccak. In: Baek, J., Ruj, S. (eds.) ACISP 2021. LNCS, vol. 13083, pp. 91\u2013110. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-90567-5_5"},{"doi-asserted-by":"publisher","unstructured":"Liu, F., et al.: Analysis of RIPEMD-160: new collision attacks and finding characteristics with MILP. In: Hazay, C., Stam, M. (eds.) Advances in Cryptology - EUROCRYPT 2023, EUROCRYPT 2023. LNCS, vol. 14007, pp. 189\u2013219. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30634-1_7","key":"10_CR27","DOI":"10.1007\/978-3-031-30634-1_7"},{"issue":"4","key":"10_CR28","first-page":"407","volume":"2019","author":"G Liu","year":"2019","unstructured":"Liu, G., Qiu, W., Tu, Y.: New techniques for searching differential trails in Keccak. IACR Trans. Symmetric Cryptol. 2019(4), 407\u2013437 (2019)","journal-title":"IACR Trans. Symmetric Cryptol."},{"doi-asserted-by":"crossref","unstructured":"Marques-Silva, J., Lynce, I., Malik, S.: Conflict-driven clause learning sat solvers. In: Handbook of Satisfiability -. Frontiers in Artificial Intelligence and Applications, vol. 336, 2nd edn., pp. 133\u2013182. IOS Press, Ohmsha (2021)","key":"10_CR29","DOI":"10.3233\/FAIA200987"},{"key":"10_CR30","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":"10_CR31","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1016\/j.ipl.2013.03.004","volume":"113","author":"P Morawiecki","year":"2013","unstructured":"Morawiecki, P., Srebrny, M.: A SAT-based preimage analysis of reduced Keccak hash functions. Inf. Process. Lett. 113(10\u201311), 392\u2013397 (2013)","journal-title":"Inf. Process. Lett."},{"unstructured":"Mouha, N., Preneel, B.: Towards finding optimal differential characteristics for ARX: application to Salsa20. IACR Cryptol. 2013, 328 (2013). https:\/\/eprint.iacr.org\/2013\/328","key":"10_CR32"},{"key":"10_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/978-3-642-34704-7_5","volume-title":"Information Security and Cryptology","author":"N Mouha","year":"2012","unstructured":"Mouha, N., Wang, Q., Gu, D., Preneel, B.: Differential and linear cryptanalysis using mixed-integer linear programming. In: Wu, C.-K., Yung, M., Lin, D. (eds.) Inscrypt 2011. LNCS, vol. 7537, pp. 57\u201376. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34704-7_5"},{"doi-asserted-by":"crossref","unstructured":"Ogawa, T., Liu, Y., Hasegawa, R., Koshimura, M., Fujita, H.: Modulo based CNF encoding of cardinality constraints and its application to maxsat solvers. In: ICTAI, pp. 9\u201317. IEEE Computer Society (2013)","key":"10_CR34","DOI":"10.1109\/ICTAI.2013.13"},{"doi-asserted-by":"publisher","unstructured":"Qin, L., Hua, J., Dong, X., Yan, H., Wang, X.: Meet-in-the-middle preimage attacks on sponge-based hashing. In: Hazay, C., Stam, M. (eds.) Advances in Cryptology - EUROCRYPT 2023, EUROCRYPT 2023, LNCS, vol. 14007, pp. 158\u2013188. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30634-1_6","key":"10_CR35","DOI":"10.1007\/978-3-031-30634-1_6"},{"key":"10_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"},{"issue":"9","key":"10_CR37","doi-asserted-by":"publisher","first-page":"2113","DOI":"10.1007\/s10623-021-00904-5","volume":"89","author":"S Sadeghi","year":"2021","unstructured":"Sadeghi, S., Rijmen, V., Bagheri, N.: Proposing an MILP-based method for the experimental verification of difference-based trails: application to SPECK. SIMECK. Des. Codes Cryptogr. 89(9), 2113\u20132155 (2021). https:\/\/doi.org\/10.1007\/s10623-021-00904-5","journal-title":"SIMECK. Des. Codes Cryptogr."},{"issue":"3","key":"10_CR38","doi-asserted-by":"crossref","first-page":"182","DOI":"10.46586\/tosc.v2018.i3.182-214","volume":"2018","author":"L Song","year":"2018","unstructured":"Song, L., Guo, J.: Cube-attack-like cryptanalysis of round-reduced keccak using MILP. IACR Trans. Symmetric Cryptol. 2018(3), 182\u2013214 (2018)","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"10_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/978-3-030-03329-3_3","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2018","author":"L Song","year":"2018","unstructured":"Song, L., Guo, J., Shi, D., Ling, S.: New MILP modeling: improved conditional cube attacks on Keccak-based constructions. In: Peyrin, T., Galbraith, S. (eds.) ASIACRYPT 2018. LNCS, vol. 11273, pp. 65\u201395. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03329-3_3"},{"key":"10_CR40","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"},{"doi-asserted-by":"publisher","unstructured":"Sun, L., Wang, W., Wang, M.: More accurate differential properties of LED64 and Midori64. IACR Trans. Symmetric Cryptol. 2018(3), 93\u2013123 (2018). https:\/\/doi.org\/10.13154\/tosc.v2018.i3.93-123","key":"10_CR41","DOI":"10.13154\/tosc.v2018.i3.93-123"},{"doi-asserted-by":"publisher","unstructured":"Sun, L., Wang, W., Wang, M.: Accelerating the search of differential and linear characteristics with the SAT Method. IACR Trans. Symmetric Cryptol. 2021(1), 269\u2013315 (2021). https:\/\/doi.org\/10.46586\/tosc.v2021.i1.269-315","key":"10_CR42","DOI":"10.46586\/tosc.v2021.i1.269-315"},{"doi-asserted-by":"publisher","unstructured":"Sun, S., Hu, L., Wang, P., Qiao, K., Ma, X., Song, L.: Automatic security evaluation and (related-key) differential characteristic search: application to SIMON, PRESENT, LBlock, DES(L) and other bit-oriented block ciphers, pp. 158\u2013178 (2014). https:\/\/doi.org\/10.1007\/978-3-662-45611-8_9","key":"10_CR43","DOI":"10.1007\/978-3-662-45611-8_9"},{"unstructured":"The sage developers: SageMath, the sage mathematics software system (Version 9.5s) (2022). https:\/\/www.sagemath.org","key":"10_CR44"},{"doi-asserted-by":"publisher","unstructured":"Wei, C., et al.: Preimage attacks on 4-round Keccak by solving multivariate quadratic systems. In: Park, J.H., Seo, SH. (eds.) Information Security and Cryptology - ICISC 2021. ICISC 2021, LNCS, vol. 13218, pp 195\u2013216. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-08896-4_10","key":"10_CR45","DOI":"10.1007\/978-3-031-08896-4_10"}],"container-title":["Lecture Notes in Computer Science","Information Security and Cryptology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-97-0945-8_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,20]],"date-time":"2025-03-20T21:42:19Z","timestamp":1742506939000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-97-0945-8_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9789819709441","9789819709458"],"references-count":45,"URL":"https:\/\/doi.org\/10.1007\/978-981-97-0945-8_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"25 February 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"Inscrypt","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Information Security and Cryptology","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hangzhou","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","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":"9 December 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cisc2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/inscrypt2023.github.io\/#","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"152","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":"38","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":"7","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":"25% - 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":"4","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)"}}]}}