{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,27]],"date-time":"2026-01-27T08:45:59Z","timestamp":1769503559313,"version":"3.49.0"},"publisher-location":"Cham","reference-count":53,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031306167","type":"print"},{"value":"9783031306174","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-30617-4_7","type":"book-chapter","created":{"date-parts":[[2023,4,14]],"date-time":"2023-04-14T10:02:24Z","timestamp":1681466544000},"page":"190-219","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Actively Secure Arithmetic Computation and\u00a0VOLE with\u00a0Constant Computational Overhead"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4792-369X","authenticated-orcid":false,"given":"Benny","family":"Applebaum","sequence":"first","affiliation":[]},{"given":"Niv","family":"Konstantini","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,4,15]]},"reference":[{"key":"7_CR1","doi-asserted-by":"publisher","unstructured":"Aiello, W., Ishai, Y., Reingold, O.: Priced oblivious transfer: how to sell digital goods. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol. 2045, pp. 119\u2013135. Springer, Heidelberg (May 2001). https:\/\/doi.org\/10.1007\/3-540-44987-6_8","DOI":"10.1007\/3-540-44987-6_8"},{"key":"7_CR2","doi-asserted-by":"publisher","unstructured":"Alekhnovich, M.: More on average case vs approximation complexity. In: 44th FOCS, pp. 298\u2013307. IEEE Computer Society Press (October 2003). https:\/\/doi.org\/10.1109\/SFCS.2003.1238204","DOI":"10.1109\/SFCS.2003.1238204"},{"issue":"3","key":"7_CR3","doi-asserted-by":"publisher","first-page":"667","DOI":"10.1007\/s00037-015-0121-8","volume":"25","author":"B Applebaum","year":"2015","unstructured":"Applebaum, B.: Cryptographic hardness of random local functions. Comput. Complex. 25(3), 667\u2013722 (2015). https:\/\/doi.org\/10.1007\/s00037-015-0121-8","journal-title":"Comput. Complex."},{"key":"7_CR4","doi-asserted-by":"publisher","unstructured":"Applebaum, B., Avron, J., Brzuska, C.: Arithmetic cryptography. J. ACM 64(2), 10:1\u201310:74 (2017). https:\/\/doi.org\/10.1145\/3046675","DOI":"10.1145\/3046675"},{"key":"7_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/978-3-319-63688-7_8","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"B Applebaum","year":"2017","unstructured":"Applebaum, B., Damg\u00e5rd, I., Ishai, Y., Nielsen, M., Zichron, L.: Secure arithmetic computation with constant computational overhead. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017. LNCS, vol. 10401, pp. 223\u2013254. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63688-7_8"},{"issue":"4","key":"7_CR6","doi-asserted-by":"publisher","first-page":"845","DOI":"10.1137\/S0097539705446950","volume":"36","author":"B Applebaum","year":"2006","unstructured":"Applebaum, B., Ishai, Y., Kushilevitz, E.: Cryptography in nc$${}^{\\text{0 }}$$. SIAM J. Comput. 36(4), 845\u2013888 (2006). https:\/\/doi.org\/10.1137\/S0097539705446950","journal-title":"SIAM J. Comput."},{"issue":"1","key":"7_CR7","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1007\/s00037-007-0237-6","volume":"17","author":"B Applebaum","year":"2008","unstructured":"Applebaum, B., Ishai, Y., Kushilevitz, E.: On pseudorandom generators with linear stretch in nc$${}^{\\text{0 }}$$. Comput. Complex. 17(1), 38\u201369 (2008). https:\/\/doi.org\/10.1007\/s00037-007-0237-6","journal-title":"Comput. Complex."},{"issue":"2","key":"7_CR8","doi-asserted-by":"publisher","first-page":"905","DOI":"10.1137\/120875193","volume":"43","author":"B Applebaum","year":"2014","unstructured":"Applebaum, B., Ishai, Y., Kushilevitz, E.: How to garble arithmetic circuits. SIAM J. Comput. 43(2), 905\u2013929 (2014). https:\/\/doi.org\/10.1137\/120875193","journal-title":"SIAM J. Comput."},{"key":"7_CR9","doi-asserted-by":"publisher","unstructured":"Applebaum, B., Kachlon, E.: Sampling graphs without forbidden subgraphs and unbalanced expanders with negligible error. In: Zuckerman, D. (ed.) 60th FOCS. pp. 171\u2013179. IEEE Computer Society Press (November 2019). https:\/\/doi.org\/10.1109\/FOCS.2019.00020","DOI":"10.1109\/FOCS.2019.00020"},{"key":"7_CR10","unstructured":"Applebaum, B., Konstantini, N.: Actively secure arithmetic computation and vole with constant computational overhead. Cryptology ePrint Archive, Paper 2023\/270 (2023). https:\/\/eprint.iacr.org\/2023\/270, https:\/\/eprint.iacr.org\/2023\/270"},{"key":"7_CR11","doi-asserted-by":"publisher","unstructured":"Applebaum, B., Lovett, S.: Algebraic attacks against random local functions and their countermeasures. In: Wichs, D., Mansour, Y. (eds.) 48th ACM STOC. pp. 1087\u20131100. ACM Press (June 2016). https:\/\/doi.org\/10.1145\/2897518.2897554","DOI":"10.1145\/2897518.2897554"},{"key":"7_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1007\/978-3-662-46800-5_26","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2015","author":"G Asharov","year":"2015","unstructured":"Asharov, G., Lindell, Y., Schneider, T., Zohner, M.: More efficient oblivious transfer extensions with security for malicious adversaries. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9056, pp. 673\u2013701. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46800-5_26"},{"key":"7_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/978-3-030-84259-8_4","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"C Baum","year":"2021","unstructured":"Baum, C., Malozemoff, A.J., Rosen, M.B., Scholl, P.: $$\\sf Mac^{\\prime }n^{\\prime }Cheese$$: zero-knowledge proofs for\u00a0boolean and arithmetic circuits with\u00a0nested disjunctions. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12828, pp. 92\u2013122. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84259-8_4"},{"key":"7_CR14","doi-asserted-by":"publisher","unstructured":"Beaver, D.: Correlated pseudorandomness and the complexity of private computations. In: 28th ACM STOC. pp. 479\u2013488. ACM Press (May 1996). https:\/\/doi.org\/10.1145\/237814.237996","DOI":"10.1145\/237814.237996"},{"key":"7_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1007\/978-3-319-70700-6_12","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2017","author":"J Bootle","year":"2017","unstructured":"Bootle, J., Cerulli, A., Ghadafi, E., Groth, J., Hajiabadi, M., Jakobsen, S.K.: Linear-time zero-knowledge proofs for arithmetic circuit satisfiability. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT 2017. LNCS, vol. 10626, pp. 336\u2013365. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70700-6_12"},{"issue":"1","key":"7_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02920362","volume":"6","author":"JL Bordewijk","year":"1957","unstructured":"Bordewijk, J.L.: Inter-reciprocity applied to electrical networks. Appl. Sci. Res. Sect. A 6(1), 1\u201374 (1957)","journal-title":"Appl. Sci. Res. Sect. A"},{"key":"7_CR17","doi-asserted-by":"publisher","unstructured":"Boyle, E., Couteau, G., Gilboa, N., Ishai, Y.: Compressing vector OLE. In: Lie, D., Mannan, M., Backes, M., Wang, X. (eds.) ACM CCS 2018, pp. 896\u2013912. ACM Press (October 2018). https:\/\/doi.org\/10.1145\/3243734.3243868","DOI":"10.1145\/3243734.3243868"},{"key":"7_CR18","doi-asserted-by":"publisher","unstructured":"Boyle, E.,et al.: Efficient two-round OT extension and silent non-interactive secure computation. In: Cavallaro, L., Kinder, J., Wang, X., Katz, J. (eds.) ACM CCS 2019. pp. 291\u2013308. ACM Press (November 2019). https:\/\/doi.org\/10.1145\/3319535.3354255","DOI":"10.1145\/3319535.3354255"},{"key":"7_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1007\/978-3-030-26954-8_15","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"M Chase","year":"2019","unstructured":"Chase, M., et al.: Reusable non-interactive secure computation. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11694, pp. 462\u2013488. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26954-8_15"},{"key":"7_CR20","doi-asserted-by":"publisher","unstructured":"Chor, B., Goldreich, O., H\u00e5stad, J., Friedman, J., Rudich, S., Smolensky, R.: The bit extraction problem of t-resilient functions (preliminary version). In: 26th FOCS. pp. 396\u2013407. IEEE Computer Society Press (October 1985). https:\/\/doi.org\/10.1109\/SFCS.1985.55","DOI":"10.1109\/SFCS.1985.55"},{"key":"7_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1007\/3-540-48184-2_30","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201987","author":"C Cr\u00e9peau","year":"1988","unstructured":"Cr\u00e9peau, C.: Equivalence between two Flavours of oblivious transfers. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol. 293, pp. 350\u2013354. Springer, Heidelberg (1988). https:\/\/doi.org\/10.1007\/3-540-48184-2_30"},{"key":"7_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/0-387-34799-2_1","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 88","author":"C Cr\u00e9peau","year":"1990","unstructured":"Cr\u00e9peau, C., Kilian, J.: Weakening security assumptions and oblivious transfer. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol. 403, pp. 2\u20137. Springer, New York (1990). https:\/\/doi.org\/10.1007\/0-387-34799-2_1"},{"key":"7_CR23","doi-asserted-by":"publisher","unstructured":"Dittmer, S., Ishai, Y., Ostrovsky, R.: Line-point zero knowledge and its applications. In: Tessaro, S. (ed.) ITC 2021. LIPIcs, vol. 199, pp. 5:1\u20135:24. Schloss Dagstuhl (2021). https:\/\/doi.org\/10.4230\/LIPIcs.ITC.2021.5","DOI":"10.4230\/LIPIcs.ITC.2021.5"},{"key":"7_CR24","unstructured":"Druk, E.: Linear time encodable codes and cryptography. Master\u2019s thesis, Technion (2013)"},{"key":"7_CR25","doi-asserted-by":"publisher","unstructured":"Druk, E., Ishai, Y.: Linear-time encodable codes meeting the gilbert-varshamov bound and their cryptographic applications. In: Naor, M. (ed.) ITCS 2014. pp. 169\u2013182. ACM (January 2014). https:\/\/doi.org\/10.1145\/2554797.2554815","DOI":"10.1145\/2554797.2554815"},{"key":"7_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/978-3-540-30576-7_17","volume-title":"Theory of Cryptography","author":"MJ Freedman","year":"2005","unstructured":"Freedman, M.J., Ishai, Y., Pinkas, B., Reingold, O.: Keyword search and oblivious pseudorandom functions. In: Kilian, J. (ed.) TCC 2005. LNCS, vol. 3378, pp. 303\u2013324. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-30576-7_17"},{"key":"7_CR27","doi-asserted-by":"publisher","unstructured":"Genkin, D., Ishai, Y., Prabhakaran, M., Sahai, A., Tromer, E.: Circuits resilient to additive attacks with applications to secure computation. In: Shmoys, D.B. (ed.) 46th ACM STOC, pp. 495\u2013504. ACM Press (May\/June 2014). https:\/\/doi.org\/10.1145\/2591796.2591861","DOI":"10.1145\/2591796.2591861"},{"key":"7_CR28","doi-asserted-by":"publisher","unstructured":"Gertner, Y., Ishai, Y., Kushilevitz, E., Malkin, T.: Protecting data privacy in private information retrieval schemes. In: 30th ACM STOC, pp. 151\u2013160. ACM Press (May 1998). https:\/\/doi.org\/10.1145\/276698.276723","DOI":"10.1145\/276698.276723"},{"key":"7_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1007\/978-3-319-70694-8_22","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2017","author":"S Ghosh","year":"2017","unstructured":"Ghosh, S., Nielsen, J.B., Nilges, T.: Maliciously secure oblivious linear function evaluation with constant overhead. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT 2017. LNCS, vol. 10624, pp. 629\u2013659. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70694-8_22"},{"key":"7_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/978-3-030-17659-4_6","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"S Ghosh","year":"2019","unstructured":"Ghosh, S., Nilges, T.: An algebraic approach to maliciously secure private set intersection. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS, vol. 11478, pp. 154\u2013185. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17659-4_6"},{"key":"7_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1007\/3-540-48405-1_8","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 99","author":"N Gilboa","year":"1999","unstructured":"Gilboa, N.: Two party RSA key generation. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 116\u2013129. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48405-1_8"},{"key":"7_CR32","doi-asserted-by":"publisher","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game or a completeness theorem for protocols with honest majority. In: Aho, A. (ed.) 19th ACM STOC. pp. 218\u2013229. ACM Press (May 1987). https:\/\/doi.org\/10.1145\/28395.28420","DOI":"10.1145\/28395.28420"},{"issue":"10","key":"7_CR33","doi-asserted-by":"publisher","first-page":"3393","DOI":"10.1109\/TIT.2005.855587","volume":"51","author":"V Guruswami","year":"2005","unstructured":"Guruswami, V., Indyk, P.: Linear-time encodable\/decodable codes with near-optimal rate. IEEE Trans. Inf. Theory 51(10), 3393\u20133400 (2005). https:\/\/doi.org\/10.1109\/TIT.2005.855587","journal-title":"IEEE Trans. Inf. Theory"},{"key":"7_CR34","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":"7_CR35","doi-asserted-by":"publisher","unstructured":"Ishai, Y., Kushilevitz, E.: Private simultaneous messages protocols with applications. In: Fifth Israel Symposium on Theory of Computing and Systems, ISTCS 1997, Ramat-Gan, Israel, 17\u201319 June 1997, Proceedings, pp. 174\u2013184. IEEE Computer Society (1997). https:\/\/doi.org\/10.1109\/ISTCS.1997.595170","DOI":"10.1109\/ISTCS.1997.595170"},{"key":"7_CR36","doi-asserted-by":"publisher","unstructured":"Ishai, Y., Kushilevitz, E.: Randomizing polynomials: a new representation with applications to round-efficient secure computation. In: 41st FOCS, pp. 294\u2013304. IEEE Computer Society Press (November 2000). https:\/\/doi.org\/10.1109\/SFCS.2000.892118","DOI":"10.1109\/SFCS.2000.892118"},{"key":"7_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/3-540-45465-9_22","volume-title":"Automata, Languages and Programming","author":"Y Ishai","year":"2002","unstructured":"Ishai, Y., Kushilevitz, E.: Perfect constant-round secure computation via perfect randomizing polynomials. In: Widmayer, P., et al. (eds.) ICALP 2002. LNCS, vol. 2380, pp. 244\u2013256. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45465-9_22"},{"key":"7_CR38","doi-asserted-by":"publisher","unstructured":"Ishai, Y., Kushilevitz, E., Ostrovsky, R., Sahai, A.: Cryptography with constant computational overhead. In: Ladner, R.E., Dwork, C. (eds.) 40th ACM STOC, pp. 433\u2013442. ACM Press (May 2008). https:\/\/doi.org\/10.1145\/1374376.1374438","DOI":"10.1145\/1374376.1374438"},{"key":"7_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1007\/978-3-540-85174-5_32","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"Y Ishai","year":"2008","unstructured":"Ishai, Y., Prabhakaran, M., Sahai, A.: Founding cryptography on oblivious transfer \u2013 efficiently. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 572\u2013591. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85174-5_32"},{"key":"7_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1007\/978-3-642-00457-5_18","volume-title":"Theory of Cryptography","author":"Y Ishai","year":"2009","unstructured":"Ishai, Y., Prabhakaran, M., Sahai, A.: Secure arithmetic computation with no honest majority. In: Reingold, O. (ed.) TCC 2009. LNCS, vol. 5444, pp. 294\u2013314. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00457-5_18"},{"key":"7_CR41","doi-asserted-by":"publisher","unstructured":"Kushilevitz, E., Lindell, Y., Rabin, T.: Information-theoretically secure protocols and security under composition. SIAM J. Comput. 39(5), 2090\u20132112 (2010). https:\/\/doi.org\/10.1137\/090755886, https:\/\/doi.org\/10.1137\/090755886","DOI":"10.1137\/090755886 10.1137\/090755886"},{"key":"7_CR42","doi-asserted-by":"publisher","unstructured":"Lindell, Y.: General composition and universal composability in secure multi-party computation. In: 44th FOCS, pp. 394\u2013403. IEEE Computer Society Press (October 2003). https:\/\/doi.org\/10.1109\/SFCS.2003.1238213","DOI":"10.1109\/SFCS.2003.1238213"},{"key":"7_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1007\/978-3-540-85174-5_27","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"P Mohassel","year":"2008","unstructured":"Mohassel, P., Weinreb, E.: Efficient secure linear algebra in the presence of covert or computationally unbounded adversaries. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 481\u2013496. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85174-5_27"},{"key":"7_CR44","doi-asserted-by":"publisher","unstructured":"Naor, M., Pinkas, B.: Oblivious transfer and polynomial evaluation. In: 31st ACM STOC, pp. 245\u2013254. ACM Press (May 1999). https:\/\/doi.org\/10.1145\/301250.301312","DOI":"10.1145\/301250.301312"},{"key":"7_CR45","unstructured":"Naor, M., Pinkas, B.: Efficient oblivious transfer protocols. In: Kosaraju, S.R. (ed.) 12th SODA, pp. 448\u2013457. ACM-SIAM (January 2001)"},{"key":"7_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"554","DOI":"10.1007\/978-3-540-85174-5_31","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"C Peikert","year":"2008","unstructured":"Peikert, C., Vaikuntanathan, V., Waters, B.: A framework for efficient and composable oblivious transfer. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 554\u2013571. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85174-5_31"},{"key":"7_CR47","unstructured":"Rabin, M.O.: How to exchange secrets with oblivious transfer. IACR Cryptol. ePrint Arch. p. 187 (2005), http:\/\/eprint.iacr.org\/2005\/187"},{"key":"7_CR48","doi-asserted-by":"publisher","unstructured":"Schoppmann, P., Gasc\u00f3n, A., Reichert, L., Raykova, M.: Distributed vector-OLE: Improved constructions and implementation. In: Cavallaro, L., Kinder, J., Wang, X., Katz, J. (eds.) ACM CCS 2019, pp. 1055\u20131072. ACM Press (November 2019). https:\/\/doi.org\/10.1145\/3319535.3363228","DOI":"10.1145\/3319535.3363228"},{"key":"7_CR49","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1007\/978-3-540-77444-0_31","volume-title":"Distributed Computing and Networking","author":"B Shankar","year":"2007","unstructured":"Shankar, B., Srinathan, K., Rangan, C.P.: Alternative protocols for generalized oblivious transfer. In: Rao, S., Chatterjee, M., Jayanti, P., Murthy, C.S.R., Saha, S.K. (eds.) ICDCN 2008. LNCS, vol. 4904, pp. 304\u2013309. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-77444-0_31"},{"issue":"1","key":"7_CR50","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/s10623-010-9378-8","volume":"58","author":"T Tassa","year":"2011","unstructured":"Tassa, T.: Generalized oblivious transfer by secret sharing. Des. Codes Cryptogr. 58(1), 11\u201321 (2011). https:\/\/doi.org\/10.1007\/s10623-010-9378-8","journal-title":"Des. Codes Cryptogr."},{"key":"7_CR51","doi-asserted-by":"publisher","unstructured":"Weng, C., Yang, K., Katz, J., Wang, X.: Wolverine: Fast, scalable, and communication-efficient zero-knowledge proofs for boolean and arithmetic circuits. In: 42nd IEEE Symposium on Security and Privacy, SP 2021, San Francisco, CA, USA, 24\u201327 May 2021, pp. 1074\u20131091. IEEE (2021). https:\/\/doi.org\/10.1109\/SP40001.2021.00056","DOI":"10.1109\/SP40001.2021.00056"},{"key":"7_CR52","doi-asserted-by":"publisher","unstructured":"Yao, A.C.C.: How to generate and exchange secrets (extended abstract). In: 27th FOCS, pp. 162\u2013167. IEEE Computer Society Press (October 1986). https:\/\/doi.org\/10.1109\/SFCS.1986.25","DOI":"10.1109\/SFCS.1986.25"},{"key":"7_CR53","unstructured":"Zichron, L.: Locally computable arithmetic pseudorandom generators. Master\u2019s thesis, Tel Aviv University (2017), available from Applebaum\u2019s home page"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2023"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-30617-4_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,15]],"date-time":"2025-04-15T22:03:10Z","timestamp":1744754590000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-30617-4_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031306167","9783031306174"],"references-count":53,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-30617-4_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"15 April 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EUROCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Conference on the Theory and Applications of Cryptographic Techniques","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lyon","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","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":"23 April 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 April 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"42","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurocrypt2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocrypt.iacr.org\/2023\/","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":"HotCRP","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"415","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":"109","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":"16","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)"}}]}}