{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T16:02:51Z","timestamp":1780675371562,"version":"3.54.1"},"publisher-location":"Singapore","reference-count":42,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819709410","type":"print"},{"value":"9789819709427","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-981-97-0942-7_20","type":"book-chapter","created":{"date-parts":[[2024,2,25]],"date-time":"2024-02-25T20:02:00Z","timestamp":1708891320000},"page":"397-417","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["XPORAM: A Practical Multi-client ORAM Against Malicious Adversaries"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2883-3998","authenticated-orcid":false,"given":"Biao","family":"Gao","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shijie","family":"Jia","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jiankuo","family":"Dong","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Peixin","family":"Ren","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,2,26]]},"reference":[{"key":"20_CR1","doi-asserted-by":"crossref","unstructured":"Ahmad, A., Kim, K., Sarfaraz, M.I., Lee, B.: OBLIVIATE: a data oblivious filesystem for intel SGX. In: NDSS (2018)","DOI":"10.14722\/ndss.2018.23284"},{"key":"20_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/978-3-642-54631-0_8","volume-title":"Public-Key Cryptography \u2013 PKC 2014","author":"D Apon","year":"2014","unstructured":"Apon, D., Katz, J., Shi, E., Thiruvengadam, A.: Verifiable oblivious storage. In: Krawczyk, H. (ed.) PKC 2014. LNCS, vol. 8383, pp. 131\u2013148. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54631-0_8"},{"issue":"1","key":"20_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3566049","volume":"70","author":"G Asharov","year":"2022","unstructured":"Asharov, G., Komargodski, I., Lin, W.K., Nayak, K., Peserico, E., Shi, E.: Optorama: optimal oblivious ram. J. ACM 70(1), 1\u201370 (2022)","journal-title":"J. ACM"},{"key":"20_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"686","DOI":"10.1007\/978-3-319-61204-1_34","volume-title":"Applied Cryptography and Network Security","author":"E-O Blass","year":"2017","unstructured":"Blass, E.-O., Mayberry, T., Noubir, G.: Multi-client oblivious RAM secure against malicious servers. In: Gollmann, D., Miyaji, A., Kikuchi, H. (eds.) ACNS 2017. LNCS, vol. 10355, pp. 686\u2013707. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-61204-1_34"},{"key":"20_CR5","doi-asserted-by":"publisher","first-page":"5143","DOI":"10.1109\/TDSC.2023.3241184","volume":"20","author":"W Cheng","year":"2023","unstructured":"Cheng, W., Sang, D., Zeng, L., Wang, Y., Brinkmann, A.: TIANJI: securing a practical asynchronous multi-user ORAM. IEEE Trans. Depend. Secure Comput. 20, 5143\u20135155 (2023)","journal-title":"IEEE Trans. Depend. Secure Comput."},{"key":"20_CR6","doi-asserted-by":"publisher","unstructured":"Chor, B., Goldreich, O., Kushilevitz, E., Sudan, M.: Private information retrieval. In: Proceedings of IEEE 36th Annual Foundations of Computer Science, Wisconsin, USA, pp. 41\u201350. IEEE (1995). https:\/\/doi.org\/10.1109\/SFCS.1995.492461","DOI":"10.1109\/SFCS.1995.492461"},{"key":"20_CR7","unstructured":"Dauterman, E., Feng, E., Luo, E., Popa, R.A., Stoica, I.: $$\\{$$DORY$$\\}$$: An encrypted search system with distributed trust. In: 14th USENIX Symposium on Operating Systems Design and Implementation (OSDI 20), pp. 1101\u20131119 (2020)"},{"key":"20_CR8","unstructured":"Dautrich, J., Stefanov, E., Shi, E.: Burst ORAM: minimizing ORAM response times for bursty access patterns. In: 23rd USENIX Security Symposium (USENIX Security 14), Berkley, CA, pp. 749\u2013764. USENIX Association (2014)"},{"key":"20_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/978-3-662-49099-0_6","volume-title":"Theory of Cryptography","author":"S Devadas","year":"2016","unstructured":"Devadas, S., van Dijk, M., Fletcher, C.W., Ren, L., Shi, E., Wichs, D.: Onion ORAM: a constant bandwidth blowup oblivious RAM. In: Kushilevitz, E., Malkin, T. (eds.) TCC 2016. LNCS, vol. 9563, pp. 145\u2013174. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49099-0_6"},{"key":"20_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/978-3-642-27576-0_11","volume-title":"Financial Cryptography and Data Security","author":"M Franz","year":"2012","unstructured":"Franz, M., et al.: Oblivious outsourced storage with delegation. In: Danezis, G. (ed.) FC 2011. LNCS, vol. 7035, pp. 127\u2013140. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-27576-0_11"},{"key":"20_CR11","doi-asserted-by":"crossref","unstructured":"Gao, B., Chen, B., Jia, S., Xia, L.: EHIFS: an efficient history independent file system. In: Proceedings of the 2019 ACM Asia Conference on Computer and Communications Security, pp. 573\u2013585 (2019)","DOI":"10.1145\/3321705.3329839"},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"Goldreich, O.: Towards a theory of software protection and simulation by oblivious rams. In: Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, New York, NY, USA, pp. 182\u2013194. STOC \u201987, Association for Computing Machinery (1987)","DOI":"10.1145\/28395.28416"},{"issue":"3","key":"20_CR13","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 (JACM) 43(3), 431\u2013473 (1996)","journal-title":"J. ACM (JACM)"},{"key":"20_CR14","doi-asserted-by":"crossref","unstructured":"Hoang, T., Guajardo, J., Yavuz, A.A.: MACAO: a maliciously-secure and client-efficient active ORAM framework. In: 27th Annual Network and Distributed System Security Symposium, NDSS 2020, San Diego, California, USA, February 23\u201326 (2020)","DOI":"10.14722\/ndss.2020.24313"},{"issue":"4","key":"20_CR15","doi-asserted-by":"publisher","first-page":"602","DOI":"10.1109\/TSC.2019.2962110","volume":"13","author":"Y Huang","year":"2020","unstructured":"Huang, Y., et al.: ThinORAM: towards practical oblivious data access in fog computing environment. IEEE Trans. Serv. Comput. 13(4), 602\u2013612 (2020)","journal-title":"IEEE Trans. Serv. Comput."},{"key":"20_CR16","unstructured":"Islam, M.S., Kuzu, M., Kantarcioglu, M.: Access pattern disclosure on searchable encryption: ramification, attack and mitigation. In: NDSS, vol. 20, p. 12 (2012)"},{"key":"20_CR17","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/978-3-540-30115-8_22","volume-title":"Machine Learning: ECML 2004","author":"B Klimt","year":"2004","unstructured":"Klimt, B., Yang, Y.: The Enron corpus: a new dataset for email classification research. In: Boulicaut, J.-F., Esposito, F., Giannotti, F., Pedreschi, D. (eds.) ECML 2004. LNCS (LNAI), vol. 3201, pp. 217\u2013226. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30115-8_22"},{"key":"20_CR18","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. LNCS, vol. 10992, pp. 523\u2013542. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96881-0_18"},{"key":"20_CR19","doi-asserted-by":"crossref","unstructured":"Liu, C., Wang, X.S., Nayak, K., Huang, Y., Shi, E.: OBLIVM: a programming framework for secure computation. In: 2015 IEEE Symposium on Security and Privacy, pp. 359\u2013376. IEEE (2015)","DOI":"10.1109\/SP.2015.29"},{"key":"20_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ins.2018.02.071","volume":"447","author":"Z Liu","year":"2018","unstructured":"Liu, Z., Huang, Y., Li, J., Cheng, X., Shen, C.: DivORAM: towards a practical oblivious ram with variable block size. Inf. Sci. 447, 1\u201311 (2018)","journal-title":"Inf. Sci."},{"issue":"4","key":"20_CR21","doi-asserted-by":"publisher","first-page":"714","DOI":"10.1109\/TKDE.2019.2891581","volume":"32","author":"Z Liu","year":"2019","unstructured":"Liu, Z., Li, B., Huang, Y., Li, J., Xiang, Y., Pedrycz, W.: NewMCOS: towards a practical multi-cloud oblivious storage scheme. IEEE Trans. Knowl. Data Eng. 32(4), 714\u2013727 (2019)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"20_CR22","doi-asserted-by":"crossref","unstructured":"Maas, M., et al.: Phantom: practical oblivious computation in a secure processor. In: Proceedings of the 2013 ACM SIGSAC Conference on Computer & Communications Security, pp. 311\u2013324 (2013)","DOI":"10.1145\/2508859.2516692"},{"key":"20_CR23","doi-asserted-by":"crossref","unstructured":"Maffei, M., Malavolta, G., Reinert, M., Schr\u00f6der, D.: Privacy and access control for outsourced personal records. In: 2015 IEEE Symposium on Security and Privacy, pp. 341\u2013358. IEEE (2015)","DOI":"10.1109\/SP.2015.28"},{"key":"20_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1007\/978-3-319-61204-1_32","volume-title":"Applied Cryptography and Network Security","author":"M Maffei","year":"2017","unstructured":"Maffei, M., Malavolta, G., Reinert, M., Schr\u00f6der, D.: Maliciously secure multi-client ORAM. In: Gollmann, D., Miyaji, A., Kikuchi, H. (eds.) ACNS 2017. LNCS, vol. 10355, pp. 645\u2013664. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-61204-1_32"},{"key":"20_CR25","doi-asserted-by":"crossref","unstructured":"Mayberry, T., Blass, E., Chan, A.H.: Efficient private file retrieval by combining ORAM and PIR. In: 21st Annual Network and Distributed System Security Symposium, NDSS. The Internet Society (2014)","DOI":"10.14722\/ndss.2014.23033"},{"key":"20_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/978-3-642-14623-7_27","volume-title":"Advances in Cryptology \u2013 CRYPTO 2010","author":"B Pinkas","year":"2010","unstructured":"Pinkas, B., Reinman, T.: Oblivious RAM revisited. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 502\u2013519. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14623-7_27"},{"key":"20_CR27","unstructured":"Ren, L., et al.: Constants count: Practical improvements to oblivious RAM. In: 24th USENIX Security Symposium (USENIX Security 15), Washington, D.C., pp. 415\u2013430. USENIX Association (2015)"},{"key":"20_CR28","doi-asserted-by":"crossref","unstructured":"Roche, D.S., Aviv, A., Choi, S.G.: A practical oblivious map data structure with secure deletion and history independence. In: 2016 IEEE Symposium on Security and Privacy (SP), pp. 178\u2013197. IEEE (2016)","DOI":"10.1109\/SP.2016.19"},{"key":"20_CR29","doi-asserted-by":"crossref","unstructured":"Sahin, C., Zakhary, V., El Abbadi, A., Lin, H., Tessaro, S.: Taostore: overcoming asynchronicity in oblivious data storage. In: 2016 IEEE Symposium on Security and Privacy (SP), pp. 198\u2013217. IEEE (2016)","DOI":"10.1109\/SP.2016.20"},{"key":"20_CR30","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., Chan, T.-H.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":"20_CR31","doi-asserted-by":"crossref","unstructured":"Stefanov, E., et al.: Path ORAM: an extremely simple oblivious ram protocol. In: Proceedings of the 2013 ACM SIGSAC Conference on Computer & Communications Security. CCS 2013, New York, NY, USA, pp. 299\u2013310. Association for Computing Machinery (2013)","DOI":"10.1145\/2508859.2516660"},{"key":"20_CR32","doi-asserted-by":"crossref","unstructured":"Stefanov, E., Shi, E.: Multi-cloud oblivious storage. In: Proceedings of the 2013 ACM SIGSAC Conference on Computer & Communications Security. CCS 2013, New York, NY, USA, pp. 247\u2013258. Association for Computing Machinery (2013)","DOI":"10.1145\/2508859.2516673"},{"key":"20_CR33","doi-asserted-by":"crossref","unstructured":"Stefanov, E., Shi, E.: ObliviStore: high performance oblivious cloud storage. In: 2013 IEEE Symposium on Security and Privacy, pp. 253\u2013267. IEEE (2013)","DOI":"10.1109\/SP.2013.25"},{"key":"20_CR34","unstructured":"Stefanov, E., Shi, E., Song, D.X.: Towards practical oblivious RAM. In: 19th Annual Network and Distributed System Security Symposium, NDSS 2012, San Diego, California, USA,, Reston, VA, USA 5\u20138 February, pp. 1\u201340. The Internet Society (2012)"},{"key":"20_CR35","unstructured":"Tople, S., Jia, Y., Saxena, P.: Pro-ORAM: practical read-only oblivious ram. In: RAID, pp. 197\u2013211 (2019)"},{"key":"20_CR36","unstructured":"Vadapalli, A., Henry, R., Goldberg, I.: DuORAM: a bandwidth-efficient distributed ORAM for 2-and 3-party computation. In: 32nd USENIX Security Symposium (2023)"},{"key":"20_CR37","doi-asserted-by":"crossref","unstructured":"Wang, X.S., Huang, Y., Chan, T.H., Shelat, A., Shi, E.: ScORAM: oblivious ram for secure computation. In: Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security. CCS 2014, pp. 191\u2013202 (2014)","DOI":"10.1145\/2660267.2660365"},{"key":"20_CR38","doi-asserted-by":"crossref","unstructured":"Wang, X.S., et al.: Oblivious data structures. In: Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security, pp. 215\u2013226 (2014)","DOI":"10.1145\/2660267.2660314"},{"key":"20_CR39","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-031-22390-7_1","volume-title":"ISC 2022","author":"Y Wang","year":"2022","unstructured":"Wang, Y., Malluhi, Q.M.: Privacy preserving computation in cloud using reusable garbled oblivious rams. In: Susilo, W., Chen, X., Guo, F., Zhang, Y., Intan, R. (eds.) ISC 2022. LNCS, vol. 13640, pp. 3\u201319. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22390-7_1"},{"key":"20_CR40","doi-asserted-by":"crossref","unstructured":"Williams, P., Sion, R., Tomescu, A.: PrivateFS: a parallel oblivious file system. In: Proceedings of the 2012 ACM Conference on Computer and Communications Security, pp. 977\u2013988 (2012)","DOI":"10.1145\/2382196.2382299"},{"issue":"9","key":"20_CR41","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.7651","volume":"35","author":"W Xu","year":"2023","unstructured":"Xu, W., Zhang, J., Yuan, Y., Wang, X.: Symmetric searchable encryption with supporting search pattern and access pattern protection in multi-cloud. Concurr. Comput. Pract. Exp. 35(9), e7651 (2023)","journal-title":"Concurr. Comput. Pract. Exp."},{"key":"20_CR42","doi-asserted-by":"crossref","unstructured":"Zahur, S., et al.: Revisiting square-root ORAM: efficient random access in multi-party computation. In: 2016 IEEE Symposium on Security and Privacy (SP), pp. 218\u2013234. IEEE (2016)","DOI":"10.1109\/SP.2016.21"}],"container-title":["Lecture Notes in Computer Science","Information Security and Cryptology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-97-0942-7_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,10]],"date-time":"2025-04-10T11:11:12Z","timestamp":1744283472000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-97-0942-7_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9789819709410","9789819709427"],"references-count":42,"URL":"https:\/\/doi.org\/10.1007\/978-981-97-0942-7_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"26 February 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"Inscrypt","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Information Security and Cryptology","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hangzhou","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","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":"9 December 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cisc2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/link.springer.com\/conference\/cisc","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":"152","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":"38","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":"7","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":"25% - 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","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)"}}]}}