{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T17:39:36Z","timestamp":1742924376426,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":42,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819975624"},{"type":"electronic","value":"9789819975631"}],"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-981-99-7563-1_21","type":"book-chapter","created":{"date-parts":[[2023,10,30]],"date-time":"2023-10-30T20:01:50Z","timestamp":1698696110000},"page":"468-493","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Lower Bounds on the Share Size of Leakage Resilient Cheating Detectable Secret Sharing"],"prefix":"10.1007","author":[{"given":"Sabyasachi","family":"Dutta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shaoquan","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Reihaneh","family":"Safavi-Naini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,10,31]]},"reference":[{"key":"21_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1007\/978-3-030-26951-7_18","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"D Aggarwal","year":"2019","unstructured":"Aggarwal, D., et al.: Stronger leakage-resilient and non-malleable secret sharing schemes for general access structures. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11693, pp. 510\u2013539. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26951-7_18"},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"Aggarwal, D., Dodis, Y., Lovett, S.: Non-malleable codes from additive combinatorics. In STOC 2014, pp. 774\u2013783 (2014)","DOI":"10.1145\/2591796.2591804"},{"key":"21_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1007\/978-3-662-46494-6_17","volume-title":"Theory of Cryptography","author":"D Aggarwal","year":"2015","unstructured":"Aggarwal, D., Dziembowski, S., Kazana, T., Obremski, M.: Leakage-resilient non-malleable codes. In: Dodis, Y., Nielsen, J.B. (eds.) TCC 2015. LNCS, vol. 9014, pp. 398\u2013426. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46494-6_17"},{"key":"21_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/978-3-540-73458-1_11","volume-title":"Information Security and Privacy","author":"T Araki","year":"2007","unstructured":"Araki, T.: Efficient (k,n) threshold secret sharing schemes secure against cheating from n\u20131 cheaters. In: Pieprzyk, J., Ghodosi, H., Dawson, E. (eds.) ACISP 2007. LNCS, vol. 4586, pp. 133\u2013142. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-73458-1_11"},{"key":"21_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1007\/978-3-030-17653-2_20","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"S Badrinarayanan","year":"2019","unstructured":"Badrinarayanan, S., Srinivasan, A.: Revisiting non-malleable secret sharing. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS, vol. 11476, pp. 593\u2013622. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17653-2_20"},{"key":"21_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/978-3-642-20901-7_2","volume-title":"Coding and Cryptology","author":"A Beimel","year":"2011","unstructured":"Beimel, A.: Secret-sharing schemes: a survey. In: Chee, Y.M., et al. (eds.) IWCC 2011. LNCS, vol. 6639, pp. 11\u201346. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20901-7_2"},{"key":"21_CR7","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation. In STOC 1988, pp. 1\u201310, ACM New York (1988)","DOI":"10.1145\/62212.62213"},{"issue":"2","key":"21_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00145-021-09375-2","volume":"34","author":"F Benhamouda","year":"2021","unstructured":"Benhamouda, F., Degwekar, A., Ishai, Y., Rabin, T.: On the local leakage resilience of linear secret sharing schemes. J. Cryptol. 34(2), 1\u201365 (2021). https:\/\/doi.org\/10.1007\/s00145-021-09375-2","journal-title":"J. Cryptol."},{"key":"21_CR9","doi-asserted-by":"crossref","unstructured":"Blakley, G.R.: Safeguarding cryptographic keys. In: AFIPS, vol. 1979, pp. 313\u2013317 (1997)","DOI":"10.1109\/MARK.1979.8817296"},{"key":"21_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/978-3-030-56877-1_5","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"G Brian","year":"2020","unstructured":"Brian, G., Faonio, A., Obremski, M., Simkin, M., Venturi, D.: Non-malleable secret sharing against bounded joint-tampering attacks in the plain model. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. LNCS, vol. 12172, pp. 127\u2013155. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56877-1_5"},{"key":"21_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/978-3-030-90453-1_12","volume-title":"Theory of Cryptography","author":"G Brian","year":"2021","unstructured":"Brian, G., Faonio, A., Venturi, D.: Continuously non-malleable secret sharing: joint tampering, plain model and capacity. In: Nissim, K., Waters, B. (eds.) TCC 2021. LNCS, vol. 13043, pp. 333\u2013364. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-90453-1_12"},{"key":"21_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/3-540-45539-6_33","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2000","author":"R Canetti","year":"2000","unstructured":"Canetti, R., Dodis, Y., Halevi, S., Kushilevitz, E., Sahai, A.: Exposure-resilient functions and all-or-nothing transforms. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 453\u2013469. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-45539-6_33"},{"key":"21_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/3-540-48285-7_10","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201993","author":"M Carpentieri","year":"1994","unstructured":"Carpentieri, M., De Santis, A., Vaccaro, U.: Size of shares and probability of cheating in threshold schemes. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol. 765, pp. 118\u2013125. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-48285-7_10"},{"key":"21_CR14","doi-asserted-by":"crossref","unstructured":"Chattopadhyay, E., Goyal, V., Li. X.: Non-malleable extractors and codes, with their many tampered extensions. In: Proceedings of the Forty-Eighth Annual ACM Symposium on Theory of Computing, pp. 285\u2013298 (2016)","DOI":"10.1145\/2897518.2897547"},{"issue":"1","key":"21_CR15","first-page":"40","volume":"32","author":"I Csisz\u00e1r","year":"1996","unstructured":"Csisz\u00e1r, I.: Almost independence of random variables and capacity of a secrecy channel. Probl. Inf. Transm. 32(1), 40\u201347 (1996)","journal-title":"Probl. Inf. Transm."},{"key":"21_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/978-3-642-15317-4_9","volume-title":"Security and Cryptography for Networks","author":"F Dav\u00ec","year":"2010","unstructured":"Dav\u00ec, F., Dziembowski, S., Venturi, D.: Leakage-resilient storage. In: Garay, J.A., De Prisco, R. (eds.) SCN 2010. LNCS, vol. 6280, pp. 121\u2013137. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15317-4_9"},{"key":"21_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-57220-1_47","volume-title":"Advances in Cryptology \u2014 AUSCRYPT \u201992","author":"Y Desmedt","year":"1993","unstructured":"Desmedt, Y.: Threshold cryptosystems. In: Seberry, J., Zheng, Y. (eds.) AUSCRYPT 1992. LNCS, vol. 718, pp. 1\u201314. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-57220-1_47"},{"key":"21_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/3-540-44987-6_19","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2001","author":"Y Dodis","year":"2001","unstructured":"Dodis, Y., Sahai, A., Smith, A.: On perfect and adaptive security in exposure-resilient cryptography. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol. 2045, pp. 301\u2013324. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44987-6_19"},{"issue":"4","key":"21_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3178432","volume":"65","author":"S Dziembowski","year":"2018","unstructured":"Dziembowski, S., Pietrzak, K., Wichs, D.: Non-malleable codes. J. ACM (JACM) 65(4), 1\u201332 (2018)","journal-title":"J. ACM (JACM)"},{"key":"21_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1007\/978-3-030-26951-7_16","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"A Faonio","year":"2019","unstructured":"Faonio, A., Venturi, D.: Non-malleable secret sharing in the computational setting: adaptive tampering, noisy-leakage resilience, and improved rate. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11693, pp. 448\u2013479. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26951-7_16"},{"key":"21_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/978-3-642-54242-8_20","volume-title":"Theory of Cryptography","author":"S Faust","year":"2014","unstructured":"Faust, S., Mukherjee, P., Nielsen, J.B., Venturi, D.: Continuous non-malleable codes. In: Lindell, Y. (ed.) TCC 2014. LNCS, vol. 8349, pp. 465\u2013488. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54242-8_20"},{"key":"21_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/978-3-319-39555-5_9","volume-title":"Applied Cryptography and Network Security","author":"R Gennaro","year":"2016","unstructured":"Gennaro, R., Goldfeder, S., Narayanan, A.: Threshold-optimal DSA\/ECDSA signatures and an application to bitcoin wallet security. In: Manulis, M., Sadeghi, A.-R., Schneider, S. (eds.) ACNS 2016. LNCS, vol. 9696, pp. 156\u2013174. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-39555-5_9"},{"key":"21_CR23","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game. In: Proceedings of, STOC 1987, pp. 218\u2013229, ACM. New York (1987)","DOI":"10.1145\/28395.28420"},{"key":"21_CR24","doi-asserted-by":"crossref","unstructured":"Goyal, V., Kumar, A.: Non-malleable secret sharing. In Proceedings of STOC 2018, pp. 685\u2013698, ACM. New York (2018)","DOI":"10.1145\/3188745.3188872"},{"key":"21_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/978-3-319-96884-1_17","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"V Goyal","year":"2018","unstructured":"Goyal, V., Kumar, A.: Non-malleable secret sharing for general access structures. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. LNCS, vol. 10991, pp. 501\u2013530. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96884-1_17"},{"issue":"9","key":"21_CR26","first-page":"5684","volume":"63","author":"V Guruswami","year":"2017","unstructured":"Guruswami, V., Wootters, M.: Repairing reed-solomon codes. IEEE Trans. on Information Theory 63(9), 5684\u20135698 (2017)","journal-title":"IEEE Trans. on Information Theory"},{"key":"21_CR27","doi-asserted-by":"crossref","unstructured":"Kalai, Y.T., Reyzin, L.: A survey of leakage-resilient cryptography. In Providing Sound Foundations for Cryptography: On the Work of Shafi Goldwasser and Silvio Micali, pp. 727\u2013794 (2019)","DOI":"10.1145\/3335741.3335768"},{"key":"21_CR28","unstructured":"Kanukurthi, B., Obbattu, S.L.B., Sekar, S., Tomy, J.: Locally reconstructable non-malleable secret sharing. In: ITC 2021. Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2021)"},{"key":"21_CR29","doi-asserted-by":"crossref","unstructured":"Kumar, A., Meka, R., Sahai, A.: Leakage-resilient secret sharing against colluding parties. In: FOCS, vol. 2019, pp. 636\u2013660 (2019)","DOI":"10.1109\/FOCS.2019.00045"},{"key":"21_CR30","unstructured":"Lin, F., Cheraghchi, M., Guruswami, V., Safavi-Naini, R., Wang, H.: Leakage-resilient secret sharing in non-compartmentalized models. In: ITC 2020. Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2020)"},{"key":"21_CR31","doi-asserted-by":"crossref","unstructured":"Lin, F., Safavi-Naini, R., Cheraghchi, M., Wang, H.: Non-malleable codes against active physical layer adversary. In: ISIT 2019, pp. 2753\u20132757, IEEE (2019)","DOI":"10.1109\/ISIT.2019.8849438"},{"key":"21_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1007\/978-3-642-32009-5_30","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"F-H Liu","year":"2012","unstructured":"Liu, F.-H., Lysyanskaya, A.: Tamper and leakage resilience in the split-state model. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 517\u2013532. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_30"},{"key":"21_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1007\/978-3-030-77886-6_12","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2021","author":"HK Maji","year":"2021","unstructured":"Maji, H.K., Nguyen, H.H., Paskin-Cherniavsky, A., Suad, T., Wang, M.: Leakage-resilience of the Shamir secret-sharing scheme against physical-bit leakages. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021. LNCS, vol. 12697, pp. 344\u2013374. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77886-6_12"},{"key":"21_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"779","DOI":"10.1007\/978-3-030-84252-9_26","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"HK Maji","year":"2021","unstructured":"Maji, H.K., Paskin-Cherniavsky, A., Suad, T., Wang, M.: Constructing locally leakage-resilient linear secret-sharing schemes. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12827, pp. 779\u2013808. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84252-9_26"},{"key":"21_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1007\/978-3-540-24638-1_16","volume-title":"Theory of Cryptography","author":"S Micali","year":"2004","unstructured":"Micali, S., Reyzin, L.: Physically observable cryptography. In: Naor, M. (ed.) TCC 2004. LNCS, vol. 2951, pp. 278\u2013296. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24638-1_16"},{"key":"21_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"556","DOI":"10.1007\/978-3-030-45721-1_20","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"JB Nielsen","year":"2020","unstructured":"Nielsen, J.B., Simkin, M.: Lower bounds for leakage-resilient secret sharing. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. LNCS, vol. 12105, pp. 556\u2013577. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45721-1_20"},{"issue":"1","key":"21_CR37","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1137\/S0895480100378689","volume":"20","author":"W Ogata","year":"2006","unstructured":"Ogata, W., Kurosawa, K., Stinson, D.R.: Optimum secret sharing scheme secure against cheating. SIAM J. Dis. Math. 20(1), 79\u201395 (2006)","journal-title":"SIAM J. Dis. Math."},{"key":"21_CR38","doi-asserted-by":"crossref","unstructured":"Raman, R.K., Varshney, L.R.: Distributed storage meets secret sharing on the blockchain. In: 2018 Information Theory and Applications Workshop (ITA), pp. 1\u20136. IEEE (2018)","DOI":"10.1109\/ITA.2018.8503089"},{"key":"21_CR39","doi-asserted-by":"crossref","unstructured":"De Santis, A., Desmedt, Y., Frankel, Y., Yung, M.: How to share a function securely. In STOC 1994 (1994)","DOI":"10.1145\/195058.195405"},{"issue":"11","key":"21_CR40","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A Shamir","year":"1979","unstructured":"Shamir, A.: How to share a secret. Commun. ACM 22(11), 612\u2013613 (1979)","journal-title":"Commun. ACM"},{"key":"21_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1007\/978-3-030-26951-7_17","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"A Srinivasan","year":"2019","unstructured":"Srinivasan, A., Vasudevan, P.N.: Leakage resilient secret sharing and applications. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11693, pp. 480\u2013509. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26951-7_17"},{"issue":"2","key":"21_CR42","first-page":"133","volume":"1","author":"M Tompa","year":"1988","unstructured":"Tompa, M., Woll, H.: How to share a secret with cheaters. J. Cryptology 1(2), 133\u2013138 (1988)","journal-title":"J. Cryptology"}],"container-title":["Lecture Notes in Computer Science","Cryptology and Network Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-99-7563-1_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,7]],"date-time":"2024-01-07T18:03:36Z","timestamp":1704650616000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-99-7563-1_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9789819975624","9789819975631"],"references-count":42,"URL":"https:\/\/doi.org\/10.1007\/978-981-99-7563-1_21","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":"31 October 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CANS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Cryptology and Network Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Augusta, GA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","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":"30 October 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 November 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cans2023","order":10,"name":"conference_id","label":"Conference ID","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":"129","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":"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":"4.5","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)"}}]}}