{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,11]],"date-time":"2025-04-11T04:08:06Z","timestamp":1744344486276,"version":"3.40.4"},"publisher-location":"Singapore","reference-count":34,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819709410"},{"type":"electronic","value":"9789819709427"}],"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_10","type":"book-chapter","created":{"date-parts":[[2024,2,25]],"date-time":"2024-02-25T20:02:00Z","timestamp":1708891320000},"page":"183-202","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Geometry-Based Garbled Circuits Relying Solely on\u00a0One Evaluation Algorithm Under Standard Assumption"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6949-6636","authenticated-orcid":false,"given":"Jingyu","family":"Ning","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9870-8925","authenticated-orcid":false,"given":"Zhenhua","family":"Tan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,2,26]]},"reference":[{"key":"10_CR1","doi-asserted-by":"publisher","first-page":"488","DOI":"10.1016\/j.future.2017.12.067","volume":"87","author":"M Alam","year":"2018","unstructured":"Alam, M., et al.: Secure policy execution using reusable garbled circuit in the cloud. Futur. Gener. Comput. Syst. 87, 488\u2013501 (2018). https:\/\/doi.org\/10.1016\/j.future.2017.12.067","journal-title":"Futur. Gener. Comput. Syst."},{"key":"10_CR2","unstructured":"Ashur, T., Cohen, E., Hazay, C., Yanai, A.: A new framework for garbled circuits. Cryptology ePrint Archive, Report 2021\/739 (2021). https:\/\/ia.cr\/2021\/739"},{"key":"10_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"562","DOI":"10.1007\/978-3-030-56880-1_20","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"C Baum","year":"2020","unstructured":"Baum, C., Orsini, E., Scholl, P., Soria-Vazquez, E.: Efficient constant-round MPC with identifiable abort and public verifiability. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. LNCS, vol. 12171, pp. 562\u2013592. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56880-1_20"},{"key":"10_CR4","doi-asserted-by":"publisher","unstructured":"Beaver, D., Micali, S., Rogaway, P.: The round complexity of secure protocols. In: Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing, pp. 503\u2013513. STOC \u201990, Association for Computing Machinery, New York, NY, USA (1990). https:\/\/doi.org\/10.1145\/100216.100287","DOI":"10.1145\/100216.100287"},{"key":"10_CR5","doi-asserted-by":"publisher","unstructured":"Bellare, M., Hoang, V.T., Keelveedhi, S., Rogaway, P.: Efficient garbling from a fixed-key blockcipher. In: 2013 IEEE Symposium on Security and Privacy, pp. 478\u2013492 (2013). https:\/\/doi.org\/10.1109\/SP.2013.39","DOI":"10.1109\/SP.2013.39"},{"key":"10_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-030-77883-5_2","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2021","author":"A Ben-Efraim","year":"2021","unstructured":"Ben-Efraim, A., Cong, K., Omri, E., Orsini, E., Smart, N.P., Soria-Vazquez, E.: Large scale, actively secure computation from LPN and Free-XOR garbled circuits. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021. LNCS, vol. 12698, pp. 33\u201363. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77883-5_2"},{"key":"10_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/978-3-642-28914-9_3","volume-title":"Theory of Cryptography","author":"SG Choi","year":"2012","unstructured":"Choi, S.G., Katz, J., Kumaresan, R., Zhou, H.-S.: On the security of the Free-XOR technique. In: Cramer, R. (ed.) TCC 2012. LNCS, vol. 7194, pp. 39\u201353. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-28914-9_3"},{"key":"10_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/978-3-030-77883-5_3","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2021","author":"M Ciampi","year":"2021","unstructured":"Ciampi, M., Goyal, V., Ostrovsky, R.: Threshold garbled circuits and ad hoc secure computation. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021. LNCS, vol. 12698, pp. 64\u201393. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77883-5_3"},{"key":"10_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"828","DOI":"10.1007\/978-3-030-45724-2_28","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"R Cohen","year":"2020","unstructured":"Cohen, R., Garay, J., Zikas, V.: Broadcast-optimal two-round MPC. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. LNCS, vol. 12106, pp. 828\u2013858. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45724-2_28"},{"key":"10_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/978-3-642-54807-9_15","volume-title":"Compiler Construction","author":"M Franz","year":"2014","unstructured":"Franz, M., Holzer, A., Katzenbeisser, S., Schallhart, C., Veith, H.: CBMC-GC: an ANSI C compiler for secure two-party computations. In: Cohen, A. (ed.) CC 2014. LNCS, vol. 8409, pp. 244\u2013249. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54807-9_15"},{"key":"10_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/978-3-662-46803-6_7","volume-title":"Advances in Cryptology - EUROCRYPT 2015","author":"TK Frederiksen","year":"2015","unstructured":"Frederiksen, T.K., Nielsen, J.B., Orlandi, C.: Privacy-free garbled circuits with applications to efficient zero-knowledge. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9057, pp. 191\u2013219. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46803-6_7"},{"issue":"3","key":"10_CR12","doi-asserted-by":"publisher","first-page":"798","DOI":"10.1007\/s00145-017-9271-y","volume":"31","author":"S Gueron","year":"2018","unstructured":"Gueron, S., Lindell, Y., Nof, A., Pinkas, B.: Fast garbling of circuits under standard assumptions. J. Cryptol. 31(3), 798\u2013844 (2018). https:\/\/doi.org\/10.1007\/s00145-017-9271-y","journal-title":"J. Cryptol."},{"key":"10_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"793","DOI":"10.1007\/978-3-030-56880-1_28","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"C Guo","year":"2020","unstructured":"Guo, C., Katz, J., Wang, X., Weng, C., Yu, Yu.: Better concrete security for half-gates garbling (in the multi-instance setting). In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. LNCS, vol. 12171, pp. 793\u2013822. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56880-1_28"},{"key":"10_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"763","DOI":"10.1007\/978-3-030-56880-1_27","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"D Heath","year":"2020","unstructured":"Heath, D., Kolesnikov, V.: Stacked garbling. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. LNCS, vol. 12171, pp. 763\u2013792. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56880-1_27"},{"key":"10_CR15","doi-asserted-by":"publisher","unstructured":"Huang, Y., Evans, D., Katz, J., Malka, L.: Faster secure two-party computation using garbled circuits. In: Proceedings of the 20th USENIX Conference on Security, p. 35. SEC\u201911, USENIX Association, USA (2011). https:\/\/doi.org\/10.5555\/2028067.2028102","DOI":"10.5555\/2028067.2028102"},{"key":"10_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1007\/978-3-662-44381-1_25","volume-title":"Advances in Cryptology \u2013 CRYPTO 2014","author":"V Kolesnikov","year":"2014","unstructured":"Kolesnikov, V., Mohassel, P., Rosulek, M.: FleXOR: flexible garbling for XOR gates that beats free-XOR. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014. LNCS, vol. 8617, pp. 440\u2013457. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44381-1_25"},{"key":"10_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1007\/978-3-540-70583-3_40","volume-title":"Automata, Languages and Programming","author":"V Kolesnikov","year":"2008","unstructured":"Kolesnikov, V., Schneider, T.: Improved garbled circuit: free XOR gates and applications. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008. LNCS, vol. 5126, pp. 486\u2013498. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-70583-3_40"},{"key":"10_CR18","first-page":"179","volume":"2012","author":"B Kreuter","year":"2012","unstructured":"Kreuter, B., Shelat, A., Shen, C.H.: Towards billion-gate secure computation with malicious adversaries. IACR Cryptol. ePrint Arch. 2012, 179 (2012)","journal-title":"IACR Cryptol. ePrint Arch."},{"issue":"2","key":"10_CR19","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1007\/s00145-015-9198-0","volume":"29","author":"Y Lindell","year":"2016","unstructured":"Lindell, Y.: Fast cut-and-choose-based protocols for malicious and covert adversaries. J. Cryptol. 29(2), 456\u2013490 (2016). https:\/\/doi.org\/10.1007\/s00145-015-9198-0","journal-title":"J. Cryptol."},{"issue":"2","key":"10_CR20","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/s00145-008-9036-8","volume":"22","author":"Y Lindell","year":"2009","unstructured":"Lindell, Y., Pinkas, B.: A proof of security of Yao\u2019s protocol for two-party computation. J. Cryptol. 22(2), 161\u2013188 (2009). https:\/\/doi.org\/10.1007\/s00145-008-9036-8","journal-title":"J. Cryptol."},{"issue":"4","key":"10_CR21","doi-asserted-by":"publisher","first-page":"680","DOI":"10.1007\/s00145-011-9107-0","volume":"25","author":"Y Lindell","year":"2012","unstructured":"Lindell, Y., Pinkas, B.: Secure two-party computation via cut-and-choose oblivious transfer. J. Cryptol. 25(4), 680\u2013722 (2012). https:\/\/doi.org\/10.1007\/s00145-011-9107-0","journal-title":"J. Cryptol."},{"key":"10_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/978-3-540-85855-3_2","volume-title":"Security and Cryptography for Networks","author":"Y Lindell","year":"2008","unstructured":"Lindell, Y., Pinkas, B., Smart, N.P.: Implementing two-party computation efficiently with security against malicious adversaries. In: Ostrovsky, R., De Prisco, R., Visconti, I. (eds.) SCN 2008. LNCS, vol. 5229, pp. 2\u201320. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85855-3_2"},{"key":"10_CR23","doi-asserted-by":"publisher","unstructured":"Naor, M., Pinkas, B., Sumner, R.: Privacy preserving auctions and mechanism design. In: Proceedings of the 1st ACM Conference on Electronic Commerce, pp. 129\u2013139. EC \u201999, Association for Computing Machinery, New York, NY, USA (1999). https:\/\/doi.org\/10.1145\/336992.337028","DOI":"10.1145\/336992.337028"},{"key":"10_CR24","doi-asserted-by":"publisher","unstructured":"Pinkas, B., Schneider, T., Smart, N.P., Williams, S.C.: Secure two-party computation is practical. In: Proceedings of the 15th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology, pp. 250\u2013267. ASIACRYPT \u201909, Springer-Verlag, Berlin, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-10366-7_15","DOI":"10.1007\/978-3-642-10366-7_15"},{"key":"10_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/978-3-319-71667-1_17","volume-title":"Progress in Cryptology \u2013 INDOCRYPT 2017","author":"M Rosulek","year":"2017","unstructured":"Rosulek, M.: Improvements for gate-hiding garbled circuits. In: Patra, A., Smart, N.P. (eds.) INDOCRYPT 2017. LNCS, vol. 10698, pp. 325\u2013345. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-71667-1_17"},{"key":"10_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/978-3-030-84242-0_5","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"M Rosulek","year":"2021","unstructured":"Rosulek, M., Roy, L.: Three halves make a whole? Beating the half-gates lower bound for garbled circuits. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12825, pp. 94\u2013124. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84242-0_5"},{"key":"10_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1007\/978-3-642-20465-4_22","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2011","author":"A shelat","year":"2011","unstructured":"shelat, A., Shen, C.: Two-output secure computation with malicious adversaries. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol. 6632, pp. 386\u2013405. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20465-4_22"},{"key":"10_CR28","doi-asserted-by":"publisher","unstructured":"Tan, Z., Ning, J.: Lightweight garbled circuit protocol based on solid geometry transformation under standard PRF assumption. Chinese J. Comput. 64(10), 2240\u20132257 (2023). https:\/\/doi.org\/10.11897\/SP.J.1016.2023.02240","DOI":"10.11897\/SP.J.1016.2023.02240"},{"key":"10_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/978-3-642-40084-1_2","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"Y Huang","year":"2013","unstructured":"Huang, Y., Katz, J., Evans, D.: Efficient secure two-party computation using symmetric cut-and-choose. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013. LNCS, vol. 8043, pp. 18\u201335. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40084-1_2"},{"key":"10_CR30","doi-asserted-by":"publisher","unstructured":"Yang, K., Wang, X., Zhang, J.: More efficient MPC from improved triple generation and authenticated garbling. In: Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security, pp. 1627\u20131646. CCS \u201920, Association for Computing Machinery, New York, NY, USA (2020). https:\/\/doi.org\/10.1145\/3372297.3417285","DOI":"10.1145\/3372297.3417285"},{"issue":"4","key":"10_CR31","doi-asserted-by":"publisher","first-page":"913","DOI":"10.1109\/TIFS.2018.2868221","volume":"14","author":"Q Yang","year":"2019","unstructured":"Yang, Q., Peng, G., Gasti, P., Balagani, K.S., Li, Y., Zhou, G.: Meg: Memory and energy efficient garbled circuit evaluation on smartphones. IEEE Trans. Inf. Forensics Secur. 14(4), 913\u2013922 (2019). https:\/\/doi.org\/10.1109\/TIFS.2018.2868221","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"10_CR32","doi-asserted-by":"publisher","unstructured":"Yao, A.C.C.: How to generate and exchange secrets. In: 27th Annual Symposium on Foundations of Computer Science (SFCS 1986), pp. 162\u2013167. IEEE (1986). https:\/\/doi.org\/10.1109\/SFCS.1986.25","DOI":"10.1109\/SFCS.1986.25"},{"key":"10_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1007\/978-3-662-46803-6_8","volume-title":"Advances in Cryptology - EUROCRYPT 2015","author":"S Zahur","year":"2015","unstructured":"Zahur, S., Rosulek, M., Evans, D.: Two halves make a whole. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9057, pp. 220\u2013250. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46803-6_8"},{"key":"10_CR34","doi-asserted-by":"publisher","DOI":"10.1016\/j.cose.2022.102782","volume":"120","author":"Z Zhou","year":"2022","unstructured":"Zhou, Z., Fu, Q., Wei, Q., Li, Q.: Lego: a hybrid toolkit for efficient 2PC-based privacy-preserving machine learning. Comput. Secur. 120, 102782 (2022). https:\/\/doi.org\/10.1016\/j.cose.2022.102782","journal-title":"Comput. Secur."}],"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_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,10]],"date-time":"2025-04-10T11:11:33Z","timestamp":1744283493000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-97-0942-7_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9789819709410","9789819709427"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-981-97-0942-7_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"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)"}}]}}