{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T05:04:15Z","timestamp":1755839055721,"version":"3.40.3"},"publisher-location":"Cham","reference-count":47,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030625757"},{"type":"electronic","value":"9783030625764"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-62576-4_15","type":"book-chapter","created":{"date-parts":[[2020,11,20]],"date-time":"2020-11-20T01:57:56Z","timestamp":1605837476000},"page":"298-317","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Private Decision Tree Evaluation with Constant Rounds via (Only) SS-3PC over Ring"],"prefix":"10.1007","author":[{"given":"Hikaru","family":"Tsuchida","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takashi","family":"Nishide","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yusaku","family":"Maeda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,11,20]]},"reference":[{"key":"15_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/3-540-44987-6_8","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2001","author":"W Aiello","year":"2001","unstructured":"Aiello, W., Ishai, Y., Reingold, O.: Priced oblivious transfer: how to sell digital goods. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol. 2045, pp. 119\u2013135. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44987-6_8"},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"Araki, T., Barak, A., Furukawa, J., Keller, M., Ohara, K., Tsuchida, H.: How to choose suitable secure multiparty computation using generalized SPDZ. In: ACM Conference on Computer and Communications Security, pp. 2198\u20132200. ACM (2018)","DOI":"10.1145\/3243734.3278510"},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"Araki, T., Furukawa, J., Lindell, Y., Nof, A., Ohara, K.: High-throughput semi-honest secure three-party computation with an honest majority. In: ACM Conference on Computer and Communications Security, pp. 805\u2013817. ACM (2016)","DOI":"10.1145\/2976749.2978331"},{"key":"15_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1007\/978-3-642-04444-1_26","volume-title":"Computer Security \u2013 ESORICS 2009","author":"M Barni","year":"2009","unstructured":"Barni, M., Failla, P., Kolesnikov, V., Lazzeretti, R., Sadeghi, A.-R., Schneider, T.: Secure evaluation of private linear branching programs with medical applications. In: Backes, M., Ning, P. (eds.) ESORICS 2009. LNCS, vol. 5789, pp. 424\u2013439. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-04444-1_26"},{"key":"15_CR5","doi-asserted-by":"crossref","unstructured":"Beaver, D., Micali, S., Rogaway, P.: The round complexity of secure protocols (extended abstract). In: STOC, pp. 503\u2013513. ACM (1990)","DOI":"10.1145\/100216.100287"},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation (extended abstract). In: STOC, pp. 1\u201310. ACM (1988)","DOI":"10.1145\/62212.62213"},{"key":"15_CR7","unstructured":"Blanton, M., Kang, A., Yuan, C.: Improved building blocks for secure multi-party computation based on secret sharing with honest majority. Cryptology ePrint Archive, Report 2019\/718 (2019). https:\/\/eprint.iacr.org\/2019\/718 (Accepted in ACNS 2020)"},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"Brickell, J., Porter, D.E., Shmatikov, V., Witchel, E.: Privacy-preserving remote diagnostics. In ACM Conference on Computer and Communications Security, pp. 498\u2013507. ACM (2007)","DOI":"10.1145\/1315245.1315307"},{"key":"15_CR9","unstructured":"Byali, M., Chaudhari, H., Patra, A., Suresh, A.: FLASH: fast and robust framework for privacy-preserving machine learning. IACR Cryptology ePrint Archive, vol. 2019, p. 1365 (2019). (accepted in PETS 2020)"},{"key":"15_CR10","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols. In FOCS, pp. 136\u2013145. IEEE Computer Society (2001)","DOI":"10.1109\/SFCS.2001.959888"},{"key":"15_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1007\/978-3-642-15317-4_13","volume-title":"Security and Cryptography for Networks","author":"O Catrina","year":"2010","unstructured":"Catrina, O., de Hoogh, S.: Improved primitives for secure multiparty integer computation. In: Garay, J.A., De Prisco, R. (eds.) SCN 2010. LNCS, vol. 6280, pp. 182\u2013199. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15317-4_13"},{"key":"15_CR12","unstructured":"Chida, K., et al.: An efficient secure three-party sorting protocol with an honest majority. Cryptology ePrint Archive, Report 2019\/695 (2019). https:\/\/eprint.iacr.org\/2019\/695"},{"issue":"2","key":"15_CR13","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1109\/TDSC.2017.2679189","volume":"16","author":"M De Cock","year":"2019","unstructured":"De Cock, M., et al.: Efficient and private scoring of decision trees, support vector machines and logistic regression models based on pre-computation. IEEE Trans. Dependable Secur. Comput. 16(2), 217\u2013230 (2019)","journal-title":"IEEE Trans. Dependable Secur. Comput."},{"key":"15_CR14","unstructured":"Dalskov, A., Escudero, D., Keller, M.: Secure evaluation of quantized neural networks. Cryptology ePrint Archive, Report 2019\/131 (2019). https:\/\/eprint.iacr.org\/2019\/131 (Accepted in PETS 2020)"},{"key":"15_CR15","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd, I., Escudero, D., Frederiksen, T.K., Keller, M., Scholl, P., Volgushev, N.: New primitives for actively-secure MPC over rings with applications to private machine learning. In IEEE Symposium on Security and Privacy, pp. 1102\u20131120. IEEE (2019)","DOI":"10.1109\/SP.2019.00078"},{"key":"15_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/3-540-44586-2_9","volume-title":"Public Key Cryptography","author":"I Damg\u00e5rd","year":"2001","unstructured":"Damg\u00e5rd, I., Jurik, M.: A generalisation, a simplification and some applications of Paillier\u2019s probabilistic public-key system. In: Kim, K. (ed.) PKC 2001. LNCS, vol. 1992, pp. 119\u2013136. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44586-2_9"},{"key":"15_CR17","doi-asserted-by":"crossref","unstructured":"Demmler, D., Schneider, T., Zohner, M.: ABY-A framework for efficient mixed-protocol secure two-party computation. In: NDSS, The Internet Society (2015)","DOI":"10.14722\/ndss.2015.23113"},{"key":"15_CR18","doi-asserted-by":"crossref","unstructured":"Doerner, J., Shelat, A.: Scaling ORAM for secure computation. In: ACM Conference on Computer and Communications Security, pp. 523\u2013535. ACM (2017)","DOI":"10.1145\/3133956.3133967"},{"key":"15_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"823","DOI":"10.1007\/978-3-030-56880-1_29","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"D Escudero","year":"2020","unstructured":"Escudero, D., Ghosh, S., Keller, M., Rachuri, R., Scholl, P.: Improved primitives for MPC over mixed arithmetic-binary circuits. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. LNCS, vol. 12171, pp. 823\u2013852. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56880-1_29"},{"key":"15_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1007\/978-3-662-48797-6_16","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2015","author":"S Faber","year":"2015","unstructured":"Faber, S., Jarecki, S., Kentros, S., Wei, B.: Three-party ORAM for secure computation. In: Iwata, T., Cheon, J.H. (eds.) ASIACRYPT 2015. LNCS, vol. 9452, pp. 360\u2013385. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48797-6_16"},{"issue":"4","key":"15_CR21","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","volume":"31","author":"T El Gamal","year":"1985","unstructured":"El Gamal, T.: A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans. Inf. Theory 31(4), 469\u2013472 (1985)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"15_CR22","unstructured":"Gentry, C.: A fully homomorphic encryption scheme. PhD thesis, Stanford University (2009). https:\/\/crypto.stanford.edu\/craig"},{"key":"15_CR23","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game or a completeness theorem for protocols with honest majority. In: STOC, pp. 218\u2013229. ACM (1987)","DOI":"10.1145\/28395.28420"},{"key":"15_CR24","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Micali, S.: Probabilistic encryption and how to play mental poker keeping secret all partial information. In: STOC, pp. 365\u2013377. ACM (1982)","DOI":"10.1145\/800070.802212"},{"key":"15_CR25","doi-asserted-by":"crossref","unstructured":"Henecka, W., K\u00f6gl, S., Sadeghi, A.-R., Schneider, T., Wehrenberg, I.: TASTY: tool for automating secure two-party computations. In: ACM Conference on Computer and Communications Security, pp. 451\u2013462. ACM (2010)","DOI":"10.1145\/1866307.1866358"},{"key":"15_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1007\/978-3-030-21548-4_20","volume-title":"Information Security and Privacy","author":"A Ichikawa","year":"2019","unstructured":"Ichikawa, A., Ogata, W., Hamada, K., Kikuchi, R.: Efficient secure multi-party protocols for decision tree classification. In: Jang-Jaccard, J., Guo, F. (eds.) ACISP 2019. LNCS, vol. 11547, pp. 362\u2013380. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-21548-4_20"},{"key":"15_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1007\/978-3-319-93387-0_19","volume-title":"Applied Cryptography and Network Security","author":"S Jarecki","year":"2018","unstructured":"Jarecki, S., Wei, B.: 3PC ORAM with low latency, low bandwidth, and fast batch retrieval. In: Preneel, B., Vercauteren, F. (eds.) ACNS 2018. LNCS, vol. 10892, pp. 360\u2013378. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-93387-0_19"},{"key":"15_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1007\/978-3-662-45608-8_27","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2014","author":"M Keller","year":"2014","unstructured":"Keller, M., Scholl, P.: Efficient, oblivious data structures for MPC. In: Sarkar, P., Iwata, T. (eds.) ASIACRYPT 2014. LNCS, vol. 8874, pp. 506\u2013525. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-45608-8_27"},{"issue":"2","key":"15_CR29","doi-asserted-by":"crossref","first-page":"187","DOI":"10.2478\/popets-2019-0026","volume":"2019","author":"\u00c1 Kiss","year":"2019","unstructured":"Kiss, \u00c1., Naderpour, M., Liu, J., Asokan, N., Schneider, T.: SoK: modular and efficient private decision tree evaluation. PoPETs 2019(2), 187\u2013208 (2019)","journal-title":"PoPETs"},{"key":"15_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/978-3-319-21966-0_11","volume-title":"Information and Communications Security","author":"P Laud","year":"2015","unstructured":"Laud, P.: A private lookup protocol with low online complexity for secure multiparty computation. In: Hui, L.C.K., Qing, S.H., Shi, E., Yiu, S.M. (eds.) ICICS 2014. LNCS, vol. 8958, pp. 143\u2013157. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21966-0_11"},{"issue":"2","key":"15_CR31","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1515\/popets-2015-0011","volume":"2015","author":"P Laud","year":"2015","unstructured":"Laud, P.: Parallel oblivious array access for secure multiparty computation and privacy-preserving minimum spanning trees. PoPETs 2015(2), 188\u2013205 (2015)","journal-title":"PoPETs"},{"key":"15_CR32","doi-asserted-by":"crossref","unstructured":"Launchbury, J., Diatchki, I.S., DuBuisson, T., Adams-Moran, A.: Efficient lookup-table protocol in secure multiparty computation. In: ICFP, pp. 189\u2013200. ACM (2012)","DOI":"10.1145\/2398856.2364556"},{"key":"15_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/978-3-642-24861-0_18","volume-title":"Information Security","author":"S Laur","year":"2011","unstructured":"Laur, S., Willemson, J., Zhang, B.: Round-efficient oblivious database manipulation. In: Lai, X., Zhou, J., Li, H. (eds.) ISC 2011. LNCS, vol. 7001, pp. 262\u2013277. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-24861-0_18"},{"key":"15_CR34","unstructured":"Mohassel, P., Rindal, P.: Aby$${}^{\\text{3}}$$: A mixed protocol framework for machine learning. In: ACM Conference on Computer and Communications Security, pp. 35\u201352. ACM (2018)"},{"key":"15_CR35","unstructured":"Naor, M., Pinkas, B.: Efficient oblivious transfer protocols. In: SODA, pp. 448\u2013457. ACM\/SIAM (2001)"},{"key":"15_CR36","doi-asserted-by":"crossref","unstructured":"Ohata, S., Nuida, K.: Towards high-throughput secure MPC over the internet: Communication-efficient two-party protocols and its application. CoRR, abs\/1907.03415 (2019). (Accepted in FC 2020)","DOI":"10.1007\/978-3-030-51280-4_20"},{"key":"15_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/3-540-48910-X_16","volume-title":"Advances in Cryptology \u2014 EUROCRYPT\u20191999","author":"P Paillier","year":"1999","unstructured":"Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 223\u2013238. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48910-X_16"},{"key":"15_CR38","unstructured":"Rachuri, R., Suresh, A.: Trident: efficient 4PC framework for privacy preserving machine learning. Cryptology ePrint Archive, Report 2019\/1315 (2019). https:\/\/eprint.iacr.org\/2019\/1315"},{"issue":"1","key":"15_CR39","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1145\/357980.358017","volume":"26","author":"RL Rivest","year":"1983","unstructured":"Rivest, R.L., Shamir, A., Adleman, L.M.: A method for obtaining digital signatures and public-key cryptosystems (reprint). Commun. ACM 26(1), 96\u201399 (1983)","journal-title":"Commun. ACM"},{"key":"15_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"494","DOI":"10.1007\/978-3-319-66399-9_27","volume-title":"Computer Security \u2013 ESORICS 2017","author":"RKH Tai","year":"2017","unstructured":"Tai, R.K.H., Ma, J.P.K., Zhao, Y., Chow, S.S.M.: Privacy-preserving decision trees evaluation via linear functions. In: Foley, S.N., Gollmann, D., Snekkenes, E. (eds.) ESORICS 2017. LNCS, vol. 10493, pp. 494\u2013512. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-66399-9_27"},{"issue":"1","key":"15_CR41","doi-asserted-by":"crossref","first-page":"266","DOI":"10.2478\/popets-2019-0015","volume":"2019","author":"A Tueno","year":"2019","unstructured":"Tueno, A., Kerschbaum, F., Katzenbeisser, S.: Private evaluation of decision trees using sublinear cost. PoPETs 2019(1), 266\u2013286 (2019)","journal-title":"PoPETs"},{"issue":"3","key":"15_CR42","doi-asserted-by":"crossref","first-page":"26","DOI":"10.2478\/popets-2019-0035","volume":"2019","author":"S Wagh","year":"2019","unstructured":"Wagh, S., Gupta, D., Chandran, N.: Securenn: 3-party secure computation for neural network training. PoPETs 2019(3), 26\u201349 (2019)","journal-title":"PoPETs"},{"key":"15_CR43","doi-asserted-by":"crossref","unstructured":"Wang, X., Hubert Chan, T.-H., Shi, E.: Circuit ORAM: on tightness of the goldreich-ostrovsky lower bound. IACR Cryptology ePrint Archieve, vol. 2014, p. 672 (2014)","DOI":"10.1145\/2810103.2813634"},{"key":"15_CR44","doi-asserted-by":"crossref","unstructured":"Wang, X.S., Huang, Y., Hubert Chan, T.-H., Shelat, A., Shi, E.: SCORAM: oblivious RAM for secure computation. In: ACM Conference on Computer and Communications Security, pp. 191\u2013202. ACM (2014)","DOI":"10.1145\/2660267.2660365"},{"issue":"4","key":"15_CR45","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1515\/popets-2016-0043","volume":"2016","author":"DJ Wu","year":"2016","unstructured":"Wu, D.J., Feng, T., Naehrig, M., Lauter, K.E.: Privately evaluating decision trees and random forests. PoPETs 2016(4), 335\u2013355 (2016)","journal-title":"PoPETs"},{"key":"15_CR46","doi-asserted-by":"crossref","unstructured":"Yao, A.C.-C.: How to generate and exchange secrets (extended abstract). In: FOCS, pp. 162\u2013167. IEEE Computer Society (1986)","DOI":"10.1109\/SFCS.1986.25"},{"key":"15_CR47","doi-asserted-by":"crossref","unstructured":"Zahur, S., et al.: Revisiting square-root ORAM: efficient random access in multi-party computation. In: IEEE Symposium on Security and Privacy, pp. 218\u2013234. IEEE Computer Society (2016)","DOI":"10.1109\/SP.2016.21"}],"container-title":["Lecture Notes in Computer Science","Provable and Practical Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-62576-4_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,28]],"date-time":"2022-11-28T23:12:43Z","timestamp":1669677163000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-62576-4_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030625757","9783030625764"],"references-count":47,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-62576-4_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"20 November 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ProvSec","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Provable Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 November 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 December 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"provsec2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/scripts.ntu.edu.sg\/NewsnEvents\/Pages\/Events-PROVSEC2020.aspx","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":"59","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":"20","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":"34% - 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":"4","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)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}