{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,24]],"date-time":"2026-02-24T18:23:45Z","timestamp":1771957425954,"version":"3.50.1"},"publisher-location":"Cham","reference-count":42,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030778859","type":"print"},{"value":"9783030778866","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.springernature.com\/gp\/researchers\/text-and-data-mining"},{"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.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-77886-6_12","type":"book-chapter","created":{"date-parts":[[2021,6,15]],"date-time":"2021-06-15T23:06:10Z","timestamp":1623798370000},"page":"344-374","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":23,"title":["Leakage-Resilience of the Shamir Secret-Sharing Scheme Against Physical-Bit Leakages"],"prefix":"10.1007","author":[{"given":"Hemanta K.","family":"Maji","sequence":"first","affiliation":[]},{"given":"Hai H.","family":"Nguyen","sequence":"additional","affiliation":[]},{"given":"Anat","family":"Paskin-Cherniavsky","sequence":"additional","affiliation":[]},{"given":"Tom","family":"Suad","sequence":"additional","affiliation":[]},{"given":"Mingyuan","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,6,16]]},"reference":[{"key":"12_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":"12_CR2","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":"12_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1007\/978-3-319-96884-1_18","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"F Benhamouda","year":"2018","unstructured":"Benhamouda, F., Degwekar, A., Ishai, Y., Rabin, T.: On the local leakage resilience of linear secret sharing schemes. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. LNCS, vol. 10991, pp. 531\u2013561. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96884-1_18"},{"key":"12_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/978-3-030-03810-6_2","volume-title":"Theory of Cryptography","author":"AR Block","year":"2018","unstructured":"Block, A.R., Gupta, D., Maji, H.K., Nguyen, H.H.: Secure computation using leaky correlations (asymptotically optimal constructions). In: Beimel, A., Dziembowski, S. (eds.) TCC 2018. LNCS, vol. 11240, pp. 36\u201365. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03810-6_2"},{"key":"12_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-63715-0_1","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"AR Block","year":"2017","unstructured":"Block, A.R., Maji, H.K., Nguyen, H.H.: Secure computation based on leaky correlations: high resilience setting. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017. LNCS, vol. 10402, pp. 3\u201332. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63715-0_1"},{"key":"12_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/978-3-030-26951-7_14","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"A Bogdanov","year":"2019","unstructured":"Bogdanov, A., Ishai, Y., Srinivasan, A.: Unconditionally secure computation against low-complexity leakage. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11693, pp. 387\u2013416. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26951-7_14"},{"key":"12_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-41702-4_1","volume-title":"Information Security Theory and Practice","author":"G Candel","year":"2020","unstructured":"Candel, G., G\u00e9raud-Stewart, R., Naccache, D.: How to compartment secrets. In: Laurent, M., Giannetsos, T. (eds.) WISTP 2019. LNCS, vol. 12024, pp. 3\u201311. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-41702-4_1"},{"key":"12_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/978-3-319-70503-3_15","volume-title":"Theory of Cryptography","author":"I Cascudo","year":"2017","unstructured":"Cascudo, I., Damg\u00e5rd, I., Farr\u00e0s, O., Ranellucci, S.: Resource-efficient OT combiners with active security. In: Kalai, Y., Reyzin, L. (eds.) TCC 2017. LNCS, vol. 10678, pp. 461\u2013486. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70503-3_15"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Chattopadhyay, E., et al.: Extractors and secret sharing against bounded collusion protocols. In: 61st FOCS, pp. 1226\u20131242. IEEE Computer Society Press, November 2020","DOI":"10.1109\/FOCS46700.2020.00117"},{"key":"12_CR10","doi-asserted-by":"publisher","unstructured":"Chen, X., Kayal, N., Wigderson, A.: Partial derivatives in arithmetic complexity and beyond. Found. Trends Theor. Comput. Sci. 6(1\u20132), 1\u2013138 (2011). https:\/\/doi.org\/10.1561\/0400000043","DOI":"10.1561\/0400000043"},{"issue":"10","key":"12_CR11","doi-asserted-by":"publisher","first-page":"6567","DOI":"10.1109\/TIT.2018.2827942","volume":"64","author":"H Dau","year":"2018","unstructured":"Dau, H., Duursma, I.M., Kiah, H.M., Milenkovic, O.: Repairing Reed-Solomon codes with multiple erasures. IEEE Trans. Inf. Theory 64(10), 6567\u20136582 (2018)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"12_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/978-3-642-55220-5_24","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2014","author":"A Duc","year":"2014","unstructured":"Duc, A., Dziembowski, S., Faust, S.: Unifying leakage models: from probing attacks to noisy leakage. In: Nguyen, P.Q., Oswald, E. (eds.) EUROCRYPT 2014. LNCS, vol. 8441, pp. 423\u2013440. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-55220-5_24"},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"Franklin, M.K., Yung, M.: Communication complexity of secure computation (extended abstract). In: 24th ACM STOC, pp. 699\u2013710. ACM Press, May 1992","DOI":"10.1145\/129712.129780"},{"key":"12_CR14","doi-asserted-by":"crossref","unstructured":"Goyal, V., Kumar, A.: Non-malleable secret sharing. In: Diakonikolas, I., Kempe, D., Henzinger, M. (eds.) 50th ACM STOC, pp. 685\u2013698. ACM Press, June 2018","DOI":"10.1145\/3188745.3188872"},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"Guruswami, V., Wootters, M.: Repairing Reed-Solomon codes. In: Wichs, D., Mansour, Y. (eds.) 48th ACM STOC, pp. 216\u2013226. ACM Press, June 2016","DOI":"10.1145\/2897518.2897525"},{"issue":"9","key":"12_CR16","first-page":"5684","volume":"63","author":"V Guruswami","year":"2017","unstructured":"Guruswami, V., Wootters, M.: Repairing Reed-Solomon codes. IEEE Trans. Inf. Theory 63(9), 5684\u20135698 (2017)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"12_CR17","unstructured":"Hall, J.I.: Notes on Coding Theory (2015). https:\/\/users.math.msu.edu\/users\/halljo\/classes\/codenotes\/coding-notes.html"},{"key":"12_CR18","doi-asserted-by":"publisher","first-page":"240","DOI":"10.2307\/2331961","volume":"19","author":"P Hall","year":"1927","unstructured":"Hall, P.: The distribution of means for samples of size n drawn from a population in which the variate takes values between 0 and 1, all such values being equally probable. Biometrika 19, 240\u2013245 (1927)","journal-title":"Biometrika"},{"key":"12_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/978-3-540-78524-8_22","volume-title":"Theory of Cryptography","author":"D Harnik","year":"2008","unstructured":"Harnik, D., Ishai, Y., Kushilevitz, E., Nielsen, J.B.: OT-combiners via secure computation. In: Canetti, R. (ed.) TCC 2008. LNCS, vol. 4948, pp. 393\u2013411. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78524-8_22"},{"key":"12_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/11426639_6","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"D Harnik","year":"2005","unstructured":"Harnik, D., Kilian, J., Naor, M., Reingold, O., Rosen, A.: On robust combiners for oblivious transfer and other primitives. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 96\u2013113. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11426639_6"},{"key":"12_CR21","doi-asserted-by":"crossref","unstructured":"Hazay, C. Ishai, Y., Marcedone, A. Venkitasubramaniam, M.: LevioSA: lightweight secure arithmetic computation. In: Cavallaro, L. Kinder, J., Wang, X., Katz, J. (eds.) ACM CCS 2019, pp. 327\u2013344. ACM Press, November 2019","DOI":"10.1145\/3319535.3354258"},{"key":"12_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/978-3-030-45724-2_7","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"C Hazay","year":"2020","unstructured":"Hazay, C., Venkitasubramaniam, M., Weiss, M.: The price of active security in cryptographic protocols. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. LNCS, vol. 12106, pp. 184\u2013215. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45724-2_7"},{"key":"12_CR23","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1093\/biomet\/19.3-4.225","volume":"19","author":"JO Irwin","year":"1927","unstructured":"Irwin, J.O.: On the frequency distribution of the means of samples from a population having any law of frequency with finite moments, with special reference to Pearson\u2019s type II. Biometrika 19, 225\u2013239 (1927)","journal-title":"Biometrika"},{"key":"12_CR24","doi-asserted-by":"crossref","unstructured":"Ishai, Y., Kushilevitz, E., Ostrovsky, R., Sahai, A.: Extracting correlations. In: 50th FOCS, pp. 261\u2013270. IEEE Computer Society Press, October 2009","DOI":"10.1109\/FOCS.2009.56"},{"key":"12_CR25","doi-asserted-by":"crossref","unstructured":"Ishai, Y., Maji, H.K., Sahai, A., Wullschleger, J.: Single-use ot combiners with near-optimal resilience. In: 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, 29 June\u20134 July 2014, pp. 1544\u20131548. IEEE (2014)","DOI":"10.1109\/ISIT.2014.6875092"},{"key":"12_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1007\/11761679_19","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"Y Ishai","year":"2006","unstructured":"Ishai, Y., Prabhakaran, M., Sahai, A., Wagner, D.: Private circuits II: keeping secrets in tamperable circuits. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp. 308\u2013327. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11761679_19"},{"key":"12_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/978-3-540-45146-4_27","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"Y Ishai","year":"2003","unstructured":"Ishai, Y., Sahai, A., Wagner, D.: Private circuits: securing hardware against probing attacks. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 463\u2013481. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45146-4_27"},{"key":"12_CR28","doi-asserted-by":"crossref","unstructured":"Kalai, Y.T., Reyzin, L.: A survey of leakage-resilient cryptography. In: Goldreich, O. (ed.) Providing Sound Foundations for Cryptography: On the Work of Shafi Goldwasser and Silvio Micali, pp 727\u2013794. ACM (2019)","DOI":"10.1145\/3335741.3335768"},{"key":"12_CR29","doi-asserted-by":"crossref","unstructured":"Kumar, A., Meka, R., Sahai, A.: Leakage-resilient secret sharing against colluding parties. In: Zuckerman, D. (ed.) 60th FOCS, pp. 636\u2013660. IEEE Computer Society Press, November 2019","DOI":"10.1109\/FOCS.2019.00045"},{"key":"12_CR30","unstructured":"Lin, F., Cheraghchi, M., Guruswami, V., Safavi-Naini, R., Wang, H.: Leakage-resilient secret sharing in non-compartmentalized models. In: Kalai, Y.T., Smith, A.D., Wichs, D. (eds.) 1st Conference on Information-Theoretic Cryptography, ITC 2020, Boston, MA, USA, 17\u201319 June 2020. LIPIcs, vol. 163, pp. 7:1\u20137:24. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2020)"},{"key":"12_CR31","unstructured":"Lindell, Y.: Introduction to coding theory lecture notes (2010)"},{"key":"12_CR32","volume-title":"The Theory of Error Correcting Codes","author":"FJ MacWilliams","year":"1977","unstructured":"MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error Correcting Codes, vol. 16. Elsevier, Amsterdam (1977)"},{"key":"12_CR33","unstructured":"Maji, H.K. Paskin-Cherniavsky, A., Suad, T., Wang, M.: On leakage resilient secret sharing (2020)"},{"key":"12_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/978-3-030-56877-1_6","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"P Manurangsi","year":"2020","unstructured":"Manurangsi, P., Srinivasan, A., Vasudevan, P.N.: Nearly optimal robust secret sharing against rushing adversaries. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. LNCS, vol. 12172, pp. 156\u2013185. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56877-1_6"},{"key":"12_CR35","doi-asserted-by":"crossref","unstructured":"Massey, J.L.: Some applications of code duality in cryptography. In: Mat. Contemp, vol. 21, pp. 187\u2013209:16th (2001)","DOI":"10.21711\/231766362001\/rmc2111"},{"key":"12_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1007\/978-3-540-70936-7_22","volume-title":"Theory of Cryptography","author":"R Meier","year":"2007","unstructured":"Meier, R., Przydatek, B., Wullschleger, J.: Robuster combiners for oblivious transfer. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol. 4392, pp. 404\u2013418. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-70936-7_22"},{"key":"12_CR37","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"},{"key":"12_CR38","unstructured":"Rao, A.: An exposition of Bourgain\u2019s 2-source extractor (2007)"},{"key":"12_CR39","doi-asserted-by":"publisher","first-page":"297","DOI":"10.2307\/1969454","volume":"50","author":"A Selberg","year":"1949","unstructured":"Selberg, A.: An elementary proof of Dirichlet\u2019s theorem about primes in an arithmetic progression. Ann. Math. 50, 297\u2013304 (1949)","journal-title":"Ann. Math."},{"issue":"3","key":"12_CR40","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1112\/blms\/bds115","volume":"45","author":"X Shao","year":"2013","unstructured":"Shao, X.: On character sums and exponential sums over generalized arithmetic progressions. Bull. Lond. Math. Soc. 45(3), 541\u2013550 (2013)","journal-title":"Bull. Lond. Math. Soc."},{"key":"12_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":"12_CR42","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1006\/jnth.1996.0078","volume":"58","author":"TD Wooley","year":"1996","unstructured":"Wooley, T.D.: A note on simultaneous congruences. J. Number Theory 58(2), 288\u2013297 (1996)","journal-title":"J. Number Theory"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2021"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-77886-6_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,16]],"date-time":"2024-06-16T00:07:28Z","timestamp":1718496448000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-77886-6_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030778859","9783030778866"],"references-count":42,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-77886-6_12","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":"16 June 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EUROCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Conference on the Theory and Applications of Cryptographic Techniques","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Zagreb","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Croatia","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":"17 October 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 October 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"40","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurocrypt2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocrypt.iacr.org\/2021\/","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":"400","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":"78","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":"20% - 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":"at least 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":"21","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"}]}}