{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,28]],"date-time":"2026-05-28T02:28:46Z","timestamp":1779935326840,"version":"3.53.1"},"publisher-location":"Cham","reference-count":41,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030215675","type":"print"},{"value":"9783030215682","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-21568-2_26","type":"book-chapter","created":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T22:13:31Z","timestamp":1559081611000},"page":"530-549","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":46,"title":["Turbospeedz: Double Your Online SPDZ! Improving SPDZ Using Function Dependent Preprocessing"],"prefix":"10.1007","author":[{"given":"Aner","family":"Ben-Efraim","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michael","family":"Nielsen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Eran","family":"Omri","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2019,5,29]]},"reference":[{"key":"26_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/978-3-642-40084-1_10","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"B Applebaum","year":"2013","unstructured":"Applebaum, B., Ishai, Y., Kushilevitz, E., Waters, B.: Encoding functions with constant online rate or how to compress garbled circuits keys. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013. LNCS, vol. 8043, pp. 166\u2013184. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40084-1_10"},{"key":"26_CR2","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 CCS, pp. 805\u2013817 (2016)","DOI":"10.1145\/2976749.2978331"},{"key":"26_CR3","doi-asserted-by":"crossref","unstructured":"Araki, T., et al.: Optimized honest-majority MPC for malicious adversaries - breaking the 1 billion-gate per second barrier. In: IEEE SP, pp. 843\u2013862 (2017)","DOI":"10.1109\/SP.2017.15"},{"key":"26_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/978-3-642-29011-4_29","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"G Asharov","year":"2012","unstructured":"Asharov, G., Jain, A., L\u00f3pez-Alt, A., Tromer, E., Vaikuntanathan, V., Wichs, D.: Multiparty computation with low communication, computation and interaction via threshold FHE. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 483\u2013501. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_29"},{"key":"26_CR5","doi-asserted-by":"crossref","unstructured":"Ball, M., Malkin, T., Rosulek, M.: Garbling gadgets for boolean and arithmetic circuits. In: ACM CCS, pp. 565\u2013577 (2016)","DOI":"10.1145\/2976749.2978410"},{"key":"26_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/978-3-319-10879-7_11","volume-title":"Security and Cryptography for Networks","author":"C Baum","year":"2014","unstructured":"Baum, C., Damg\u00e5rd, I., Orlandi, C.: Publicly auditable secure multi-party computation. In: Abdalla, M., De Prisco, R. (eds.) SCN 2014. LNCS, vol. 8642, pp. 175\u2013196. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-10879-7_11"},{"key":"26_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/978-3-319-39555-5_18","volume-title":"Applied Cryptography and Network Security","author":"C Baum","year":"2016","unstructured":"Baum, C., Damg\u00e5rd, I., Toft, T., Zakarias, R.: Better preprocessing for secure multiparty computation. In: Manulis, M., Sadeghi, A.-R., Schneider, S. (eds.) ACNS 2016. LNCS, vol. 9696, pp. 327\u2013345. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-39555-5_18"},{"key":"26_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1007\/3-540-46766-1_34","volume-title":"Advances in Cryptology\u2014CRYPTO 1991","author":"D Beaver","year":"1992","unstructured":"Beaver, D.: Efficient multiparty protocols using circuit randomization. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 420\u2013432. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-46766-1_34"},{"key":"26_CR9","doi-asserted-by":"crossref","unstructured":"Beaver, D., Micali, S., Rogaway, P.: The round complexity of secure protocols. In: STOC, pp. 503\u2013513 (1990)","DOI":"10.1145\/100216.100287"},{"key":"26_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-03332-3_1","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2018","author":"A Ben-Efraim","year":"2018","unstructured":"Ben-Efraim, A.: On multiparty garbling of arithmetic circuits. In: Peyrin, T., Galbraith, S. (eds.) ASIACRYPT 2018. LNCS, vol. 11274, pp. 3\u201333. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03332-3_1"},{"key":"26_CR11","doi-asserted-by":"crossref","unstructured":"Ben-Efraim, A., Lindell, Y., Omri, E.: Optimizing semi-honest secure multiparty computation for the internet. In: ACM CCS, pp. 578\u2013590 (2016)","DOI":"10.1145\/2976749.2978347"},{"key":"26_CR12","doi-asserted-by":"crossref","unstructured":"Ben-Efraim, A., Nielsen, M., Omri, E.: Turbospeedz: double your online SPDZ! Improving SPDZ using function dependent preprocessing. On ePrint: Report 2019\/080","DOI":"10.1007\/978-3-030-21568-2_26"},{"key":"26_CR13","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computations. In: STOC, pp. 1\u201310 (1988)","DOI":"10.1145\/62212.62213"},{"key":"26_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/978-3-642-20465-4_11","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2011","author":"R Bendlin","year":"2011","unstructured":"Bendlin, R., Damg\u00e5rd, I., Orlandi, C., Zakarias, S.: Semi-homomorphic encryption and multiparty computation. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol. 6632, pp. 169\u2013188. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20465-4_11"},{"key":"26_CR15","doi-asserted-by":"crossref","unstructured":"Chaum, D., Cr\u00e9peau, C., Damg\u00e5rd, I.: Multiparty unconditionally secure protocols. In: STOC, pp. 11\u201319 (1988)","DOI":"10.1145\/62212.62214"},{"key":"26_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1007\/978-3-642-27954-6_26","volume-title":"Topics in Cryptology \u2013 CT-RSA 2012","author":"SG Choi","year":"2012","unstructured":"Choi, S.G., Hwang, K.-W., Katz, J., Malkin, T., Rubenstein, D.: Secure multi-party computation of boolean circuits with applications to privacy in on-line marketplaces. In: Dunkelman, O. (ed.) CT-RSA 2012. LNCS, vol. 7178, pp. 416\u2013432. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-27954-6_26"},{"key":"26_CR17","doi-asserted-by":"crossref","unstructured":"Couteau, G.: A note on the communication complexity of multiparty computation in the correlated randomness model. In: EUROCRYPT (2019, to appear)","DOI":"10.1007\/978-3-030-17656-3_17"},{"key":"26_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1007\/978-3-319-96881-0_26","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"R Cramer","year":"2018","unstructured":"Cramer, R., Damg\u00e5rd, I., Escudero, D., Scholl, P., Xing, C.: SPD$$\\mathbb{Z}_{2^k}$$: efficient MPC mod $$2^k$$ for dishonest majority. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. LNCS, vol. 10992, pp. 769\u2013798. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96881-0_26"},{"key":"26_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1007\/11535218_23","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"I Damg\u00e5rd","year":"2005","unstructured":"Damg\u00e5rd, I., Ishai, Y.: Constant-round multiparty computation using a black-box pseudorandom generator. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 378\u2013394. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11535218_23"},{"key":"26_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/11818175_30","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"I Damg\u00e5rd","year":"2006","unstructured":"Damg\u00e5rd, I., Ishai, Y.: Scalable secure multiparty computation. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 501\u2013520. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11818175_30"},{"key":"26_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1007\/978-3-540-74143-5_32","volume-title":"Advances in Cryptology - CRYPTO 2007","author":"I Damg\u00e5rd","year":"2007","unstructured":"Damg\u00e5rd, I., Nielsen, J.B.: Scalable and unconditionally secure multiparty computation. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol. 4622, pp. 572\u2013590. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74143-5_32"},{"key":"26_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/978-3-642-13190-5_23","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"I Damg\u00e5rd","year":"2010","unstructured":"Damg\u00e5rd, I., Ishai, Y., Kr\u00f8igaard, M.: Perfectly secure multiparty computation and the computational overhead of cryptography. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 445\u2013465. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13190-5_23"},{"key":"26_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1007\/978-3-642-32009-5_38","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"I Damg\u00e5rd","year":"2012","unstructured":"Damg\u00e5rd, I., Pastro, V., Smart, N., Zakarias, S.: Multiparty computation from somewhat homomorphic encryption. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 643\u2013662. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_38"},{"key":"26_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-40203-6_1","volume-title":"Computer Security \u2013 ESORICS 2013","author":"I Damg\u00e5rd","year":"2013","unstructured":"Damg\u00e5rd, I., Keller, M., Larraia, E., Pastro, V., Scholl, P., Smart, N.P.: Practical covertly secure MPC for dishonest majority \u2013 or: breaking the SPDZ limits. In: Crampton, J., Jajodia, S., Mayes, K. (eds.) ESORICS 2013. LNCS, vol. 8134, pp. 1\u201318. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40203-6_1"},{"key":"26_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/978-3-319-63688-7_6","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"I Damg\u00e5rd","year":"2017","unstructured":"Damg\u00e5rd, I., Nielsen, J.B., Nielsen, M., Ranellucci, S.: The TinyTable protocol for 2-party secure computation, or: gate-scrambling revisited. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017. LNCS, vol. 10401, pp. 167\u2013187. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63688-7_6"},{"key":"26_CR26","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game. In: STOC, pp. 218\u2013229 (1987)","DOI":"10.1145\/28395.28420"},{"key":"26_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/978-3-030-03332-3_3","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2018","author":"SD Gordon","year":"2018","unstructured":"Gordon, S.D., Ranellucci, S., Wang, X.: Secure computation with low communication from cross-checking. In: Peyrin, T., Galbraith, S. (eds.) ASIACRYPT 2018. LNCS, vol. 11274, pp. 59\u201385. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03332-3_3"},{"key":"26_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"598","DOI":"10.1007\/978-3-319-70694-8_21","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2017","author":"C Hazay","year":"2017","unstructured":"Hazay, C., Scholl, P., Soria-Vazquez, E.: Low cost constant round MPC combining BMR and oblivious transfer. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT 2017. LNCS, vol. 10624, pp. 598\u2013628. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70694-8_21"},{"key":"26_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/11818175_28","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"M Hirt","year":"2006","unstructured":"Hirt, M., Nielsen, J.B.: Robust multiparty computation with linear communication complexity. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 463\u2013482. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11818175_28"},{"key":"26_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/3-540-44448-3_12","volume-title":"Advances in Cryptology\u2014ASIACRYPT 2000","author":"M Hirt","year":"2000","unstructured":"Hirt, M., Maurer, U., Przydatek, B.: Efficient secure multi-party computation. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol. 1976, pp. 143\u2013161. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44448-3_12"},{"key":"26_CR31","doi-asserted-by":"crossref","unstructured":"Keller, M., Orsini, E., Scholl, P.: MASCOT: faster malicious arithmetic secure computation with oblivious transfer. In: ACM CCS, pp. 830\u2013842 (2016)","DOI":"10.1145\/2976749.2978357"},{"key":"26_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/978-3-319-61204-1_12","volume-title":"Applied Cryptography and Network Security","author":"M Keller","year":"2017","unstructured":"Keller, M., Orsini, E., Rotaru, D., Scholl, P., Soria-Vazquez, E., Vivek, S.: Faster secure multi-party computation of AES and DES using lookup tables. In: Gollmann, D., Miyaji, A., Kikuchi, H. (eds.) ACNS 2017. LNCS, vol. 10355, pp. 229\u2013249. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-61204-1_12"},{"key":"26_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/978-3-319-78372-7_6","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"M Keller","year":"2018","unstructured":"Keller, M., Pastro, V., Rotaru, D.: Overdrive: making SPDZ great again. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10822, pp. 158\u2013189. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78372-7_6"},{"key":"26_CR34","doi-asserted-by":"crossref","unstructured":"Kilian, J.: Basing cryptography on oblivious transfer. In: STOC, pp. 20\u201331 (1988)","DOI":"10.1145\/62212.62215"},{"key":"26_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1007\/978-3-662-44381-1_28","volume-title":"Advances in Cryptology \u2013 CRYPTO 2014","author":"E Larraia","year":"2014","unstructured":"Larraia, E., Orsini, E., Smart, N.P.: Dishonest majority multi-party computation for binary circuits. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014. LNCS, vol. 8617, pp. 495\u2013512. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44381-1_28"},{"key":"26_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/978-3-662-48000-7_16","volume-title":"Advances in Cryptology \u2013 CRYPTO 2015","author":"Y Lindell","year":"2015","unstructured":"Lindell, Y., Pinkas, B., Smart, N.P., Yanai, A.: Efficient constant round multi-party computation combining BMR and SPDZ. In: Gennaro, R., Robshaw, M. (eds.) CRYPTO 2015. LNCS, vol. 9216, pp. 319\u2013338. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48000-7_16"},{"key":"26_CR37","unstructured":"Malkin, T., Pastero, V., Shelat, A.: An algebraic approach to garbling (Unpublished manuscript)"},{"key":"26_CR38","doi-asserted-by":"crossref","unstructured":"Rabin, T., Ben-Or, M.: Verifiable secret sharing and multiparty protocols with honest majority. In: STOC, pp. 73\u201385 (1989)","DOI":"10.1145\/73007.73014"},{"key":"26_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/978-3-319-49175-2_8","volume-title":"Information Theoretic Security","author":"G Spini","year":"2016","unstructured":"Spini, G., Fehr, S.: Cheater detection in SPDZ multiparty computation. In: Nascimento, A.C.A., Barreto, P. (eds.) ICITS 2016. LNCS, vol. 10015, pp. 151\u2013176. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-49175-2_8"},{"key":"26_CR40","doi-asserted-by":"crossref","unstructured":"Wang, X., Ranellucci, S., Katz, J.: Global-scale secure multiparty computation. In: ACM CCS, pp. 39\u201356 (2017)","DOI":"10.1145\/3133956.3133979"},{"key":"26_CR41","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: Protocols for secure computations. In: FOCS, pp. 160\u2013164 (1982)","DOI":"10.1109\/SFCS.1982.38"}],"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-21568-2_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,29]],"date-time":"2024-05-29T00:06:09Z","timestamp":1716941169000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-21568-2_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030215675","9783030215682"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-21568-2_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"29 May 2019","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":"Bogota","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Colombia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 June 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 June 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"acns2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.acns19.com\/","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":"111","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":"29","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":"26% - 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":"6","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":"From the ACNS 2019 associated workshops, 10 out of 30 submitted papers were accepted for publication","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"}]}}