{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,3]],"date-time":"2026-11-03T22:47:59Z","timestamp":1793746079201,"version":"4.6.1"},"publisher-location":"New York, NY, USA","reference-count":58,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,11,6]],"date-time":"2019-11-06T00:00:00Z","timestamp":1572998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"ERC","award":["742754"],"award-info":[{"award-number":["742754"]}]},{"name":"AFOSR","award":["FA9550-17-1-0069"],"award-info":[{"award-number":["FA9550-17-1-0069"]}]},{"name":"ISF","award":["1861\/16"],"award-info":[{"award-number":["1861\/16"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,11,6]]},"DOI":"10.1145\/3319535.3354255","type":"proceedings-article","created":{"date-parts":[[2019,11,7]],"date-time":"2019-11-07T13:08:32Z","timestamp":1573132112000},"page":"291-308","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":190,"title":["Efficient Two-Round OT Extension and Silent Non-Interactive Secure Computation"],"prefix":"10.1145","author":[{"given":"Elette","family":"Boyle","sequence":"first","affiliation":[{"name":"IDC Herzliya, Herzliya, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Geoffroy","family":"Couteau","sequence":"additional","affiliation":[{"name":"Karlsruhe Institute of Technology, Karlsruhe, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Niv","family":"Gilboa","sequence":"additional","affiliation":[{"name":"Ben Gurion University, Be'er Sheva, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yuval","family":"Ishai","sequence":"additional","affiliation":[{"name":"Technion, Haifa, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lisa","family":"Kohl","sequence":"additional","affiliation":[{"name":"Karlsruhe Institute of Technology, Karlsruhe, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Peter","family":"Rindal","sequence":"additional","affiliation":[{"name":"Visa Research, Palo Alto, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Peter","family":"Scholl","sequence":"additional","affiliation":[{"name":"Aarhus University, Aarhus, Denmark"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2019,11,6]]},"reference":[{"key":"e_1_3_2_2_1_1","first-page":"387","volume-title":"Riva","author":"Afshar A.","year":"2014","unstructured":"Afshar , A. , Mohassel , P. , Pinkas , B. , Riva , B. : Non-interactive secure computation based on cut-and-choose. In : Nguyen, P.Q., Oswald, E. (eds.) EUROCRYPT 2014 . LNCS, vol. 8441 , pp. 387 -- 404 . Springer , Heidelberg (May 2014) Afshar, A., Mohassel, P., Pinkas, B., Riva, B.: Non-interactive secure computation based on cut-and-choose. In: Nguyen, P.Q., Oswald, E. (eds.) EUROCRYPT 2014. LNCS, vol. 8441, pp. 387--404. Springer, Heidelberg (May 2014)"},{"key":"e_1_3_2_2_2_1","volume-title":"Z\u00e9mor","author":"Aguilar Melchor C.","year":"2019","unstructured":"Aguilar Melchor , C. , Aragon , N. , Bettaieb , S. , Bidoux , L. , Blazy , O. , Deneuville , J.C. , Gaborit , P. , Persichetti , E. , Z\u00e9mor , G. : Hamming quasi-cyclic (HQC) ( 2019 ), https:\/\/pqc-hqc.org\/doc\/hqc-specification_2018--12--14.pdf Aguilar Melchor, C., Aragon, N., Bettaieb, S., Bidoux, L., Blazy, O., Deneuville, J.C., Gaborit, P., Persichetti, E., Z\u00e9mor, G.: Hamming quasi-cyclic (HQC) (2019), https:\/\/pqc-hqc.org\/doc\/hqc-specification_2018--12--14.pdf"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2003.1238204"},{"key":"e_1_3_2_2_4_1","first-page":"223","volume-title":"I., Ishai, Y., Nielsen, M.","author":"Applebaum B.","year":"2017","unstructured":"Applebaum , B. , Damgr ard , I., Ishai, Y., Nielsen, M. , Zichron, L. : Secure arithmetic computation with constant computational overhead. In : Katz, J., Shacham, H. (eds.) CRYPTO 2017 , Part I. LNCS, vol. 10401 , pp. 223 -- 254 . Springer , Heidelberg (Aug 2017) Applebaum, B., Damgr ard, I., Ishai, Y., Nielsen, M., Zichron, L.: Secure arithmetic computation with constant computational overhead. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017, Part I. LNCS, vol. 10401, pp. 223--254. Springer, Heidelberg (Aug 2017)"},{"key":"e_1_3_2_2_5_1","volume-title":"Kushilevitz","author":"Applebaum B.","year":"2009","unstructured":"Applebaum , B. , Ishai , Y. , Kushilevitz , E. : Cryptography with constant input locality. Journal of Cryptology 22(4), 429--469 ( Oct 2009 ) Applebaum, B., Ishai, Y., Kushilevitz, E.: Cryptography with constant input locality. Journal of Cryptology 22(4), 429--469 (Oct 2009)"},{"key":"e_1_3_2_2_6_1","volume-title":"Bike: Bit flipping key encapsulation","author":"Aragon N.","year":"2019","unstructured":"Aragon , N. , Barreto , P. , Bettaieb , S. , Bidoux , L. , Blazy , O. , Deneuville , J.C. , Gaborit , P. , Gueron , S. , Guneysu , T. , Melchor , C.A. , : Bike: Bit flipping key encapsulation ( 2019 ), https:\/\/bikesuite.org\/files\/round2\/spec\/BIKE-Spec-2019.06.30.1.pdf Aragon, N., Barreto, P., Bettaieb, S., Bidoux, L., Blazy, O., Deneuville, J.C., Gaborit, P., Gueron, S., Guneysu, T., Melchor, C.A., et al.: Bike: Bit flipping key encapsulation (2019), https:\/\/bikesuite.org\/files\/round2\/spec\/BIKE-Spec-2019.06.30.1.pdf"},{"key":"e_1_3_2_2_7_1","first-page":"403","volume-title":"Ge","author":"Arora S.","year":"2011","unstructured":"Arora , S. , Ge , R. : New algorithms for learning in presence of errors. In : Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011 , Part I. LNCS, vol. 6755 , pp. 403 -- 415 . Springer , Heidelberg (Jul 2011) Arora, S., Ge, R.: New algorithms for learning in presence of errors. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part I. LNCS, vol. 6755, pp. 403--415. Springer, Heidelberg (Jul 2011)"},{"key":"e_1_3_2_2_8_1","first-page":"535","volume-title":"Zohner","author":"Asharov G.","year":"2013","unstructured":"Asharov , G. , Lindell , Y. , Schneider , T. , Zohner , M. : More efficient oblivious transfer and extensions for faster secure computation. In : Sadeghi, A.R., Gligor, V.D., Yung, M. (eds.) ACM CCS 2013 . pp. 535 -- 548 . ACM Press (Nov 2013) Asharov, G., Lindell, Y., Schneider, T., Zohner, M.: More efficient oblivious transfer and extensions for faster secure computation. In: Sadeghi, A.R., Gligor, V.D., Yung, M. (eds.) ACM CCS 2013. pp. 535--548. ACM Press (Nov 2013)"},{"key":"e_1_3_2_2_9_1","first-page":"420","volume-title":"Advances in Cryptology - CRYPTO '91, 11th Annual International Cryptology Conference, Santa Barbara, California, USA, August 11--15, 1991, Proceedings.","author":"Beaver D.","year":"1991","unstructured":"Beaver , D. : Efficient multiparty protocols using circuit randomization . In: Advances in Cryptology - CRYPTO '91, 11th Annual International Cryptology Conference, Santa Barbara, California, USA, August 11--15, 1991, Proceedings. pp. 420 -- 432 ( 1991 ), https:\/\/doi.org\/10.1007\/3--540--46766--1_34 10.1007\/3--540--46766--1_34 Beaver, D.: Efficient multiparty protocols using circuit randomization. In: Advances in Cryptology - CRYPTO '91, 11th Annual International Cryptology Conference, Santa Barbara, California, USA, August 11--15, 1991, Proceedings. pp. 420--432 (1991), https:\/\/doi.org\/10.1007\/3--540--46766--1_34"},{"key":"e_1_3_2_2_10_1","volume-title":"Meurer","author":"Becker A.","unstructured":"Becker , A. , Joux , A. , May , A. , Meurer , A. : Decoding random binary linear codes in $2^n\/20$: How 1 Becker, A., Joux, A., May, A., Meurer, A.: Decoding random binary linear codes in $2^n\/20$: How 1"},{"key":"e_1_3_2_2_11_1","first-page":"520","volume-title":"Pointcheval, D., Johansson, T. (eds.) EUROCRYPT","year":"2012","unstructured":"1 = 0 improves information set decoding. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012 . LNCS, vol. 7237 , pp. 520 -- 536 . Springer , Heidelberg (Apr 2012) 1 = 0 improves information set decoding. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 520--536. Springer, Heidelberg (Apr 2012)"},{"key":"e_1_3_2_2_12_1","first-page":"169","volume-title":"Zakarias","author":"Bendlin R.","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 -- 188 . Springer , Heidelberg (May 2011) 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--188. Springer, Heidelberg (May 2011)"},{"key":"e_1_3_2_2_13_1","first-page":"278","volume-title":"Advances in Cryptology - CRYPTO '93, 13th Annual International Cryptology Conference, Santa Barbara, California, USA, August 22--26, 1993, Proceedings.","author":"Blum A.","year":"1993","unstructured":"Blum , A. , Furst , M.L. , Kearns , M.J. , Lipton , R.J. : Cryptographic primitives based on hard learning problems . In: Advances in Cryptology - CRYPTO '93, 13th Annual International Cryptology Conference, Santa Barbara, California, USA, August 22--26, 1993, Proceedings. pp. 278 -- 291 ( 1993 ), https:\/\/doi.org\/10.1007\/3--540--48329--2_24 10.1007\/3--540--48329--2_24 Blum, A., Furst, M.L., Kearns, M.J., Lipton, R.J.: Cryptographic primitives based on hard learning problems. In: Advances in Cryptology - CRYPTO '93, 13th Annual International Cryptology Conference, Santa Barbara, California, USA, August 22--26, 1993, Proceedings. pp. 278--291 (1993), https:\/\/doi.org\/10.1007\/3--540--48329--2_24"},{"key":"e_1_3_2_2_14_1","first-page":"435","volume-title":"Wasserman","author":"Blum A.","year":"2000","unstructured":"Blum , A. , Kalai , A. , Wasserman , H. : Noise-tolerant learning, the parity problem, and the statistical query model. In: 32nd ACM STOC. pp. 435 -- 440 . ACM Press (May 2000 ) Blum, A., Kalai, A., Wasserman, H.: Noise-tolerant learning, the parity problem, and the statistical query model. In: 32nd ACM STOC. pp. 435--440. ACM Press (May 2000)"},{"key":"e_1_3_2_2_15_1","first-page":"280","volume-title":"Waters","author":"Boneh D.","year":"2013","unstructured":"Boneh , D. , Waters , B. : Constrained pseudorandom functions and their applications. In : Sako, K., Sarkar, P. (eds.) ASIACRYPT 2013 , Part II. LNCS, vol. 8270 , pp. 280 -- 300 . Springer , Heidelberg (Dec 2013) Boneh, D., Waters, B.: Constrained pseudorandom functions and their applications. In: Sako, K., Sarkar, P. (eds.) ASIACRYPT 2013, Part II. LNCS, vol. 8270, pp. 280--300. Springer, Heidelberg (Dec 2013)"},{"key":"e_1_3_2_2_16_1","first-page":"896","volume-title":"Ishai","author":"Boyle E.","year":"2018","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 -- 912 . ACM Press (Oct 2018) 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--912. ACM Press (Oct 2018)"},{"key":"e_1_3_2_2_17_1","first-page":"489","volume-title":"Scholl","author":"Boyle E.","year":"2019","unstructured":"Boyle , E. , Couteau , G. , Gilboa , N. , Ishai , Y. , Kohl , L. , Scholl , P. : Efficient pseudorandom correlation generators: Silent OT extension and more. In : Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019 , Part III. LNCS, vol. 11694 , pp. 489 -- 518 . Springer , Heidelberg (Aug 2019) Boyle, E., Couteau, G., Gilboa, N., Ishai, Y., Kohl, L., Scholl, P.: Efficient pseudorandom correlation generators: Silent OT extension and more. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019, Part III. LNCS, vol. 11694, pp. 489--518. Springer, Heidelberg (Aug 2019)"},{"key":"e_1_3_2_2_18_1","first-page":"1292","volume-title":"Ishai","author":"Boyle E.","year":"2016","unstructured":"Boyle , E. , Gilboa , N. , Ishai , Y. : Function secret sharing: Improvements and extensions. In : Weippl, E.R., Katzenbeisser, S., Kruegel, C., Myers, A.C., Halevi, S. (eds.) ACM CCS 2016 . pp. 1292 -- 1303 . ACM Press (Oct 2016) Boyle, E., Gilboa, N., Ishai, Y.: Function secret sharing: Improvements and extensions. In: Weippl, E.R., Katzenbeisser, S., Kruegel, C., Myers, A.C., Halevi, S. (eds.) ACM CCS 2016. pp. 1292--1303. ACM Press (Oct 2016)"},{"key":"e_1_3_2_2_19_1","first-page":"501","volume-title":"Ivan","author":"Boyle E.","year":"2014","unstructured":"Boyle , E. , Goldwasser , S. , Ivan , I. : Functional signatures and pseudorandom functions. In : Krawczyk, H. (ed.) PKC 2014 . LNCS, vol. 8383 , pp. 501 -- 519 . Springer , Heidelberg (Mar 2014) Boyle, E., Goldwasser, S., Ivan, I.: Functional signatures and pseudorandom functions. In: Krawczyk, H. (ed.) PKC 2014. LNCS, vol. 8383, pp. 501--519. Springer, Heidelberg (Mar 2014)"},{"key":"e_1_3_2_2_20_1","series-title":"Jan 2000","volume-title":"Security and composition of multiparty cryptographic protocols. Journal of Cryptology 13(1), 143--202","author":"Canetti R.","unstructured":"Canetti , R. : Security and composition of multiparty cryptographic protocols. Journal of Cryptology 13(1), 143--202 ( Jan 2000 ) Canetti, R.: Security and composition of multiparty cryptographic protocols. Journal of Cryptology 13(1), 143--202 (Jan 2000)"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2001.959888"},{"key":"e_1_3_2_2_22_1","volume-title":"Yang","author":"Chen M.","year":"1803","unstructured":"Chen , M. , Cheng , C. , Kuo , P. , Li , W. , Yang , B. : Multiplying boolean polynomials with frobenius partitions in additive fast fourier transform. CoRR abs\/ 1803 .11301 (2018) Chen, M., Cheng, C., Kuo, P., Li, W., Yang, B.: Multiplying boolean polynomials with frobenius partitions in additive fast fourier transform. CoRR abs\/1803.11301 (2018)"},{"key":"e_1_3_2_2_23_1","first-page":"643","volume-title":"N.P.","author":"Damg\u00e5rd I.","year":"2012","unstructured":"Damg\u00e5rd , I. , Pastro , V. , Smart , N.P. , Zakarias, S. : Multiparty computation from somewhat homomorphic encryption. In : Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012 . LNCS, vol. 7417 , pp. 643 -- 662 . Springer , Heidelberg (Aug 2012) Damg\u00e5rd, I., Pastro, V., Smart, N.P., Zakarias, S.: Multiparty computation from somewhat homomorphic encryption. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 643--662. Springer, Heidelberg (Aug 2012)"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2017.23097"},{"key":"e_1_3_2_2_25_1","first-page":"523","volume-title":"Thuraisingham, B.M., Evans, D., Malkin, T., Xu, D. (eds.) ACM CCS","author":"Doerner J.","year":"2017","unstructured":"Doerner , J. , shelat, a.: Scaling ORAM for secure computation . In: Thuraisingham, B.M., Evans, D., Malkin, T., Xu, D. (eds.) ACM CCS 2017 . pp. 523 -- 535 . ACM Press (Oct \/ Nov 2017) Doerner, J., shelat, a.: Scaling ORAM for secure computation. In: Thuraisingham, B.M., Evans, D., Malkin, T., Xu, D. (eds.) ACM CCS 2017. pp. 523--535. ACM Press (Oct \/ Nov 2017)"},{"key":"e_1_3_2_2_26_1","first-page":"2263","volume-title":"Trifiletti","author":"D\u00f6ttling N.","year":"2017","unstructured":"D\u00f6ttling , N. , Ghosh , S. , Nielsen , J.B. , Nilges , T. , Trifiletti , R. : TinyOLE: Efficient actively secure two-party computation from oblivious linear function evaluation. In : Thuraisingham, B.M., Evans, D., Malkin, T., Xu, D. (eds.) ACM CCS 2017 . pp. 2263 -- 2276 . ACM Press (Oct \/ Nov 2017) D\u00f6ttling, N., Ghosh, S., Nielsen, J.B., Nilges, T., Trifiletti, R.: TinyOLE: Efficient actively secure two-party computation from oblivious linear function evaluation. In: Thuraisingham, B.M., Evans, D., Malkin, T., Xu, D. (eds.) ACM CCS 2017. pp. 2263--2276. ACM Press (Oct \/ Nov 2017)"},{"key":"e_1_3_2_2_27_1","first-page":"169","volume-title":"Ishai","author":"Druk E.","year":"2014","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 -- 182 . ACM (Jan 2014) 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--182. ACM (Jan 2014)"},{"key":"e_1_3_2_2_28_1","first-page":"486","volume-title":"May","author":"Esser A.","year":"2017","unstructured":"Esser , A. , K\u00fcbler , R. , May , A. : LPN decoded. In : Katz, J., Shacham, H. (eds.) CRYPTO 2017 , Part II. LNCS, vol. 10402 , pp. 486 -- 514 . Springer , Heidelberg (Aug 2017) Esser, A., K\u00fcbler, R., May, A.: LPN decoded. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017, Part II. LNCS, vol. 10402, pp. 486--514. Springer, Heidelberg (Aug 2017)"},{"key":"e_1_3_2_2_29_1","first-page":"545","volume-title":"Meckler","author":"Garg S.","year":"2018","unstructured":"Garg , S. , Mahmoody , M. , Masny , D. , Meckler , I. : On the round complexity of OT extension. In : Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018 , Part III. LNCS, vol. 10993 , pp. 545 -- 574 . Springer , Heidelberg (Aug 2018) Garg, S., Mahmoody, M., Masny, D., Meckler, I.: On the round complexity of OT extension. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018, Part III. LNCS, vol. 10993, pp. 545--574. Springer, Heidelberg (Aug 2018)"},{"key":"e_1_3_2_2_30_1","first-page":"629","volume-title":"Nilges","author":"Ghosh S.","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 , Part I. LNCS, vol. 10624 , pp. 629 -- 659 . Springer , Heidelberg (Dec 2017) Ghosh, S., Nielsen, J.B., Nilges, T.: Maliciously secure oblivious linear function evaluation with constant overhead. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT 2017, Part I. LNCS, vol. 10624, pp. 629--659. Springer, Heidelberg (Dec 2017)"},{"key":"e_1_3_2_2_31_1","first-page":"640","volume-title":"Ishai","author":"Gilboa N.","year":"2014","unstructured":"Gilboa , N. , Ishai , Y. : Distributed point functions and their applications. In : Nguyen, P.Q., Oswald, E. (eds.) EUROCRYPT 2014 . LNCS, vol. 8441 , pp. 640 -- 658 . Springer , Heidelberg (May 2014) Gilboa, N., Ishai, Y.: Distributed point functions and their applications. In: Nguyen, P.Q., Oswald, E. (eds.) EUROCRYPT 2014. LNCS, vol. 8441, pp. 640--658. Springer, Heidelberg (May 2014)"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.5555\/975541"},{"key":"e_1_3_2_2_33_1","volume-title":"Micali","author":"Goldreich O.","year":"1986","unstructured":"Goldreich , O. , Goldwasser , S. , Micali , S. : How to construct random functions. Journal of the ACM 33(4), 792--807 ( Oct 1986 ) Goldreich, O., Goldwasser, S., Micali, S.: How to construct random functions. Journal of the ACM 33(4), 792--807 (Oct 1986)"},{"key":"e_1_3_2_2_34_1","first-page":"218","volume-title":"Wigderson","author":"Goldreich O.","year":"1987","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 -- 229 . ACM Press (May 1987 ) 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--229. ACM Press (May 1987)"},{"key":"e_1_3_2_2_35_1","first-page":"86","volume-title":"Soria-Vazquez","author":"Hazay C.","year":"2018","unstructured":"Hazay , C. , Orsini , E. , Scholl , P. , Soria-Vazquez , E. : Concretely efficient large-scale MPC with active security (or, TinyKeys for TinyOT). In : Peyrin, T., Galbraith, S. (eds.) ASIACRYPT 2018 , Part III. LNCS, vol. 11274 , pp. 86 -- 117 . Springer , Heidelberg (Dec 2018) Hazay, C., Orsini, E., Scholl, P., Soria-Vazquez, E.: Concretely efficient large-scale MPC with active security (or, TinyKeys for TinyOT). In: Peyrin, T., Galbraith, S. (eds.) ASIACRYPT 2018, Part III. LNCS, vol. 11274, pp. 86--117. Springer, Heidelberg (Dec 2018)"},{"key":"e_1_3_2_2_36_1","first-page":"3","volume-title":"Soria-Vazquez","author":"Hazay C.","year":"2018","unstructured":"Hazay , C. , Orsini , E. , Scholl , P. , Soria-Vazquez , E. : TinyKeys: A new approach to efficient multi-party computation. In : Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018 , Part III. LNCS, vol. 10993 , pp. 3 -- 33 . Springer , Heidelberg (Aug 2018) Hazay, C., Orsini, E., Scholl, P., Soria-Vazquez, E.: TinyKeys: A new approach to efficient multi-party computation. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018, Part III. LNCS, vol. 10993, pp. 3--33. Springer, Heidelberg (Aug 2018)"},{"key":"e_1_3_2_2_37_1","volume-title":"NDSS 2012","author":"Huang Y.","year":"2012","unstructured":"Huang , Y. , Evans , D. , Katz , J. : Private set intersection: Are garbled circuits better than custom protocols? In: NDSS 2012 . The Internet Society ( Feb 2012 ) Huang, Y., Evans, D., Katz, J.: Private set intersection: Are garbled circuits better than custom protocols? In: NDSS 2012. The Internet Society (Feb 2012)"},{"key":"e_1_3_2_2_38_1","first-page":"145","volume-title":"Petrank","author":"Ishai Y.","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 -- 161 . Springer , Heidelberg (Aug 2003) Ishai, Y., Kilian, J., Nissim, K., Petrank, E.: Extending oblivious transfers efficiently. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 145--161. Springer, Heidelberg (Aug 2003)"},{"key":"e_1_3_2_2_39_1","first-page":"406","volume-title":"Sahai","author":"Ishai Y.","year":"2011","unstructured":"Ishai , Y. , Kushilevitz , E. , Ostrovsky , R. , Prabhakaran , M. , Sahai , A. : Efficient non-interactive secure computation. In : Paterson, K.G. (ed.) EUROCRYPT 2011 . LNCS, vol. 6632 , pp. 406 -- 425 . Springer , Heidelberg (May 2011) Ishai, Y., Kushilevitz, E., Ostrovsky, R., Prabhakaran, M., Sahai, A.: Efficient non-interactive secure computation. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol. 6632, pp. 406--425. Springer, Heidelberg (May 2011)"},{"key":"e_1_3_2_2_40_1","first-page":"294","volume-title":"Sahai","author":"Ishai Y.","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 -- 314 . Springer , Heidelberg (Mar 2009) Ishai, Y., Prabhakaran, M., Sahai, A.: Secure arithmetic computation with no honest majority. In: Reingold, O. (ed.) TCC 2009. LNCS, vol. 5444, pp. 294--314. Springer, Heidelberg (Mar 2009)"},{"key":"e_1_3_2_2_41_1","first-page":"365","volume-title":"Wang","author":"Katz J.","year":"2018","unstructured":"Katz , J. , Ranellucci , S. , Rosulek , M. , Wang , X. : Optimizing authenticated garbling for faster secure two-party computation. In : Advances in Cryptology - CRYPTO 2018 - 38th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19--23, 2018, Proceedings, Part III. pp. 365 -- 391 (2018), https:\/\/doi.org\/10.1007\/978--3--319--96878-0_13 10.1007\/978--3--319--96878-0_13 Katz, J., Ranellucci, S., Rosulek, M., Wang, X.: Optimizing authenticated garbling for faster secure two-party computation. In: Advances in Cryptology - CRYPTO 2018 - 38th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19--23, 2018, Proceedings, Part III. pp. 365--391 (2018), https:\/\/doi.org\/10.1007\/978--3--319--96878-0_13"},{"key":"e_1_3_2_2_42_1","first-page":"724","volume-title":"Scholl","author":"Keller M.","year":"2015","unstructured":"Keller , M. , Orsini , E. , Scholl , P. : Actively secure OT extension with optimal overhead. In : Gennaro, R., Robshaw, M.J.B. (eds.) CRYPTO 2015 , Part I. LNCS, vol. 9215 , pp. 724 -- 741 . Springer , Heidelberg (Aug 2015) Keller, M., Orsini, E., Scholl, P.: Actively secure OT extension with optimal overhead. In: Gennaro, R., Robshaw, M.J.B. (eds.) CRYPTO 2015, Part I. LNCS, vol. 9215, pp. 724--741. Springer, Heidelberg (Aug 2015)"},{"key":"e_1_3_2_2_43_1","first-page":"669","volume-title":"Zacharias","author":"Kiayias A.","year":"2013","unstructured":"Kiayias , A. , Papadopoulos , S. , Triandopoulos , N. , Zacharias , T. : Delegatable pseudorandom functions and applications. In : Sadeghi, A.R., Gligor, V.D., Yung, M. (eds.) ACM CCS 2013 . pp. 669 -- 684 . ACM Press (Nov 2013) Kiayias, A., Papadopoulos, S., Triandopoulos, N., Zacharias, T.: Delegatable pseudorandom functions and applications. In: Sadeghi, A.R., Gligor, V.D., Yung, M. (eds.) ACM CCS 2013. pp. 669--684. ACM Press (Nov 2013)"},{"key":"e_1_3_2_2_44_1","first-page":"20","volume-title":"Proceedings of the 20th Annual ACM Symposium on Theory of Computing, May 2--4, 1988","author":"Kilian J.","year":"1988","unstructured":"Kilian , J. : Founding cryptography on oblivious transfer . In: Proceedings of the 20th Annual ACM Symposium on Theory of Computing, May 2--4, 1988 , Chicago, Illinois, USA. pp. 20 -- 31 ( 1988 ), https:\/\/doi.org\/10.1145\/62212.62215 10.1145\/62212.62215 Kilian, J.: Founding cryptography on oblivious transfer. In: Proceedings of the 20th Annual ACM Symposium on Theory of Computing, May 2--4, 1988, Chicago, Illinois, USA. pp. 20--31 (1988), https:\/\/doi.org\/10.1145\/62212.62215"},{"key":"e_1_3_2_2_45_1","first-page":"54","volume-title":"Kumaresan","author":"Kolesnikov V.","year":"2013","unstructured":"Kolesnikov , V. , Kumaresan , R. : Improved OT extension for transferring short secrets. In : Canetti, R., Garay, J.A. (eds.) CRYPTO 2013 , Part II. LNCS, vol. 8043 , pp. 54 -- 70 . Springer , Heidelberg (Aug 2013) Kolesnikov, V., Kumaresan, R.: Improved OT extension for transferring short secrets. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013, Part II. LNCS, vol. 8043, pp. 54--70. Springer, Heidelberg (Aug 2013)"},{"key":"e_1_3_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.1007\/11538462_32"},{"key":"e_1_3_2_2_47_1","first-page":"425","volume-title":"Rosulek","author":"Mohassel P.","year":"2017","unstructured":"Mohassel , P. , Rosulek , M. : Non-interactive secure 2PC in the offline\/online and batch settings. In : Coron, J., Nielsen, J.B. (eds.) EUROCRYPT 2017 , Part III. LNCS, vol. 10212 , pp. 425 -- 455 . Springer , Heidelberg (Apr \/ May 2017) Mohassel, P., Rosulek, M.: Non-interactive secure 2PC in the offline\/online and batch settings. In: Coron, J., Nielsen, J.B. (eds.) EUROCRYPT 2017, Part III. LNCS, vol. 10212, pp. 425--455. Springer, Heidelberg (Apr \/ May 2017)"},{"key":"e_1_3_2_2_48_1","volume-title":"Pinkas","author":"Naor M.","year":"2005","unstructured":"Naor , M. , Pinkas , B. : Computationally secure oblivious transfer. Journal of Cryptology 18(1), 1--35 ( Jan 2005 ) Naor, M., Pinkas, B.: Computationally secure oblivious transfer. Journal of Cryptology 18(1), 1--35 (Jan 2005)"},{"key":"e_1_3_2_2_49_1","volume-title":"Pinkas","author":"Naor M.","year":"2006","unstructured":"Naor , M. , Pinkas , B. : Oblivious polynomial evaluation. SIAM J. Comput . 35(5), 1254--1281 ( 2006 ) Naor, M., Pinkas, B.: Oblivious polynomial evaluation. SIAM J. Comput. 35(5), 1254--1281 (2006)"},{"key":"e_1_3_2_2_50_1","first-page":"554","volume-title":"B.: A framework for efficient and composable oblivious transfer","author":"Peikert C.","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 -- 571 . Springer , Heidelberg ( Aug 2008 ) 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--571. Springer, Heidelberg (Aug 2008)"},{"key":"e_1_3_2_2_51_1","first-page":"515","volume-title":"Zohner","author":"Pinkas B.","year":"2015","unstructured":"Pinkas , B. , Schneider , T. , Segev , G. , Zohner , M. : Phasing: Private set intersection using permutation-based hashing. In : Jung, J., Holz, T. (eds.) USENIX Security 2015 . pp. 515 -- 530 . USENIX Association (Aug 2015) Pinkas, B., Schneider, T., Segev, G., Zohner, M.: Phasing: Private set intersection using permutation-based hashing. In: Jung, J., Holz, T. (eds.) USENIX Security 2015. pp. 515--530. USENIX Association (Aug 2015)"},{"key":"e_1_3_2_2_52_1","volume-title":"Yanai","author":"Pinkas B.","year":"2019","unstructured":"Pinkas , B. , Schneider , T. , Tkachenko , O. , Yanai , A. : Efficient circuit-based psi with linear communication ( 2019 ), https:\/\/eprint.iacr.org\/2019\/241 Pinkas, B., Schneider, T., Tkachenko, O., Yanai, A.: Efficient circuit-based psi with linear communication (2019), https:\/\/eprint.iacr.org\/2019\/241"},{"key":"e_1_3_2_2_53_1","doi-asserted-by":"crossref","unstructured":"Prange E.: The use of information sets in decoding cyclic codes. IRE Transactions on Information Theory 8(5) 5--9 (1962)  Prange E.: The use of information sets in decoding cyclic codes. IRE Transactions on Information Theory 8(5) 5--9 (1962)","DOI":"10.1109\/TIT.1962.1057777"},{"key":"e_1_3_2_2_54_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25405-5_4"},{"key":"e_1_3_2_2_55_1","first-page":"144","volume-title":"Sendrier","author":"Torres R.C.","year":"2016","unstructured":"Torres , R.C. , Sendrier , N. : Analysis of information set decoding for a sub-linear error weight. In : Takagi, T. (ed.) Post-Quantum Cryptography - 7th International Workshop, PQCrypto 2016 . pp. 144 -- 161 . Springer , Heidelberg (2016) Torres, R.C., Sendrier, N.: Analysis of information set decoding for a sub-linear error weight. In: Takagi, T. (ed.) Post-Quantum Cryptography - 7th International Workshop, PQCrypto 2016. pp. 144--161. Springer, Heidelberg (2016)"},{"key":"e_1_3_2_2_56_1","first-page":"21","volume-title":"Katz","author":"Wang X.","year":"2017","unstructured":"Wang , X. , Ranellucci , S. , Katz , J. : Authenticated garbling and efficient maliciously secure two-party computation. In : Thuraisingham, B.M., Evans, D., Malkin, T., Xu, D. (eds.) ACM CCS 2017 . pp. 21 -- 37 . ACM Press (Oct \/ Nov 2017) Wang, X., Ranellucci, S., Katz, J.: Authenticated garbling and efficient maliciously secure two-party computation. In: Thuraisingham, B.M., Evans, D., Malkin, T., Xu, D. (eds.) ACM CCS 2017. pp. 21--37. ACM Press (Oct \/ Nov 2017)"},{"key":"e_1_3_2_2_57_1","first-page":"39","volume-title":"Katz","author":"Wang X.","year":"2017","unstructured":"Wang , X. , Ranellucci , S. , Katz , J. : Global-scale secure multiparty computation. In : Thuraisingham, B.M., Evans, D., Malkin, T., Xu, D. (eds.) ACM CCS 2017 . pp. 39 -- 56 . ACM Press (Oct \/ Nov 2017) Wang, X., Ranellucci, S., Katz, J.: Global-scale secure multiparty computation. In: Thuraisingham, B.M., Evans, D., Malkin, T., Xu, D. (eds.) ACM CCS 2017. pp. 39--56. ACM Press (Oct \/ Nov 2017)"},{"key":"e_1_3_2_2_58_1","volume-title":"School of Electrical Engineering","author":"Zichron L.","year":"2017","unstructured":"Zichron , L. : Locally computable arithmetic pseudorandom generators. Master's thesis , School of Electrical Engineering , Tel Aviv University ( 2017 ), http:\/\/www.eng.tau.ac.il\/ bennyap\/pubs\/Zichron.pdf Zichron, L.: Locally computable arithmetic pseudorandom generators. Master's thesis, School of Electrical Engineering, Tel Aviv University (2017), http:\/\/www.eng.tau.ac.il\/ bennyap\/pubs\/Zichron.pdf"}],"event":{"name":"CCS '19: 2019 ACM SIGSAC Conference on Computer and Communications Security","location":"London United Kingdom","acronym":"CCS '19","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3319535.3354255","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3319535.3354255","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3319535.3354255","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:44:32Z","timestamp":1750203872000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3319535.3354255"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,6]]},"references-count":58,"alternative-id":["10.1145\/3319535.3354255","10.1145\/3319535"],"URL":"https:\/\/doi.org\/10.1145\/3319535.3354255","relation":{},"subject":[],"published":{"date-parts":[[2019,11,6]]},"assertion":[{"value":"2019-11-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}