{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T00:59:02Z","timestamp":1780966742049,"version":"3.54.1"},"publisher-location":"Cham","reference-count":66,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030783747","type":"print"},{"value":"9783030783754","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-78375-4_5","type":"book-chapter","created":{"date-parts":[[2021,6,9]],"date-time":"2021-06-09T04:12:10Z","timestamp":1623211930000},"page":"99-121","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["LLVM-Based Circuit Compilation for Practical Secure Computation"],"prefix":"10.1007","author":[{"given":"Tim","family":"Heldmann","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Thomas","family":"Schneider","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Oleksandr","family":"Tkachenko","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Christian","family":"Weinert","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hossein","family":"Yalame","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,6,10]]},"reference":[{"key":"5_CR1","unstructured":"ABC: A system for sequential synthesis and verification. http:\/\/www.eecs.berkeley.edu\/~alanmi\/abc\/"},{"key":"5_CR2","unstructured":"Aly, A., et al.: SCALE-MAMBA v1. 10: Documentation (2020)"},{"key":"5_CR3","unstructured":"Archer, D., et al.: Bristol Fashion MPC circuits (2020). https:\/\/homes.esat.kuleuven.be\/~nsmart\/MPC\/"},{"key":"5_CR4","unstructured":"Barrio, P., Carruth, C., Molloy, J.: Recursion inlining in LLVM (2015). https:\/\/www.llvm.org\/devmtg\/2015-04\/slides\/recursion-inlining-2015.pdf"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Beaver, D., Micali, S., Rogaway, P.: The round complexity of secure protocols (extended abstract). In: STOC (1990)","DOI":"10.1145\/100216.100287"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Ben-David, A., Nisan, N., Pinkas, B.: FairplayMP: a system for secure multi-party computation. In: CCS (2008)","DOI":"10.1145\/1455770.1455804"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Boemer, F., Cammarota, R., Demmler, D., Schneider, T., Yalame, H.: MP2ML: a mixed-protocol machine learning framework for private inference. In: ARES (2020)","DOI":"10.1145\/3411501.3419425"},{"key":"5_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1007\/978-3-540-88313-5_13","volume-title":"Computer Security - ESORICS 2008","author":"D Bogdanov","year":"2008","unstructured":"Bogdanov, D., Laur, S., Willemson, J.: Sharemind: a framework for fast privacy-preserving computations. In: Jajodia, S., Lopez, J. (eds.) ESORICS 2008. LNCS, vol. 5283, pp. 192\u2013206. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-88313-5_13"},{"key":"5_CR9","unstructured":"Boston University: JIFF: JavaScript implementation of federated functionalities (2015). https:\/\/github.com\/multiparty\/jiff\/"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Boyar, J., Damg\u00e5rd, I., Peralta, R.: Short non-interactive cryptographic proofs. J. Cryptol. 13, 449\u2013472 (2000)","DOI":"10.1007\/s001450010011"},{"key":"5_CR11","unstructured":"Braun, L., Demmler, D., Schneider, T., Tkachenko, O.: MOTION - A framework for mixed-protocol multi-party computation. ePrint (2020). https:\/\/ia.cr\/2020\/1137"},{"key":"5_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/978-3-030-57808-4_23","volume-title":"Applied Cryptography and Network Security","author":"N B\u00fcscher","year":"2020","unstructured":"B\u00fcscher, N., et al.: Secure two-party computation in a quantum world. In: Conti, M., Zhou, J., Casalicchio, E., Spognardi, A. (eds.) ACNS 2020. LNCS, vol. 12146, pp. 461\u2013480. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-57808-4_23"},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"B\u00fcscher, N., Demmler, D., Katzenbeisser, S., Kretzmer, D., Schneider, T.: HyCC: compilation of hybrid protocols for practical secure computation. In: CCS (2018)","DOI":"10.1145\/3243734.3243786"},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"Chandran, N., Gupta, D., Rastogi, A., Sharma, R., Tripathi, S.: EzPC: programmable, efficient, and scalable secure two-party computation for machine learning. In: EuroS&P (2019)","DOI":"10.1109\/EuroSP.2019.00043"},{"key":"5_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1007\/978-3-540-24730-2_15","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"E Clarke","year":"2004","unstructured":"Clarke, E., Kroening, D., Lerda, F.: A tool for checking ANSI-C programs. In: Jensen, K., Podelski, A. (eds.) TACAS 2004. LNCS, vol. 2988, pp. 168\u2013176. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24730-2_15"},{"key":"5_CR16","doi-asserted-by":"publisher","unstructured":"Coussy, P., Morawiec, A.: High-Level Synthesis: From Algorithm to Digital Circuit. Springer, Dordrecht (2008). https:\/\/doi.org\/10.1007\/978-1-4020-8588-8","DOI":"10.1007\/978-1-4020-8588-8"},{"key":"5_CR17","doi-asserted-by":"crossref","unstructured":"Demmler, D., Dessouky, G., Koushanfar, F., Sadeghi, A., Schneider, T., Zeitouni, S.: Automated synthesis of optimized circuits for secure computation. In: CCS (2015)","DOI":"10.1145\/2810103.2813678"},{"key":"5_CR18","doi-asserted-by":"crossref","unstructured":"Demmler, D., Schneider, T., Zohner, M.: ABY - a framework for efficient mixed-protocol secure two-party computation. In: NDSS (2015)","DOI":"10.14722\/ndss.2015.23113"},{"key":"5_CR19","doi-asserted-by":"crossref","unstructured":"Dessouky, G., Koushanfar, F., Sadeghi, A.R., Schneider, T., Zeitouni, S., Zohner, M.: Pushing the communication barrier in secure computation using lookup tables. In: NDSS (2017)","DOI":"10.14722\/ndss.2017.23097"},{"key":"5_CR20","doi-asserted-by":"crossref","unstructured":"Fereidooni, H., et al.: SAFELearn: secure aggregation for private federated learning. In: Deep Learning and Security Workshop (2021)","DOI":"10.1109\/SPW53761.2021.00017"},{"key":"5_CR21","doi-asserted-by":"crossref","unstructured":"Fowler, D., Robson, E.: Square root approximations in old Babylonian mathematics: YBC 7289 in context. Historia Mathematica (1998)","DOI":"10.1006\/hmat.1998.2209"},{"key":"5_CR22","unstructured":"Fraser, C.W., Hanson, D.R.: A Retargetable C Compiler: Design and Implementation. Addison-Wesley (1995)"},{"key":"5_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 (1987)","DOI":"10.1145\/28395.28420"},{"key":"5_CR24","doi-asserted-by":"crossref","unstructured":"Gueron, S., Lindell, Y., Nof, A., Pinkas, B.: Fast garbling of circuits under standard assumptions. In: CCS, pp. 567\u2013578. ACM (2015)","DOI":"10.1145\/2810103.2813619"},{"key":"5_CR25","doi-asserted-by":"crossref","unstructured":"Hastings, M., Hemenway, B., Noble, D., Zdancewic, S.: SoK: general purpose compilers for secure multi-party computation. In: S&P (2019)","DOI":"10.1109\/SP.2019.00028"},{"key":"5_CR26","doi-asserted-by":"crossref","unstructured":"Henecka, W., K\u00f6gl, S., Sadeghi, A., Schneider, T., Wehrenberg, I.: TASTY: tool for automating secure two-party computations. In: CCS (2010)","DOI":"10.1145\/1866307.1866358"},{"key":"5_CR27","doi-asserted-by":"crossref","unstructured":"Holzer, A., Franz, M., Katzenbeisser, S., Veith, H.: Secure two-party computations in ANSI C. In: CCS (2012)","DOI":"10.1145\/2382196.2382278"},{"key":"5_CR28","unstructured":"Huang, Y., Evans, D., Katz, J.: Private set intersection: are garbled circuits better than custom protocols? In: NDSS (2012)"},{"key":"5_CR29","doi-asserted-by":"crossref","unstructured":"Huang, Y., Evans, D., Katz, J., Malka, L.: Faster secure two-party computation using garbled circuits. In: USENIX Security (2011)","DOI":"10.1007\/978-3-642-25560-1_2"},{"key":"5_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/978-3-540-45146-4_9","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"Y Ishai","year":"2003","unstructured":"Ishai, Y., Kilian, J., Nissim, K., Petrank, E.: Extending oblivious transfers efficiently. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 145\u2013161. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45146-4_9"},{"key":"5_CR31","doi-asserted-by":"crossref","unstructured":"Ishaq, M., Milanova, A.L., Zikas, V.: Efficient MPC via program analysis: a framework for efficient optimal mixing. In: CCS (2019)","DOI":"10.1145\/3319535.3339818"},{"key":"5_CR32","doi-asserted-by":"crossref","unstructured":"Javadi, M., Yalame, H., Mahdiani, H.: Small constant mean-error imprecise adder\/multiplier for efficient VLSI implementation of MAC-based applications. IEEE Trans. Comput. (2020)","DOI":"10.1109\/TC.2020.2972549"},{"key":"5_CR33","doi-asserted-by":"crossref","unstructured":"Keller, M.: MP-SPDZ: a versatile framework for multi-party computation. In: CCS (2020)","DOI":"10.1145\/3372297.3417872"},{"key":"5_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-10433-6_1","volume-title":"Cryptology and Network Security","author":"V Kolesnikov","year":"2009","unstructured":"Kolesnikov, V., Sadeghi, A.-R., Schneider, T.: Improved garbled circuit building blocks and applications to auctions and computing minima. In: Garay, J.A., Miyaji, A., Otsuka, A. (eds.) CANS 2009. LNCS, vol. 5888, pp. 1\u201320. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-10433-6_1"},{"key":"5_CR35","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":"5_CR36","unstructured":"Kreuter, B., Shelat, A., Mood, B., Butler, K.: PCF: a portable circuit format for scalable two-party secure computation. In: USENIX Security (2013)"},{"key":"5_CR37","doi-asserted-by":"crossref","unstructured":"Kreuter, B., Shelat, A., Shen, C.H.: Billion-gate secure computation with malicious adversaries. In: USENIX Security (2012)","DOI":"10.1007\/978-3-642-20465-4_22"},{"key":"5_CR38","unstructured":"Lattner, C., Adve, V.S.: LLVM: a compilation framework for lifelong program analysis & transformation. In: Code Generation and Optimization (2004)"},{"key":"5_CR39","unstructured":"LLVM Community: CIRCT \/ Circuit IR compilers and tools (2020). https:\/\/github.com\/llvm\/circt"},{"key":"5_CR40","unstructured":"LLVM Project: LLVM\u2019s analysis and transform passes (2020). https:\/\/llvm.org\/docs\/Passes.html"},{"key":"5_CR41","unstructured":"Malkhi, D., Nisan, N., Pinkas, B., Sella, Y.: Fairplay - Secure two-party computation system. In: USENIX Security (2004)"},{"key":"5_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1007\/978-3-030-65411-5_25","volume-title":"Cryptology and Network Security","author":"H Mantel","year":"2020","unstructured":"Mantel, H., Scheidel, L., Schneider, T., Weber, A., Weinert, C., Wei\u00dfmantel, T.: RiCaSi: rigorous cache side channel mitigation via selective circuit compilation. In: Krenn, S., Shulman, H., Vaudenay, S. (eds.) CANS 2020. LNCS, vol. 12579, pp. 505\u2013525. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-65411-5_25"},{"key":"5_CR43","unstructured":"Mohassel, P., Rindal, P.: ABY3: a mixed protocol framework for machine learning. In: CCS (2018)"},{"key":"5_CR44","doi-asserted-by":"crossref","unstructured":"Mood, B., Gupta, D., Carter, H., Butler, K.R.B., Traynor, P.: Frigate: a validated, extensible, and efficient compiler and interpreter for secure computation. In: Euro S&P (2016)","DOI":"10.1109\/EuroSP.2016.20"},{"key":"5_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/978-3-642-32946-3_19","volume-title":"Financial Cryptography and Data Security","author":"B Mood","year":"2012","unstructured":"Mood, B., Letaw, L., Butler, K.: Memory-efficient garbled circuit generation for mobile devices. In: Keromytis, A.D. (ed.) FC 2012. LNCS, vol. 7397, pp. 254\u2013268. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32946-3_19"},{"key":"5_CR46","unstructured":"Nguyen, T.D., et al.: FLGUARD: secure and private federated learning. ePrint (2021). https:\/\/ia.cr\/2021\/025"},{"key":"5_CR47","doi-asserted-by":"crossref","unstructured":"Nielsen, J.D., Schwartzbach, M.I.: A domain-specific programming language for secure multiparty computation. In: Workshop on Programming Languages and Analysis for Security (2007)","DOI":"10.1145\/1255329.1255333"},{"key":"5_CR48","unstructured":"Patra, A., Schneider, T., Suresh, A., Yalame, H.: ABY2.0: improved mixed-protocol secure two-party computation. In: USENIX Security (2020)"},{"key":"5_CR49","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"739","DOI":"10.1007\/978-3-030-45724-2_25","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"B Pinkas","year":"2020","unstructured":"Pinkas, B., Rosulek, M., Trieu, N., Yanai, A.: PSI from PaXoS: fast, malicious private set intersection. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. LNCS, vol. 12106, pp. 739\u2013767. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45724-2_25"},{"key":"5_CR50","doi-asserted-by":"crossref","unstructured":"Rastogi, A., Hammer, M.A., Hicks, M.: Wysteria: a programming language for generic, mixed-mode multiparty computations. In: S&P (2014)","DOI":"10.1109\/SP.2014.48"},{"key":"5_CR51","doi-asserted-by":"crossref","unstructured":"Robertson, J.E.: A new class of digital division methods. Trans. Electron. Comput. (1958)","DOI":"10.1109\/TEC.1958.5222579"},{"key":"5_CR52","unstructured":"Rotaru, D.: awesome-mpc (2020). https:\/\/github.com\/rdragos\/awesome-mpc#frameworks"},{"key":"5_CR53","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/3-540-45574-4_3","volume-title":"Languages and Compilers for Parallel Computing","author":"R Rugina","year":"2001","unstructured":"Rugina, R., Rinard, M.: Recursion unrolling for divide and conquer programs. In: Midkiff, S.P., et al. (eds.) LCPC 2000. LNCS, vol. 2017, pp. 34\u201348. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45574-4_3"},{"key":"5_CR54","unstructured":"Schoenmakers, B.: MPyC: secure multiparty computation in Python (2018). https:\/\/github.com\/lschoe\/mpyc\/blob\/master\/README.md"},{"key":"5_CR55","doi-asserted-by":"crossref","unstructured":"Schropfer, A., Kerschbaum, F., Muller, G.: L1 - an intermediate language for mixed-protocol secure computation. In: Computer Software and Applications Conference (2011)","DOI":"10.1109\/COMPSAC.2011.46"},{"key":"5_CR56","doi-asserted-by":"crossref","unstructured":"Songhori, E.M., Hussain, S.U., Sadeghi, A., Schneider, T., Koushanfar, F.: TinyGarble: highly compressed and scalable sequential garbled circuits. In: S&P (2015)","DOI":"10.1109\/SP.2015.32"},{"key":"5_CR57","unstructured":"Synopsis: DC Ultra (2020). https:\/\/www.synopsys.com\/implementation-and-signoff\/rtl-synthesis-test\/dc-ultra.html"},{"key":"5_CR58","doi-asserted-by":"crossref","unstructured":"Tatsuoka, M., et al.: Physically aware high level synthesis design flow. In: DAC (2015)","DOI":"10.1145\/2744769.2744893"},{"key":"5_CR59","unstructured":"Tillich, S., Smart, N.: (Bristol Format) Circuits of basic functions suitable for MPC and FHE (2020). https:\/\/homes.esat.kuleuven.be\/~nsmart\/MPC\/old-circuits.html"},{"key":"5_CR60","unstructured":"Verilog.com: Verilog Resources (2020). https:\/\/verilog.com\/"},{"key":"5_CR61","unstructured":"Wang, X., Malozemoff, A.J., Katz, J.: EMP-toolkit: Efficient multiparty computation toolkit (2016). https:\/\/github.com\/emp-toolkit"},{"key":"5_CR62","unstructured":"Wolf, C.: Yosys open synthesis suite. http:\/\/www.clifford.at\/yosys\/"},{"key":"5_CR63","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: How to generate and exchange secrets (extended abstract). In: FOCS (1986)","DOI":"10.1109\/SFCS.1986.25"},{"key":"5_CR64","unstructured":"Zahur, S., Evans, D.: Obliv-C: a language for extensible data-oblivious computation. ePrint (2015). https:\/\/ia.cr\/2015\/1153"},{"key":"5_CR65","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":"5_CR66","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Steele, A., Blanton, M.: PICCO: A general-purpose compiler for private distributed computation. In: CCS (2013)","DOI":"10.1145\/2508859.2516752"}],"container-title":["Lecture Notes in Computer Science","Applied Cryptography and Network Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-78375-4_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T00:08:14Z","timestamp":1780963694000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-78375-4_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030783747","9783030783754"],"references-count":66,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-78375-4_5","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":"10 June 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ACNS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Applied Cryptography and Network Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kamakura","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","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":"21 June 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 June 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"acns2021","order":10,"name":"conference_id","label":"Conference ID","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":"186","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":"37","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":"2.89","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":"7.81","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":"Due to the COVID-19 pandemic the conference took place virtually.","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"}]}}