{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T14:40:18Z","timestamp":1773931218541,"version":"3.50.1"},"publisher-location":"Cham","reference-count":53,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030457235","type":"print"},{"value":"9783030457242","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-45724-2_14","type":"book-chapter","created":{"date-parts":[[2020,5,1]],"date-time":"2020-05-01T04:17:18Z","timestamp":1588306638000},"page":"403-432","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":56,"title":["OptORAMa: Optimal Oblivious RAM"],"prefix":"10.1007","author":[{"given":"Gilad","family":"Asharov","sequence":"first","affiliation":[]},{"given":"Ilan","family":"Komargodski","sequence":"additional","affiliation":[]},{"given":"Wei-Kai","family":"Lin","sequence":"additional","affiliation":[]},{"given":"Kartik","family":"Nayak","sequence":"additional","affiliation":[]},{"given":"Enoch","family":"Peserico","sequence":"additional","affiliation":[]},{"given":"Elaine","family":"Shi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,5,1]]},"reference":[{"key":"14_CR1","unstructured":"https:\/\/en.wikipedia.org\/wiki\/Sorting_network"},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"Ajtai, M., Koml\u00f3s, J., Szemer\u00e9di, E.: An $$O(n \\log n)$$ sorting network. In: ACM STOC, pp. 1\u20139 (1983)","DOI":"10.1145\/800061.808726"},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"Andersson, A., Hagerup, T., Nilsson, S., Raman, R.: Sorting in linear time? In: ACM STOC, pp. 427\u2013436 (1995)","DOI":"10.1145\/225058.225173"},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"Arora, S., Leighton, T., Maggs, B.: On-line algorithms for path selection in a nonblocking network. In: ACM STOC (1990)","DOI":"10.1145\/100216.100232"},{"key":"14_CR5","unstructured":"Asharov, G., Komargodski, I., Lin, W.-K., Nayak, K., Peserico, E., Shi, E.: Optorama: optimal oblivious RAM. IACR Cryptology ePrint Archive 2018:892 (2018)"},{"key":"14_CR6","unstructured":"Batcher, K.E.: Sorting networks and their applications. In: American Federation of Information Processing Societies: AFIPS Conference Proceedings, vol. 32, pp. 307\u2013314 (1968)"},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"Bindschaedler, V., Naveed, M., Pan, X., Wang, X., Huang, Y.: Practicing oblivious access on cloud storage: the gap, the fallacy, and the new way forward. In: ACM CCS, pp. 837\u2013849 (2015)","DOI":"10.1145\/2810103.2813649"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"Boyle, E., Naor, M.: Is there an oblivious RAM lower bound? In: ACM ITCS, pp. 357\u2013368 (2016)","DOI":"10.1145\/2840728.2840761"},{"key":"14_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/978-3-662-43948-7_21","volume-title":"Automata, Languages, and Programming","author":"K Bringmann","year":"2014","unstructured":"Bringmann, K., Kuhn, F., Panagiotou, K., Peter, U., Thomas, H.: Internal DLA: efficient simulation of a physical growth model. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) ICALP 2014, Part I. LNCS, vol. 8572, pp. 247\u2013258. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-43948-7_21"},{"key":"14_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"660","DOI":"10.1007\/978-3-319-70694-8_23","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2017","author":"T-H Hubert Chan","year":"2017","unstructured":"Hubert Chan, T.-H., Guo, Y., Lin, W.-K., Shi, E.: Oblivious hashing revisited, and applications to asymptotically efficient ORAM and OPRAM. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT 2017, Part I. LNCS, vol. 10624, pp. 660\u2013690. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70694-8_23"},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"Hubert Chan, T.-H., Guo, Y., Lin, W.-K., Shi, E.: Cache-oblivious and data-oblivious sorting and applications. In: SODA, pp. 2201\u20132220 (2018)","DOI":"10.1137\/1.9781611975031.143"},{"key":"14_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"636","DOI":"10.1007\/978-3-030-03810-6_23","volume-title":"Theory of Cryptography","author":"T-H Hubert Chan","year":"2018","unstructured":"Hubert Chan, T.-H., Nayak, K., Shi, E.: Perfectly secure oblivious parallel RAM. In: Beimel, A., Dziembowski, S. (eds.) TCC 2018, Part II. LNCS, vol. 11240, pp. 636\u2013668. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03810-6_23"},{"key":"14_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/978-3-319-70503-3_3","volume-title":"Theory of Cryptography","author":"T-H Hubert Chan","year":"2017","unstructured":"Hubert Chan, T.-H., Shi, E.: Circuit OPRAM: unifying statistically and computationally secure ORAMs and OPRAMs. In: Kalai, Y., Reyzin, L. (eds.) TCC 2017, Part II. LNCS, vol. 10678, pp. 72\u2013107. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70503-3_3"},{"key":"14_CR14","unstructured":"Paul, J.C., Simon, W.: Decision trees and random access machines (1980)"},{"key":"14_CR15","first-page":"428","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"2009","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn, pp. 428\u2013436. MIT Press, Cambridge (2009)","edition":"3"},{"key":"14_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/978-3-642-19571-6_10","volume-title":"Theory of Cryptography","author":"I Damg\u00e5rd","year":"2011","unstructured":"Damg\u00e5rd, I., Meldgaard, S., Nielsen, J.B.: Perfectly secure oblivious RAM without random oracles. In: Ishai, Y. (ed.) TCC 2011. LNCS, vol. 6597, pp. 144\u2013163. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19571-6_10"},{"key":"14_CR17","doi-asserted-by":"crossref","unstructured":"Farhadi, A., Hajiaghayi, M.T., Larsen, K.G., Shi, E.: Lower bounds for external memory integer sorting via network coding. In: ACM STOC (2019)","DOI":"10.1145\/3313276.3316337"},{"key":"14_CR18","doi-asserted-by":"crossref","unstructured":"Feldman, P., Friedman, J., Pippenger, N.: Non-blocking networks. In: ACM STOC, pp. 247\u2013254 (1986)","DOI":"10.1145\/12130.12155"},{"key":"14_CR19","doi-asserted-by":"crossref","unstructured":"Fletcher, C.W., van Dijk, M., Devadas, S.: A secure processor architecture for encrypted computation on untrusted programs. In: Seventh ACM Workshop on Scalable Trusted Computing, pp. 3\u20138. ACM (2012)","DOI":"10.1145\/2382536.2382540"},{"key":"14_CR20","doi-asserted-by":"crossref","unstructured":"Fletcher, C.W., Ren, L., Kwon, A., van Dijk, M., Devadas, S.: Freecursive ORAM: [nearly] free recursion and integrity verification for position-based oblivious RAM. In: ACM ASPLOS, pp. 103\u2013116 (2015)","DOI":"10.1145\/2775054.2694353"},{"key":"14_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1007\/978-3-319-28166-7_9","volume-title":"Applied Cryptography and Network Security","author":"C Gentry","year":"2015","unstructured":"Gentry, C., Halevi, S., Jutla, C., Raykova, M.: Private database access with HE-over-ORAM architecture. In: Malkin, T., Kolesnikov, V., Lewko, A.B., Polychronakis, M. (eds.) ACNS 2015. LNCS, vol. 9092, pp. 172\u2013191. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-28166-7_9"},{"key":"14_CR22","doi-asserted-by":"crossref","unstructured":"Goldreich, O.: Towards a theory of software protection and simulation by oblivious RAMs. In: ACM STOC, pp. 182\u2013194 (1987)","DOI":"10.1145\/28395.28416"},{"issue":"3","key":"14_CR23","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1145\/233551.233553","volume":"43","author":"O Goldreich","year":"1996","unstructured":"Goldreich, O., Ostrovsky, R.: Software protection and simulation on oblivious RAMs. J. ACM 43(3), 431\u2013473 (1996)","journal-title":"J. ACM"},{"key":"14_CR24","doi-asserted-by":"crossref","unstructured":"Goodrich, M.T.: Zig-zag sort: a simple deterministic data-oblivious sorting algorithm running in O(N Log N) time. In: ACM STOC, pp. 684\u2013693 (2014)","DOI":"10.1145\/2591796.2591830"},{"key":"14_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"576","DOI":"10.1007\/978-3-642-22012-8_46","volume-title":"Automata, Languages and Programming","author":"MT Goodrich","year":"2011","unstructured":"Goodrich, M.T., Mitzenmacher, M.: Privacy-preserving access of outsourced data via oblivious RAM simulation. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part II. LNCS, vol. 6756, pp. 576\u2013587. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22012-8_46"},{"key":"14_CR26","doi-asserted-by":"crossref","unstructured":"Goodrich, M.T., Mitzenmacher, M., Ohrimenko, O., Tamassia, R.: Oblivious RAM simulation with efficient worst-case access overhead. In: Proceedings of the 3rd ACM Workshop on Cloud Computing Security Workshop, CCSW 2011, pp. 95\u2013100 (2011)","DOI":"10.1145\/2046660.2046680"},{"key":"14_CR27","doi-asserted-by":"crossref","unstructured":"Goodrich, M.T., Mitzenmacher, M., Ohrimenko, O., Tamassia, R.: Privacy-preserving group data access via stateless oblivious RAM simulation. In: SODA, pp. 157\u2013167 (2012)","DOI":"10.1137\/1.9781611973099.14"},{"issue":"2","key":"14_CR28","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/0020-0190(90)90097-H","volume":"36","author":"T Hagerup","year":"1990","unstructured":"Hagerup, T., Shen, H.: Improved nonconservative sequential and parallel integer sorting. Inf. Process. Lett. 36(2), 57\u201363 (1990)","journal-title":"Inf. Process. Lett."},{"key":"14_CR29","doi-asserted-by":"crossref","unstructured":"Kushilevitz, E., Lu, S., Ostrovsky, R.: On the (in)security of hash-based oblivious RAM and a new balancing scheme. In: SODA, pp. 143\u2013156 (2012)","DOI":"10.1137\/1.9781611973099.13"},{"key":"14_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1007\/978-3-319-96881-0_18","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"KG Larsen","year":"2018","unstructured":"Larsen, K.G., Nielsen, J.B.: Yes, there is an oblivious RAM lower bound!. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018, Part II. LNCS, vol. 10992, pp. 523\u2013542. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96881-0_18"},{"issue":"6","key":"14_CR31","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1007\/s002240000068","volume":"30","author":"FT Leighton","year":"1997","unstructured":"Leighton, F.T., Ma, Y., Suel, T.: On probabilistic networks for selection, merging, and sorting. Theory Comput. Syst. 30(6), 559\u2013582 (1997)","journal-title":"Theory Comput. Syst."},{"key":"14_CR32","unstructured":"Li, Z., Li, B.: Network coding: the case of multiple unicast sessions (2004)"},{"key":"14_CR33","doi-asserted-by":"crossref","unstructured":"Lin, W.-K., Shi, E., Xie, T.: Can we overcome the $$n \\log n$$ barrier for oblivious sorting? In: SODA (2019)","DOI":"10.1137\/1.9781611975482.148"},{"key":"14_CR34","doi-asserted-by":"crossref","unstructured":"Liu, C., Wang, X.S., Nayak, K., Huang, Y., Shi, E.: ObliVM: a programming framework for secure computation. In: IEEE S&P (2015)","DOI":"10.1109\/SP.2015.29"},{"key":"14_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/978-3-642-36594-2_22","volume-title":"Theory of Cryptography","author":"S Lu","year":"2013","unstructured":"Lu, S., Ostrovsky, R.: Distributed oblivious RAM for secure two-party computation. In: Sahai, A. (ed.) TCC 2013. LNCS, vol. 7785, pp. 377\u2013396. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36594-2_22"},{"key":"14_CR36","doi-asserted-by":"crossref","unstructured":"Maas, M., et al.: PHANTOM: practical oblivious computation in a secure processor. In: ACM CCS, pp. 311\u2013324 (2013)","DOI":"10.1145\/2508859.2516692"},{"issue":"4","key":"14_CR37","first-page":"71","volume":"9","author":"GA Margulis","year":"1973","unstructured":"Margulis, G.A.: Explicit constructions of concentrators. Probl. Pereda. Inf. 9(4), 71\u201380 (1973)","journal-title":"Probl. Pereda. Inf."},{"key":"14_CR38","unstructured":"Mitchell, J.C., Zimmerman, J.: Data-oblivious data structures. In: STACS, pp. 554\u2013565 (2014)"},{"key":"14_CR39","doi-asserted-by":"crossref","unstructured":"Ostrovsky, R., Shoup, V.: Private information storage. In: ACM STOC, pp. 294\u2013303 (1997)","DOI":"10.1145\/258533.258606"},{"key":"14_CR40","doi-asserted-by":"crossref","unstructured":"Patel, S., Persiano, G., Raykova, M., Yeo, K.: Oblivious RAM with logarithmic overhead. In: IEEE FOCS, Panorama (2018)","DOI":"10.1109\/FOCS.2018.00087"},{"key":"14_CR41","unstructured":"Pinsker, M.S.: On the complexity of a concentrator. In: 7th International Teletraffic Conference (1973)"},{"issue":"2","key":"14_CR42","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1137\/0206022","volume":"6","author":"N Pippenger","year":"1977","unstructured":"Pippenger, N.: Superconcentrators. SIAM J. Comput. 6(2), 298\u2013304 (1977)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"14_CR43","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1006\/jcss.1996.0005","volume":"52","author":"N Pippenger","year":"1996","unstructured":"Pippenger, N.: Self-routing superconcentrators. J. Comput. Syst. Sci. 52(1), 53\u201360 (1996)","journal-title":"J. Comput. Syst. Sci."},{"key":"14_CR44","doi-asserted-by":"crossref","unstructured":"Ren, L., Yu, X., Fletcher, C.W., van Dijk, M., Devadas, S.: Design space exploration and optimization of path oblivious RAM in secure processors. In: ACM ISCA, pp. 571\u2013582 (2013)","DOI":"10.1145\/2508148.2485971"},{"key":"14_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/978-3-642-25385-0_11","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2011","author":"E Shi","year":"2011","unstructured":"Shi, E., Hubert Chan, T.-H., Stefanov, E., Li, M.: Oblivious RAM with O((logN)3) worst-case cost. In: Lee, D.H., Wang, X. (eds.) ASIACRYPT 2011. LNCS, vol. 7073, pp. 197\u2013214. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25385-0_11"},{"key":"14_CR46","doi-asserted-by":"crossref","unstructured":"Stefanov, E., Shi, E.: Oblivistore: high performance oblivious cloud storage. In: IEEE S&P, pp. 253\u2013267 (2013)","DOI":"10.1109\/SP.2013.25"},{"key":"14_CR47","unstructured":"Stefanov, E., Shi, E., Song, D.X.: Towards practical oblivious RAM. In: NDSS (2012)"},{"key":"14_CR48","doi-asserted-by":"crossref","unstructured":"Stefanov, E., et al.: Path ORAM: an extremely simple oblivious RAM protocol. In: ACM CCS, pp. 299\u2013310 (2013)","DOI":"10.1145\/2508859.2516660"},{"issue":"3","key":"14_CR49","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1016\/S0022-0000(76)80041-4","volume":"13","author":"LG Valiant","year":"1976","unstructured":"Valiant, L.G.: Graph-theoretic properties in computational complexity. J. Comput. Syst. Sci. 13(3), 278\u2013285 (1976)","journal-title":"J. Comput. Syst. Sci."},{"key":"14_CR50","doi-asserted-by":"crossref","unstructured":"Wang, X., Hubert Chan, T.-H., Shi, E.: Circuit ORAM: on tightness of the Goldreich-Ostrovsky lower bound. In: ACM CCS, pp. 850\u2013861 (2015)","DOI":"10.1145\/2810103.2813634"},{"key":"14_CR51","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 CCS, pp. 191\u2013202 (2014)","DOI":"10.1145\/2660267.2660365"},{"key":"14_CR52","doi-asserted-by":"crossref","unstructured":"Williams, P., Sion, R., Tomescu, A.: PrivateFS: a parallel oblivious file system. In: ACM CCS (2012)","DOI":"10.1145\/2382196.2382299"},{"key":"14_CR53","doi-asserted-by":"crossref","unstructured":"Zahur, S., et al.: Revisiting square-root ORAM: efficient random access in multi-party computation. In: IEEE S&P, pp. 218\u2013234 (2016)","DOI":"10.1109\/SP.2016.21"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2020"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-45724-2_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,1]],"date-time":"2023-05-01T00:10:12Z","timestamp":1682899812000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-45724-2_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030457235","9783030457242"],"references-count":53,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-45724-2_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"1 May 2020","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":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 May 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 May 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurocrypt2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocrypt.iacr.org\/2020\/","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":"IACR websubrev","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"375","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":"81","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","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":"20","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)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}