{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T04:58:38Z","timestamp":1743051518378,"version":"3.40.3"},"publisher-location":"Cham","reference-count":58,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030652760"},{"type":"electronic","value":"9783030652777"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-65277-7_37","type":"book-chapter","created":{"date-parts":[[2020,12,7]],"date-time":"2020-12-07T12:17:34Z","timestamp":1607343454000},"page":"832-855","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["High Throughput Secure MPC over Small Population in Hybrid Networks (Extended Abstract)"],"prefix":"10.1007","author":[{"given":"Ashish","family":"Choudhury","sequence":"first","affiliation":[]},{"given":"Aditya","family":"Hegde","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,12,8]]},"reference":[{"key":"37_CR1","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: Symposium on Security and Privacy, pp. 843\u2013862. IEEE Computer Society (2017)","DOI":"10.1109\/SP.2017.15"},{"key":"37_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: CCS, pp. 805\u2013817. ACM (2016)","DOI":"10.1145\/2976749.2978331"},{"key":"37_CR3","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 \u2014 CRYPTO \u20191991","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":"37_CR4","doi-asserted-by":"crossref","unstructured":"Beaver, D., Micali, S., Rogaway, P.: The round complexity of secure protocols (extended abstract). In: STOC, pp. 503\u2013513. ACM (1990)","DOI":"10.1145\/100216.100287"},{"key":"37_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1007\/978-3-540-76900-2_23","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2007","author":"Z Beerliov\u00e1-Trub\u00edniov\u00e1","year":"2007","unstructured":"Beerliov\u00e1-Trub\u00edniov\u00e1, Z., Hirt, M.: Simple and efficient perfectly-secure asynchronous MPC. In: Kurosawa, K. (ed.) ASIACRYPT 2007. LNCS, vol. 4833, pp. 376\u2013392. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-76900-2_23"},{"key":"37_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/978-3-540-78524-8_13","volume-title":"Theory of Cryptography","author":"Z Beerliov\u00e1-Trub\u00edniov\u00e1","year":"2008","unstructured":"Beerliov\u00e1-Trub\u00edniov\u00e1, Z., Hirt, M.: Perfectly-secure MPC with linear communication complexity. In: Canetti, R. (ed.) TCC 2008. LNCS, vol. 4948, pp. 213\u2013230. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78524-8_13"},{"key":"37_CR7","doi-asserted-by":"crossref","unstructured":"Beerliov\u00e1-Trub\u00edniov\u00e1, Z., Hirt, M., Nielsen, J.B.: On the theoretical gap between synchronous and asynchronous MPC protocols. In: PODC, pp. 211\u2013218. ACM (2010)","DOI":"10.1145\/1835698.1835746"},{"key":"37_CR8","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Canetti, R., Goldreich, O.: Asynchronous secure computation. In: STOC, pp. 52\u201361. ACM (1993)","DOI":"10.1145\/167088.167109"},{"key":"37_CR9","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation (extended abstract). In: STOC, pp. 1\u201310. ACM (1988)","DOI":"10.1145\/62212.62213"},{"key":"37_CR10","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Kelmer, B., Rabin, T.: Asynchronous secure computations with optimal resilience (extended abstract). In: PODC, pp. 183\u2013192. ACM (1994)","DOI":"10.1145\/197917.198088"},{"key":"37_CR11","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":"37_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/978-3-642-32946-3_5","volume-title":"Financial Cryptography and Data Security","author":"D Bogdanov","year":"2012","unstructured":"Bogdanov, D., Talviste, R., Willemson, J.: Deploying secure multi-party computation for financial data analysis. In: Keromytis, A.D. (ed.) FC 2012. LNCS, vol. 7397, pp. 57\u201364. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32946-3_5"},{"key":"37_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/978-3-642-03549-4_20","volume-title":"Financial Cryptography and Data Security","author":"P Bogetoft","year":"2009","unstructured":"Bogetoft, P., et al.: Secure multiparty computation goes live. In: Dingledine, R., Golle, P. (eds.) FC 2009. LNCS, vol. 5628, pp. 325\u2013343. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03549-4_20"},{"key":"37_CR14","doi-asserted-by":"crossref","unstructured":"Boyle, E., Gilboa, N., Ishai, Y., Nof, A.: Practical fully secure three-party computation via sublinear distributed zero-knowledge proofs. In: CCS, pp. 869\u2013886. ACM (2019)","DOI":"10.1145\/3319535.3363227"},{"key":"37_CR15","doi-asserted-by":"crossref","unstructured":"Bracha, G.: An ssynchronous [(n-1)\/3]-resilient consensus protocol. In: PODC, pp. 154\u2013162. ACM (1984)","DOI":"10.1145\/800222.806743"},{"key":"37_CR16","first-page":"1365","volume":"2019","author":"M Byali","year":"2019","unstructured":"Byali, M., Chaudhari, H., Patra, A., Suresh, A.: FLASH: fast and robust framework for privacy-preserving machine learning. IACR Cryptol. ePrint Archive 2019, 1365 (2019)","journal-title":"IACR Cryptol. ePrint Archive"},{"key":"37_CR17","doi-asserted-by":"crossref","unstructured":"Byali, M., Hazay, C., Patra, A., Singla, S.: Fast actively secure five-party computation with security beyond abort. In: CCS, pp. 1573\u20131590. ACM (2019)","DOI":"10.1145\/3319535.3345657"},{"key":"37_CR18","doi-asserted-by":"crossref","unstructured":"Byali, M., Joseph, A., Patra, A., Ravi, D.: Fast secure computation for small population over the internet. In: CCS, pp. 677\u2013694. ACM (2018)","DOI":"10.1145\/3243734.3243784"},{"key":"37_CR19","doi-asserted-by":"crossref","unstructured":"Cachin, C., Tessaro, S.: Asynchronous verifiable information dispersal. In: SRDS, pp. 191\u2013202. IEEE Computer Society (2005)","DOI":"10.1007\/11561927_42"},{"key":"37_CR20","unstructured":"Canetti, R.: Studies in Secure Multiparty Computation and Applications. PhD thesis, Weizmann Institute, Israel (1995)"},{"issue":"1","key":"37_CR21","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s001459910006","volume":"13","author":"R Canetti","year":"2000","unstructured":"Canetti, R.: Security and composition of multiparty cryptographic protocols. J. Cryptol. 13(1), 143\u2013202 (2000)","journal-title":"J. Cryptol."},{"key":"37_CR22","doi-asserted-by":"crossref","unstructured":"Chandran, N., Garay, J.A., Mohassel, P., Vusirikala, S.: Efficient, constant-round and actively secure MPC: beyond the three-party case. In: CCS, pp. 277\u2013294. ACM (2017)","DOI":"10.1145\/3133956.3134100"},{"key":"37_CR23","doi-asserted-by":"crossref","unstructured":"Chandran, N., Gupta, D., Rastogi, A., Sharma, R., Tripathi, S.: EzPC: programmable and efficient secure two-party computation for machine learning. In: European Symposium on Security and Privacy, pp. 496\u2013511. IEEE (2019)","DOI":"10.1109\/EuroSP.2019.00043"},{"key":"37_CR24","doi-asserted-by":"crossref","unstructured":"Chaudhari, H., Choudhury, A., Patra, A., Suresh, A.: ASTRA: high throughput 3PC over rings with application to secure prediction. In: CCSW@CCS, pp. 81\u201392. ACM (2019)","DOI":"10.1145\/3338466.3358922"},{"key":"37_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/978-3-319-96878-0_2","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"K Chida","year":"2018","unstructured":"Chida, K., et al.: Fast large-scale honest-majority MPC for malicious adversaries. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. LNCS, vol. 10993, pp. 34\u201364. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96878-0_2"},{"key":"37_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/978-3-642-42045-0_12","volume-title":"Advances in Cryptology - ASIACRYPT 2013","author":"A Choudhury","year":"2013","unstructured":"Choudhury, A., Loftus, J., Orsini, E., Patra, A., Smart, N.P.: Between a rock and a hard place: interpolating between MPC and FHE. In: Sako, K., Sarkar, P. (eds.) ASIACRYPT 2013. LNCS, vol. 8270, pp. 221\u2013240. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-42045-0_12"},{"key":"37_CR27","doi-asserted-by":"crossref","unstructured":"Choudhury, A., Patra, A.: Optimally resilient asynchronous MPC with linear communication complexity. In: ICDCN, pp. 5:1\u20135:10. ACM (2015)","DOI":"10.1145\/2684464.2684470"},{"issue":"1","key":"37_CR28","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1109\/TIT.2016.2614685","volume":"63","author":"A Choudhury","year":"2017","unstructured":"Choudhury, A., Patra, A.: An efficient framework for unconditionally secure multiparty computation. IEEE Trans. Inf. Theory 63(1), 428\u2013468 (2017)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"37_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/978-3-662-49387-8_8","volume-title":"Public-Key Cryptography \u2013 PKC 2016","author":"R Cohen","year":"2016","unstructured":"Cohen, R.: Asynchronous secure multiparty computation in constant time. In: Cheng, C.-M., Chung, K.-M., Persiano, G., Yang, B.-Y. (eds.) PKC 2016. LNCS, vol. 9615, pp. 183\u2013207. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49387-8_8"},{"key":"37_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1007\/978-3-662-45608-8_25","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2014","author":"R Cohen","year":"2014","unstructured":"Cohen, R., Lindell, Y.: Fairness versus guaranteed output delivery in secure multiparty computation. In: Sarkar, P., Iwata, T. (eds.) ASIACRYPT 2014. LNCS, vol. 8874, pp. 466\u2013485. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-45608-8_25"},{"key":"37_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"998","DOI":"10.1007\/978-3-662-53890-6_33","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2016","author":"S Coretti","year":"2016","unstructured":"Coretti, S., Garay, J., Hirt, M., Zikas, V.: Constant-round asynchronous multi-party computation based on one-way functions. In: Cheon, J.H., Takagi, T. (eds.) ASIACRYPT 2016. LNCS, vol. 10032, pp. 998\u20131021. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53890-6_33"},{"key":"37_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/978-3-642-00468-1_10","volume-title":"Public Key Cryptography \u2013 PKC 2009","author":"I Damg\u00e5rd","year":"2009","unstructured":"Damg\u00e5rd, I., Geisler, M., Kr\u00f8igaard, M., Nielsen, J.B.: Asynchronous multiparty computation: theory and implementation. In: Jarecki, S., Tsudik, G. (eds.) PKC 2009. LNCS, vol. 5443, pp. 160\u2013179. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00468-1_10"},{"key":"37_CR33","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":"37_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/978-3-319-56614-6_8","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2017","author":"J Furukawa","year":"2017","unstructured":"Furukawa, J., Lindell, Y., Nof, A., Weinstein, O.: High-throughput secure three-party computation for malicious adversaries and an honest majority. In: Coron, J.-S., Nielsen, J.B. (eds.) EUROCRYPT 2017. LNCS, vol. 10211, pp. 225\u2013255. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-56614-6_8"},{"key":"37_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1007\/978-3-642-13190-5_26","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"C Gentry","year":"2010","unstructured":"Gentry, C., Halevi, S., Vaikuntanathan, V.: A simple BGN-type cryptosystem from LWE. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 506\u2013522. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13190-5_26"},{"key":"37_CR36","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, pp. 218\u2013229. ACM (1987)","DOI":"10.1145\/28395.28420"},{"key":"37_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/3-540-44647-8_6","volume-title":"Advances in Cryptology \u2014 CRYPTO 2001","author":"M Hirt","year":"2001","unstructured":"Hirt, M., Maurer, U.: Robustness for free in unconditional multi-party computation. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 101\u2013118. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44647-8_6"},{"key":"37_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1007\/11426639_19","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"M Hirt","year":"2005","unstructured":"Hirt, M., Nielsen, J.B., Przydatek, B.: Cryptographic asynchronous multi-party computation with optimal resilience. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 322\u2013340. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11426639_19"},{"key":"37_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/978-3-540-70583-3_39","volume-title":"Automata, Languages and Programming","author":"M Hirt","year":"2008","unstructured":"Hirt, M., Nielsen, J.B., Przydatek, B.: Asynchronous multi-party computation with quadratic communication. 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. 473\u2013485. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-70583-3_39"},{"key":"37_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/978-3-662-48000-7_18","volume-title":"Advances in Cryptology \u2013 CRYPTO 2015","author":"Y Ishai","year":"2015","unstructured":"Ishai, Y., Kumaresan, R., Kushilevitz, E., Paskin-Cherniavsky, A.: Secure computation with minimal interaction, revisited. In: Gennaro, R., Robshaw, M. (eds.) CRYPTO 2015. LNCS, vol. 9216, pp. 359\u2013378. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48000-7_18"},{"key":"37_CR41","doi-asserted-by":"crossref","unstructured":"Katz, J., Kolesnikov, V., Wang, X.: Improved non-interactive zero knowledge with applications to post-quantum signatures. In: CCS, pp. 525\u2013537. ACM (2018)","DOI":"10.1145\/3243734.3243805"},{"key":"37_CR42","doi-asserted-by":"publisher","DOI":"10.1201\/b17668","volume-title":"Introduction to Modern Cryptography","author":"J Katz","year":"2014","unstructured":"Katz, J., Lindell, Y.: Introduction to Modern Cryptography, 2nd edn. CRC Press, United States (2014)","edition":"2"},{"key":"37_CR43","unstructured":"LeCun, Y., Cortes, C., Burges, C.J.: Mnist handwritten digit database. ATT Labs. http:\/\/yann.lecun.com\/exdb\/mnist, February 2010"},{"key":"37_CR44","unstructured":"Lindell, Y.: Secure Multiparty Computation (MPC). Cryptology ePrint Archive, Report 2020\/300 (2020)"},{"key":"37_CR45","doi-asserted-by":"crossref","unstructured":"Lu, D., Yurek, T., Kulshreshtha, S., Govind, R., Kate, A., Miller, A.K.: HoneyBadgerMPC and AsynchroMix: practical asynchronous MPC and its application to anonymous communication. In: CCS, pp. 887\u2013903. ACM (2019)","DOI":"10.1145\/3319535.3354238"},{"key":"37_CR46","doi-asserted-by":"crossref","unstructured":"Miller, A., Xia, Y., Croman, K., Shi, E., Song, D.: The honey badger of BFT protocols. In: CCS, pp. 31\u201342. ACM (2016)","DOI":"10.1145\/2976749.2978399"},{"key":"37_CR47","unstructured":"Mohassel, P., Rindal, P.: ABY$${}^{\\text{3}}$$: a mixed protocol framework for machine learning. In: CCS, pp. 35\u201352. ACM (2018)"},{"key":"37_CR48","doi-asserted-by":"crossref","unstructured":"Mohassel, P., Rosulek, M., Zhang, Y.: Fast and secure three-party computation: the garbled circuit approach. In: CCS, pp. 591\u2013602. ACM (2015)","DOI":"10.1145\/2810103.2813705"},{"key":"37_CR49","doi-asserted-by":"crossref","unstructured":"Mohassel, P., Zhang, Y.: SecureML: a system for scalable privacy-preserving machine learning. In: Symposium on Security and Privacy, pp. 19\u201338. IEEE Computer Society (2017)","DOI":"10.1109\/SP.2017.12"},{"issue":"1","key":"37_CR50","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/s00145-013-9172-7","volume":"28","author":"A Patra","year":"2015","unstructured":"Patra, A., Choudhury, A., Pandu Rangan, C.: Efficient asynchronous verifiable secret sharing and multiparty computation. J. Cryptol. 28(1), 49\u2013109 (2015)","journal-title":"J. Cryptol."},{"issue":"6","key":"37_CR51","doi-asserted-by":"publisher","first-page":"4207","DOI":"10.1109\/TIT.2018.2827360","volume":"64","author":"A Patra","year":"2018","unstructured":"Patra, A., Ravi, D.: On the power of hybrid networks in multi-party computation. IEEE Trans. Inf. Theory 64(6), 4207\u20134227 (2018)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"37_CR52","first-page":"42","volume":"2020","author":"A Patra","year":"2020","unstructured":"Patra, A., Suresh, A.: BLAZE: blazing fast privacy-preserving machine learning. IACR Cryptol. ePrint Archive 2020, 42 (2020)","journal-title":"IACR Cryptol. ePrint Archive"},{"key":"37_CR53","doi-asserted-by":"crossref","unstructured":"Rabin, T., Ben-Or, M.: Verifiable secret sharing and multiparty protocols with honest majority (extended abstract). In: STOC, pp. 73\u201385. ACM (1989)","DOI":"10.1145\/73007.73014"},{"key":"37_CR54","first-page":"1315","volume":"2019","author":"R Rachuri","year":"2019","unstructured":"Rachuri, R., Suresh, A.: Trident: efficient 4PC framework for privacy preserving machine learning. IACR Cryptol. ePrint Archive 2019, 1315 (2019)","journal-title":"IACR Cryptol. ePrint Archive"},{"issue":"11","key":"37_CR55","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A Shamir","year":"1979","unstructured":"Shamir, A.: How to share a secret. Commun. ACM 22(11), 612\u2013613 (1979)","journal-title":"Commun. ACM"},{"key":"37_CR56","unstructured":"The Sage Developers. SageMath, the Sage Mathematics Software System (Version 8.9) (2020). https:\/\/www.sagemath.org"},{"issue":"3","key":"37_CR57","doi-asserted-by":"crossref","first-page":"26","DOI":"10.2478\/popets-2019-0035","volume":"2019","author":"S Wagh","year":"2019","unstructured":"Wagh, S., Gupta, D., Chandran, N.: SecureNN: 3-party secure computation for neural network training. PoPETs 2019(3), 26\u201349 (2019)","journal-title":"PoPETs"},{"key":"37_CR58","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: Protocols for secure computations (extended abstract). In: FOCS, pp. 160\u2013164. IEEE Computer Society (1982)","DOI":"10.1109\/SFCS.1982.38"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology \u2013 INDOCRYPT 2020"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-65277-7_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,3]],"date-time":"2022-12-03T00:28:59Z","timestamp":1670027339000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-65277-7_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030652760","9783030652777"],"references-count":58,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-65277-7_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"8 December 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"INDOCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Cryptology in India","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bangalore","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","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":"13 December 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 December 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"indocrypt2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/indocrypt2020.iiitb.ac.in\/","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":"84","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":"39","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":"3","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":"46% - 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.0","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.3","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)"}}]}}