{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T21:13:10Z","timestamp":1775769190776,"version":"3.50.1"},"publisher-location":"Cham","reference-count":40,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030905668","type":"print"},{"value":"9783030905675","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-90567-5_7","type":"book-chapter","created":{"date-parts":[[2021,11,3]],"date-time":"2021-11-03T18:07:39Z","timestamp":1635962859000},"page":"132-150","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Constructions of Iterative Near-MDS Matrices with the Lowest XOR Count"],"prefix":"10.1007","author":[{"given":"Xiaodan","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenling","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,11,4]]},"reference":[{"key":"7_CR1","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1002\/j.1538-7305.1949.tb00928.x","volume":"28","author":"CE Shannon","year":"1948","unstructured":"Shannon, C.E.: Communication theory of secrecy systems. Bell Syst. Tech. J. 28, 656\u2013715 (1948)","journal-title":"Bell Syst. Tech. J."},{"key":"7_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/11545262_32","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2005","author":"D Canright","year":"2005","unstructured":"Canright, D.: A very compact S-Box for AES. In: Rao, J.R., Sunar, B. (eds.) CHES 2005. LNCS, vol. 3659, pp. 441\u2013455. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11545262_32"},{"key":"7_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/978-3-662-48116-5_23","volume-title":"Fast Software Encryption","author":"SM Sim","year":"2015","unstructured":"Sim, S.M., Khoo, K., Oggier, F., Peyrin, T.: Lightweight MDS involution matrices. In: Leander, G. (ed.) FSE 2015. LNCS, vol. 9054, pp. 471\u2013493. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48116-5_23"},{"key":"7_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/978-3-662-52993-5_6","volume-title":"Fast Software Encryption","author":"M Liu","year":"2016","unstructured":"Liu, M., Sim, S.M.: Lightweight MDS generalized circulant matrices. In: Peyrin, T. (ed.) FSE 2016. LNCS, vol. 9783, pp. 101\u2013120. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-52993-5_6"},{"key":"7_CR5","volume-title":"The Theory of Error Correcting Codes","author":"FJ MacWilliams","year":"1986","unstructured":"MacWilliams, F.J., Sloane, N.: The Theory of Error Correcting Codes. North-Holland Publishing Co., Amsterdam (1986)"},{"key":"7_CR6","volume-title":"The Design of Rijndael: AES-the Advanced Encryption Standard","author":"J Daemen","year":"2013","unstructured":"Daemen, J., Rijmen, V.: The Design of Rijndael: AES-the Advanced Encryption Standard. Springer, New York (2013)"},{"key":"7_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/978-3-540-74619-5_12","volume-title":"Fast Software Encryption","author":"T Shirai","year":"2007","unstructured":"Shirai, T., Shibutani, K., Akishita, T., Moriai, S., Iwata, T.: The 128-bit blockcipher CLEFIA (extended abstract). In: Biryukov, A. (ed.) FSE 2007. LNCS, vol. 4593, pp. 181\u2013195. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74619-5_12"},{"key":"7_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1007\/978-3-642-23951-9_23","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2011","author":"K Shibutani","year":"2011","unstructured":"Shibutani, K., Isobe, T., Hiwatari, H., Mitsuda, A., Akishita, T., Shirai, T.: Piccolo: an ultra-lightweight blockcipher. In: Preneel, B., Takagi, T. (eds.) CHES 2011. LNCS, vol. 6917, pp. 342\u2013357. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-23951-9_23"},{"key":"7_CR9","doi-asserted-by":"publisher","first-page":"1384","DOI":"10.1007\/978-1-4419-5906-5_626","volume-title":"Encyclopedia of Cryptography and Security","author":"PSLM Barreto","year":"2011","unstructured":"Barreto, P.S.L.M., Rijmen, V.: Whirlpool. In: van Tilborg, H.C.A., Jajodia, S. (eds.) Encyclopedia of Cryptography and Security, pp. 1384\u20131385. Springer, Boston (2011). https:\/\/doi.org\/10.1007\/978-1-4419-5906-5_626"},{"key":"7_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/978-3-662-52993-5_7","volume-title":"Fast Software Encryption","author":"Y Li","year":"2016","unstructured":"Li, Y., Wang, M.: On the construction of lightweight circulant involutory MDS matrices. In: Peyrin, T. (ed.) FSE 2016. LNCS, vol. 9783, pp. 121\u2013139. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-52993-5_7"},{"key":"7_CR11","unstructured":"Youssef, A.M., Mister, S., Tavares, S.E.: On the design of linear transformations for substitution permutation encryption networks. In: Proceedings of Selected Areas in Cryptography (SAC 1997), pp. 40\u201348. Springer, Heidelberg (1997)"},{"key":"7_CR12","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1109\/LCOMM.2004.833807","volume":"8","author":"J Lacan","year":"2014","unstructured":"Lacan, J., Fimes, J.: Systematic MDS erasure codes based on Vandermonde matrices. IEEE Commun. Lett. 8, 570\u2013572 (2014)","journal-title":"IEEE Commun. Lett."},{"key":"7_CR13","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/s10623-011-9578-x","volume":"64","author":"M Sajadieh","year":"2012","unstructured":"Sajadieh, M., Dakhilalian, M., Mala, H., et al.: On construction of involutory MDS matrices from Vandermonde matrices in GF(2q). Des. Codes Cryptogr. 64, 287\u2013308 (2012)","journal-title":"Des. Codes Cryptogr."},{"key":"7_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/978-3-642-22792-9_13","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"J Guo","year":"2011","unstructured":"Guo, J., Peyrin, T., Poschmann, A.: The PHOTON family of lightweight hash functions. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 222\u2013239. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22792-9_13"},{"key":"7_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/978-3-642-40588-4_3","volume-title":"Security Engineering and Intelligence Informatics","author":"KC Gupta","year":"2013","unstructured":"Gupta, K.C., Ray, I.G.: On constructions of MDS matrices from companion matrices for lightweight cryptography. In: Cuzzocrea, A., Kittl, C., Simos, D.E., Weippl, E., Xu, L. (eds.) CD-ARES 2013. LNCS, vol. 8128, pp. 29\u201343. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40588-4_3"},{"key":"7_CR16","doi-asserted-by":"publisher","first-page":"95","DOI":"10.46586\/tosc.v2016.i1.95-113","volume":"1","author":"S Sarkar","year":"2016","unstructured":"Sarkar, S., Syed, H.: Lightweight diffusion layer: importance of Toeplitz matrices. IACR Trans. Symmetric Cryptol. 1, 95\u2013113 (2016)","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"7_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1007\/978-3-662-53018-4_23","volume-title":"Advances in Cryptology \u2013 CRYPTO 2016","author":"C Beierle","year":"2016","unstructured":"Beierle, C., Kranz, T., Leander, G.: Lightweight multiplication in $$GF(2^n)$$ with applications to MDS matrices. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016. LNCS, vol. 9814, pp. 625\u2013653. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53018-4_23"},{"key":"7_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1007\/978-3-642-23951-9_22","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2011","author":"J Guo","year":"2011","unstructured":"Guo, J., Peyrin, T., Poschmann, A., Robshaw, M.: The LED block cipher. In: Preneel, B., Takagi, T. (eds.) CHES 2011. LNCS, vol. 6917, pp. 326\u2013341. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-23951-9_22"},{"key":"7_CR19","doi-asserted-by":"publisher","unstructured":"Augot, D., Finiasz, M.: Exhaustive search for small dimension recursive MDS diffusion layers for block ciphers and hash functions. In: IEEE International Symposium on Information Theory - Proceedings, Istanbul, Turkey, 7\u201312 July, pp. 1551\u20131555. IEEE (2013). https:\/\/doi.org\/10.1109\/ISIT.2013.6620487","DOI":"10.1109\/ISIT.2013.6620487"},{"key":"7_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/978-3-642-34047-5_22","volume-title":"Fast Software Encryption","author":"M Sajadieh","year":"2012","unstructured":"Sajadieh, M., Dakhilalian, M., Mala, H., Sepehrdad, P.: Recursive diffusion layers for block ciphers and hash functions. In: Canteaut, A. (ed.) FSE 2012. LNCS, vol. 7549, pp. 385\u2013401. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34047-5_22"},{"key":"7_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/978-3-319-89339-6_4","volume-title":"Progress in Cryptology \u2013 AFRICACRYPT 2018","author":"D Toh","year":"2018","unstructured":"Toh, D., Teo, J., Khoo, K., Sim, S.M.: Lightweight MDS serial-type matrices with minimal fixed XOR count. In: Joux, A., Nitaj, A., Rachidi, T. (eds.) AFRICACRYPT 2018. LNCS, vol. 10831, pp. 51\u201371. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-89339-6_4"},{"key":"7_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/978-3-642-35999-6_23","volume-title":"Selected Areas in Cryptography","author":"S Wu","year":"2013","unstructured":"Wu, S., Wang, M., Wu, W.: Recursive diffusion layers for (lightweight) block ciphers and hash functions. In: Knudsen, L.R., Wu, H. (eds.) SAC 2012. LNCS, vol. 7707, pp. 355\u2013371. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-35999-6_23"},{"key":"7_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1007\/978-3-540-85238-4_13","volume-title":"Mathematical Foundations of Computer Science 2008","author":"J Boyar","year":"2008","unstructured":"Boyar, J., Matthews, P., Peralta, R.: On the shortest linear straight-line program for computing linear forms. In: Ochma\u0144ski, E., Tyszkiewicz, J. (eds.) MFCS 2008. LNCS, vol. 5162, pp. 168\u2013179. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85238-4_13"},{"key":"7_CR24","doi-asserted-by":"publisher","first-page":"48","DOI":"10.46586\/tosc.v2018.i2.48-78","volume":"2","author":"S Duval","year":"2018","unstructured":"Duval, S., Leurent, G.: MDS matrices with lightweight circuits. IACR Trans. Symmetric Cryptol. 2, 48\u201378 (2018)","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"7_CR25","doi-asserted-by":"publisher","first-page":"188","DOI":"10.46586\/tosc.v2017.i4.188-211","volume":"4","author":"T Kranz","year":"2017","unstructured":"Kranz, T., Leander, G., Stoffelen, K., et al.: Shorter linear straight-line programs for MDS matrices. IACR Trans. Symmetric Cryptol. 4, 188\u2013211 (2017)","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"7_CR26","doi-asserted-by":"publisher","first-page":"129","DOI":"10.46586\/tosc.v2017.i1.129-155","volume":"1","author":"C Li","year":"2017","unstructured":"Li, C., Wang, Q.: Design of lightweight linear diffusion layers from near-MDS matrices. IACR Trans. Symmetric Cryptol. 1, 129\u2013155 (2017)","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"7_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/978-3-642-40349-1_9","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2013","author":"B Bilgin","year":"2013","unstructured":"Bilgin, B., Bogdanov, A., Kne\u017eevi\u0107, M., Mendel, F., Wang, Q.: Fides: lightweight authenticated cipher with side-channel resistance for constrained hardware. In: Bertoni, G., Coron, J.-S. (eds.) CHES 2013. LNCS, vol. 8086, pp. 142\u2013158. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40349-1_9"},{"key":"7_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-662-53008-5_5","volume-title":"Advances in Cryptology \u2013 CRYPTO 2016","author":"C Beierle","year":"2016","unstructured":"Beierle, C., et al.: The SKINNY family of block ciphers and its low-latency variant MANTIS. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016. LNCS, vol. 9815, pp. 123\u2013153. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53008-5_5"},{"key":"7_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/978-3-642-34961-4_14","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2012","author":"J Borghoff","year":"2012","unstructured":"Borghoff, J., et al.: PRINCE \u2013 a low-latency block cipher for pervasive computing applications. In: Wang, X., Sako, K. (eds.) ASIACRYPT 2012. LNCS, vol. 7658, pp. 208\u2013225. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34961-4_14"},{"key":"7_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/978-3-662-44371-2_4","volume-title":"Advances in Cryptology \u2013 CRYPTO 2014","author":"MR Albrecht","year":"2014","unstructured":"Albrecht, M.R., Driessen, B., Kavun, E.B., Leander, G., Paar, C., Yal\u00e7\u0131n, T.: Block ciphers \u2013 focus on the linear layer (feat. PRIDE). In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014. LNCS, vol. 8616, pp. 57\u201376. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44371-2_4"},{"key":"7_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/978-3-662-48800-3_17","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2015","author":"S Banik","year":"2015","unstructured":"Banik, S., et al.: Midori: a block cipher for low energy. In: Iwata, T., Cheon, J.H. (eds.) ASIACRYPT 2015. LNCS, vol. 9453, pp. 411\u2013436. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48800-3_17"},{"key":"7_CR32","first-page":"147","volume":"4","author":"S Li","year":"2019","unstructured":"Li, S., Sun, S., Shi, D., et al.: Lightweight iterative MDS matrices: how small can we go? IACR Trans. Symmetric Cryptol. 4, 147\u2013170 (2019)","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"7_CR33","unstructured":"Daemen, J.: Cipher and hash function design, strategies based on linear and differential cryptanalysis. Ph.D. thesis, Katholieke Universiteit Leuven (1995)"},{"key":"7_CR34","first-page":"289","volume":"79","author":"G Viswanath","year":"2006","unstructured":"Viswanath, G., Rajan, B.S.: A matrix characterization of near-MDS codes. Ars Comb. Waterloo Then Winnipeg 79, 289\u2013294 (2006)","journal-title":"Ars Comb. Waterloo Then Winnipeg"},{"key":"7_CR35","doi-asserted-by":"publisher","first-page":"120","DOI":"10.46586\/tosc.v2020.i2.120-145","volume":"2","author":"Z Xiang","year":"2020","unstructured":"Xiang, Z., Zeng, X., Lin, D., et al.: Optimizing implementations of linear layers. IACR Trans. Symmetric Cryptol. 2, 120\u2013145 (2020)","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"7_CR36","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/s12095-018-0296-3","volume":"11","author":"J Boyar","year":"2019","unstructured":"Boyar, J., Find, M.G., Peralta, R.: Small low-depth circuits for cryptographic applications. Cryptogr. Commun. 11, 109\u2013127 (2019)","journal-title":"Cryptogr. Commun."},{"key":"7_CR37","doi-asserted-by":"publisher","first-page":"84","DOI":"10.46586\/tosc.v2019.i1.84-117","volume":"1","author":"S Li","year":"2019","unstructured":"Li, S., Sun, S., Li, C., et al.: Constructing low-latency involutory MDS matrices with lightweight circuits. IACR Trans. Symmetric Cryptol. 1, 84\u2013117 (2019)","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"7_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/978-3-030-17653-2_10","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"L K\u00f6lsch","year":"2019","unstructured":"K\u00f6lsch, L.: XOR-counts and lightweight multiplication with fixed elements in binary finite fields. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS, vol. 11476, pp. 285\u2013312. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17653-2_10"},{"key":"7_CR39","volume-title":"Abstract Algebra","author":"DS Dummit","year":"2004","unstructured":"Dummit, D.S., Foote, R.M.: Abstract Algebra. Wiley, Hoboken (2004)"},{"key":"7_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/978-3-662-44709-3_24","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2014","author":"K Khoo","year":"2014","unstructured":"Khoo, K., Peyrin, T., Poschmann, A.Y., Yap, H.: FOAM: searching for hardware-optimal SPN structures and components with a fair comparison. In: Batina, L., Robshaw, M. (eds.) CHES 2014. LNCS, vol. 8731, pp. 433\u2013450. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44709-3_24"}],"container-title":["Lecture Notes in Computer Science","Information Security and Privacy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-90567-5_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,3]],"date-time":"2021-11-03T18:08:52Z","timestamp":1635962932000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-90567-5_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030905668","9783030905675"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-90567-5_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"4 November 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ACISP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australasian Conference on Information Security and Privacy","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Perth, WA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 December 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 December 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"acisp2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/data61dsslab.github.io\/acisp2021\/","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":"157","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":"35","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":"22% - 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.2","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":"8","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)"}}]}}