{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T10:03:15Z","timestamp":1775815395471,"version":"3.50.1"},"reference-count":74,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T00:00:00Z","timestamp":1648771200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T00:00:00Z","timestamp":1648771200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Cryptol"],"published-print":{"date-parts":[[2022,4]]},"DOI":"10.1007\/s00145-022-09423-5","type":"journal-article","created":{"date-parts":[[2022,4,7]],"date-time":"2022-04-07T01:02:21Z","timestamp":1649293341000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["TinyKeys: A New Approach to Efficient Multi-Party Computation"],"prefix":"10.1007","volume":"35","author":[{"given":"Carmit","family":"Hazay","sequence":"first","affiliation":[]},{"given":"Emmanuela","family":"Orsini","sequence":"additional","affiliation":[]},{"given":"Peter","family":"Scholl","sequence":"additional","affiliation":[]},{"given":"Eduardo","family":"Soria-Vazquez","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,4,7]]},"reference":[{"key":"9423_CR1","unstructured":"M.R. Albrecht, G.V. Bard, C. Pernet, Efficient dense gaussian elimination over the finite field with two elements. CoRR, arXiv:1111.6549 (2011)"},{"issue":"3","key":"9423_CR2","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1515\/popets-2017-0033","volume":"2017","author":"G Asharov","year":"2017","unstructured":"G. Asharov, D. Demmler, M. Schapira, T. Schneider, G. Segev, S. Shenker, M. Zohner, Privacy-preserving interdomain routing at internet scale. PoPETs 2017(3), 147 (2017)","journal-title":"PoPETs"},{"key":"9423_CR3","doi-asserted-by":"crossref","unstructured":"T. Araki, J. Furukawa, Y. Lindell, A. Nof, K. Ohara, High-throughput semi-honest secure three-party computation with an honest majority, in E.R. Weippl, S. Katzenbeisser, C. Kruegel, A.C. Myers, S. Halevi editors, ACM CCS 2016 (ACM Press, October 2016), pp. 805\u2013817","DOI":"10.1145\/2976749.2978331"},{"key":"9423_CR4","first-page":"230","volume":"2003","author":"D Augot","year":"2003","unstructured":"D. Augot, M. Finiasz, N. Sendrier, A fast provably secure cryptographic hash function. IACR Cryptol. ePrint Arch. 2003, 230 (2003)","journal-title":"IACR Cryptol. ePrint Arch."},{"issue":"4","key":"9423_CR5","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/s00145-009-9039-0","volume":"22","author":"B Applebaum","year":"2009","unstructured":"B. Applebaum, Y. Ishai, E. Kushilevitz, Cryptography with constant input locality. J. Cryptol. 22(4), 429\u2013469 (2009)","journal-title":"J. Cryptol."},{"key":"9423_CR6","doi-asserted-by":"crossref","unstructured":"G. Asharov, A. Jain, A. L\u00f3pez-Alt, E. Tromer, V. Vaikuntanathan, D. Wichs, Multiparty computation with low communication, computation and interaction via threshold FHE, in D. Pointcheval, T. Johansson editors, EUROCRYPT 2012. LNCS, vol. 7237 (Springer, Heidelberg, April 2012), pp. 483\u2013501","DOI":"10.1007\/978-3-642-29011-4_29"},{"key":"9423_CR7","doi-asserted-by":"crossref","unstructured":"G. Asharov, Y. Lindell, T. Schneider, M. Zohner. More efficient oblivious transfer and extensions for faster secure computation, in A.-R. Sadeghi, V.D. Gligor, M. Yung editors, ACM CCS 2013 (ACM Press, November 2013), pp. 535\u2013548","DOI":"10.1145\/2508859.2516738"},{"key":"9423_CR8","doi-asserted-by":"crossref","unstructured":"B. Applebaum, Garbling XOR gates \u201cfor free\u201d in the standard model. J. Cryptol. 29(3), 552\u2013576 (2016)","DOI":"10.1007\/s00145-015-9201-9"},{"key":"9423_CR9","doi-asserted-by":"crossref","unstructured":"D. Beaver, Efficient multiparty protocols using circuit randomization, in J. Feigenbaum editor, CRYPTO\u201991. LNCS, vol. 576 (Springer, Heidelberg, August 1992), pp. 420\u2013432","DOI":"10.1007\/3-540-46766-1_34"},{"key":"9423_CR10","doi-asserted-by":"crossref","unstructured":"A. Blum, M.L. Furst, M.J. Kearns, R.J. Lipton, Cryptographic primitives based on hard learning problems, in D.R. Stinson editor, CRYPTO\u201993. LNCS, vol. 773 (Springer, Heidelberg, August 1994), pp. 278\u2013291","DOI":"10.1007\/3-540-48329-2_24"},{"key":"9423_CR11","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, S. Goldwasser, A. Wigderson, Completeness theorems for non-cryptographic fault-tolerant distributed computation (extended abstract), in 20th ACM STOC (ACM Press, May 1988), pp. 1\u201310","DOI":"10.1145\/62212.62213"},{"key":"9423_CR12","doi-asserted-by":"crossref","unstructured":"A. Becker, A. Joux, A. May, A. Meurer, Decoding random binary linear codes in $$2^{n\/20}$$: how $$1 + 1 = 0$$ improves information set decoding, in D. Pointcheval, T. Johansson editors, EUROCRYPT 2012. LNCS, vol. 7237 (Springer, Heidelberg, April 2012), pp. 520\u2013536.","DOI":"10.1007\/978-3-642-29011-4_31"},{"key":"9423_CR13","doi-asserted-by":"crossref","unstructured":"D.J. Bernstein, T. Lange, R. Niederhagen, C. Peters, P. Schwabe, Fsbday, in INDOCRYPT (2009), pp. 18\u201338","DOI":"10.1007\/978-3-642-10628-6_2"},{"key":"9423_CR14","doi-asserted-by":"crossref","unstructured":"A. Ben-Efraim, Y. Lindell, E. Omri, Optimizing semi-honest secure multiparty computation for the internet, in E.R. Weippl, S. Katzenbeisser, C. Kruegel, A.C. Myers, S. Halevi, editors ACM CCS 2016 (ACM Press, October 2016), pp. 578\u2013590","DOI":"10.1145\/2976749.2978347"},{"key":"9423_CR15","doi-asserted-by":"crossref","unstructured":"A. Ben-Efraim, Y. Lindell, E. Omri, Efficient scalable constant-round MPC via garbled circuits, in ASIACRYPT (2017)","DOI":"10.1007\/978-3-319-70697-9_17"},{"key":"9423_CR16","unstructured":"D.J. Bernstein, T. Lange, C. Peters, Attacking and defending the McEliece cryptosystem, Cryptol. ePrint Arch. Rep. 2008\/318. http:\/\/eprint.iacr.org\/2008\/318 (2008)"},{"key":"9423_CR17","doi-asserted-by":"crossref","unstructured":"D.J. Bernstein, T. Lange, C. Peters, Smaller decoding exponents: ball-collision decoding, in P. Rogaway, editor CRYPTO 2011. LNCS, vol. 6841 (Springer, Heidelberg, August 2011), pp. 743\u2013760","DOI":"10.1007\/978-3-642-22792-9_42"},{"key":"9423_CR18","doi-asserted-by":"crossref","unstructured":"M. Bellare, D. Micciancio, A new paradigm for collision-free hashing: incrementality at reduced cost, in W. Fumy, editor EUROCRYPT\u201997. LNCS, vol. 1233 (Springer, Heidelberg, May 1997), pp. 163\u2013192","DOI":"10.1007\/3-540-69053-0_13"},{"key":"9423_CR19","first-page":"1139","volume":"2017","author":"L Both","year":"2017","unstructured":"L. Both, A. May, Decoding linear codes with high error rate and its impact for LPN security. IACR Cryptol. ePrint Arch. 2017, 1139 (2017)","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"9423_CR20","doi-asserted-by":"crossref","unstructured":"D. Beaver, S. Micali, P. Rogaway, The round complexity of secure protocols (extended abstract), in 22nd ACM STOC (ACM Press, May 1990), pp. 503\u2013513.","DOI":"10.1145\/100216.100287"},{"key":"9423_CR21","doi-asserted-by":"crossref","unstructured":"E.R. Berlekamp, R.J. McEliece, H.C.A. van Tilborg, On the inherent intractability of certain coding problems (corresp.). IEEE Trans. Inf. Theory 24(3), 384\u2013386 (1978)","DOI":"10.1109\/TIT.1978.1055873"},{"key":"9423_CR22","unstructured":"A. Ben-Efraim, E. Omri, Concrete efficiency improvements for multiparty garbling with an honest majority, in Latincrypt 2017 (2017)"},{"key":"9423_CR23","doi-asserted-by":"crossref","unstructured":"G. Bracha, An $$O(\\text{log}\\,n)$$ expected rounds randomized byzantine generals protocol, in 17th ACM STOC (ACM Press, May 1985), pp. 316\u2013326","DOI":"10.1145\/22145.22180"},{"key":"9423_CR24","doi-asserted-by":"crossref","unstructured":"R. Canetti, Universally composable security: a new paradigm for cryptographic protocols, in 42nd FOCS (IEEE Computer Society Press, October 2001), pp. 136\u2013145","DOI":"10.1109\/SFCS.2001.959888"},{"key":"9423_CR25","doi-asserted-by":"crossref","unstructured":"G.C. Clark, J.B. Cain, Error-correction Coding for Digital Communications (Perseus Publishing, 1981)","DOI":"10.1007\/978-1-4899-2174-1"},{"issue":"1","key":"9423_CR26","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1109\/18.651067","volume":"44","author":"A Canteaut","year":"1998","unstructured":"A. Canteaut, F. Chabaud, A new algorithm for finding minimum-weight words in a linear code: application to McEliece\u2019s cryptosystem and to narrow-sense BCH codes of length 511. IEEE Trans. Inf. Theory 44(1), 367\u2013378 (1998)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9423_CR27","doi-asserted-by":"crossref","unstructured":"D. Chaum, C. Cr\u00e9peau, I. Damg\u00e5rd, Multiparty unconditionally secure protocols (extended abstract), in 20th ACM STOC (ACM Press, May 1988), pp. 11\u201319","DOI":"10.1145\/62212.62214"},{"key":"9423_CR28","doi-asserted-by":"crossref","unstructured":"R. Canetti, A. Cohen, Y. Lindell, A simpler variant of universally composable security for standard multiparty computation, in R. Gennaro, M.J.B. Robshaw editors, CRYPTO 2015, Part II. LNCS, vol. 9216 (Springer, Heidelberg, August 2015), pp. 3\u201322","DOI":"10.1007\/978-3-662-48000-7_1"},{"key":"9423_CR29","first-page":"13","volume":"2004","author":"J-S Coron","year":"2004","unstructured":"J.-S. Coron, A. Joux, Cryptanalysis of a provably secure cryptographic hash function. IACR Cryptol. ePrint Arch. 2004, 13 (2004)","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"9423_CR30","doi-asserted-by":"crossref","unstructured":"A. Canteaut, N. Sendrier, Cryptanalysis of the original McEliece cryptosystem. in K. Ohta, D. Pei, editors ASIACRYPT\u201998. LNCS, vol. 1514 (Springer, Heidelberg, October 1998), pp. 187\u2013199","DOI":"10.1007\/3-540-49649-1_16"},{"key":"9423_CR31","doi-asserted-by":"crossref","unstructured":"G. Dessouky, F. Koushanfar, A.-R. Sadeghi, T. Schneider, S. Zeitouni, M. Zohner, Pushing the communication barrier in secure computation using lookup tables, in NDSS (2017)","DOI":"10.14722\/ndss.2017.23097"},{"key":"9423_CR32","doi-asserted-by":"crossref","unstructured":"R. Dingledine, N. Mathewson, P.F. Syverson, Tor: The second-generation onion router, in USENIX (2004), pp. 303\u2013320","DOI":"10.21236\/ADA465464"},{"key":"9423_CR33","doi-asserted-by":"crossref","unstructured":"I. Damg\u00e5rd, J.B. Nielsen, Scalable and unconditionally secure multiparty computation, in A. Menezes editor, CRYPTO 2007. LNCS, vol. 4622 (Springer, Heidelberg, 2007), pp. 572\u2013590","DOI":"10.1007\/978-3-540-74143-5_32"},{"key":"9423_CR34","unstructured":"I. Dumer, On minimum distance decoding of linear codes, in 5th Joint Soviet-Swedish International Workshop Information Theory, Proceedings (1991), pp. 50\u201352"},{"key":"9423_CR35","doi-asserted-by":"crossref","unstructured":"T.K. Frederiksen, M. Keller, E. Orsini, P. Scholl, A unified approach to MPC with preprocessing using OT, in T. Iwata, J.H. Cheon editors, ASIACRYPT 2015, Part I. LNCS, vol. 9452 (Springer, Heidelberg, November\/December 2015), pp. 711\u2013735","DOI":"10.1007\/978-3-662-48797-6_29"},{"key":"9423_CR36","doi-asserted-by":"crossref","unstructured":"M. Finiasz, N. Sendrier, Security bounds for the design of code-based cryptosystems, in M. Matsui editor, ASIACRYPT 2009. LNCS, vol. 5912 (Springer, Heidelberg, December 2009), pp. 88\u2013105","DOI":"10.1007\/978-3-642-10366-7_6"},{"key":"9423_CR37","doi-asserted-by":"crossref","unstructured":"C. Gentry, Fully homomorphic encryption using ideal lattices, in M. Mitzenmacher editor, 41st ACM STOC (ACM Press, May\/June 2009), pp. 169\u2013178","DOI":"10.1145\/1536414.1536440"},{"key":"9423_CR38","doi-asserted-by":"crossref","unstructured":"O. Goldreich, L.A. Levin, A hard-core predicate for all one-way functions, in 21st ACM STOC (ACM Press, May 1989), pp. 25\u201332","DOI":"10.1145\/73007.73010"},{"key":"9423_CR39","doi-asserted-by":"crossref","unstructured":"O. Goldreich, S. Micali, A. Wigderson, How to play any mental game or A completeness theorem for protocols with honest majority, in A. Aho editor, 19th ACM STOC (ACM Press, May 1987), pp. 218\u2013229","DOI":"10.1145\/28395.28420"},{"key":"9423_CR40","doi-asserted-by":"crossref","unstructured":"O. Goldreich, The Foundations of Cryptography: Volume 2, Basic Applications (Cambridge University Press, 2004)","DOI":"10.1017\/CBO9780511721656"},{"key":"9423_CR41","doi-asserted-by":"crossref","unstructured":"N. Howgrave-Graham, A. Joux, New generic algorithms for hard knapsacks, in EUROCRYPT (2010), pp. 235\u2013256","DOI":"10.1007\/978-3-642-13190-5_12"},{"key":"9423_CR42","doi-asserted-by":"crossref","unstructured":"C. Hazay, E. Orsini, P. Scholl, E. Soria-Vazquez, Concretely efficient large-scale MPC with active security (or, TinyKeys for TinyOT), in T. Peyrin, S. Galbraith editors, ASIACRYPT 2018, Part III. LNCS, vol. 11274 (Springer, Heidelberg, December 2018), pp. 86\u2013117","DOI":"10.1007\/978-3-030-03332-3_4"},{"key":"9423_CR43","doi-asserted-by":"crossref","unstructured":"C. Hazay, E. Orsini, P. Scholl, E. Soria-Vazquez, TinyKeys: A new approach to efficient multi-party computation, in H. Shacham, A. Boldyreva editors, CRYPTO 2018, Part III. LNCS, vol. 10993 (Springer, Heidelberg, August 2018), pp. 3\u201333","DOI":"10.1007\/978-3-319-96878-0_1"},{"key":"9423_CR44","first-page":"162","volume":"2013","author":"Y Hamdaoui","year":"2013","unstructured":"Y. Hamdaoui, N. Sendrier, A non asymptotic analysis of information set decoding. IACR Cryptol. ePrint Arch. 2013, 162 (2013)","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"9423_CR45","doi-asserted-by":"crossref","unstructured":"C. Hazay, P. Scholl, E. Soria-Vazquez, Low cost constant round MPC combining BMR and oblivious transfer. J. Cryptol. (2020)","DOI":"10.1007\/s00145-020-09355-y"},{"key":"9423_CR46","doi-asserted-by":"crossref","unstructured":"Y. Ishai, J. Kilian, K. Nissim, E. Petrank, Extending oblivious transfers efficiently, in D. Boneh editor, CRYPTO 2003. LNCS, vol. 2729 (Springer, Heidelberg, August 2003), pp. 145\u2013161","DOI":"10.1007\/978-3-540-45146-4_9"},{"key":"9423_CR47","doi-asserted-by":"crossref","unstructured":"R. Impagliazzo, L.A. Levin, M. Luby, Pseudo-random generation from one-way functions (extended abstracts), in 21st ACM STOC (ACM Press, May 1989), pp. 12\u201324","DOI":"10.1145\/73007.73009"},{"key":"9423_CR48","first-page":"377","volume":"2011","author":"P Kirchner","year":"2011","unstructured":"P. Kirchner, Improved generalized birthday attack. IACR Cryptol. ePrint Arch. 2011, 377 (2011)","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"9423_CR49","doi-asserted-by":"crossref","unstructured":"V. Kolesnikov, R. Kumaresan, Improved OT extension for transferring short secrets, in R. Canetti, J.A. Garay editors, CRYPTO 2013, Part II. LNCS, vol. 8043 (Springer, Heidelberg, August 2013), pp. 54\u201370","DOI":"10.1007\/978-3-642-40084-1_4"},{"key":"9423_CR50","doi-asserted-by":"crossref","unstructured":"V. Kolesnikov, P. Mohassel, M. Rosulek, FleXOR: Flexible garbling for XOR gates that beats free-XOR, in J.A. Garay, R. Gennaro editors, CRYPTO 2014, Part II. LNCS, vol. 8617 (Springer, Heidelberg, August 2014), pp. 440\u2013457","DOI":"10.1007\/978-3-662-44381-1_25"},{"key":"9423_CR51","unstructured":"V. Kolesnikov, T. Schneider, Improved garbled circuit: free XOR gates and applications, in L. Aceto, I. Damg\u00e5rd, L.A. Goldberg, M.M. Halld\u00f3rsson, A. Ing\u00f3lfsd\u00f3ttir, I. Walukiewicz editors, ICALP 2008, Part II. LNCS, vol. 5126 (Springer, Heidelberg, July 2008), pp. 486\u2013498"},{"key":"9423_CR52","doi-asserted-by":"crossref","unstructured":"P.J. Lee, E.F. Brickell, An observation on the security of McEliece\u2019s public-key cryptosystem, in EUROCRYPT (1988), pp. 275\u2013280","DOI":"10.1007\/3-540-45961-8_25"},{"issue":"5","key":"9423_CR53","doi-asserted-by":"publisher","first-page":"1354","DOI":"10.1109\/18.21270","volume":"34","author":"JS Leon","year":"1988","unstructured":"J.S. Leon, A probabilistic algorithm for computing minimum weights of large error-correcting codes. IEEE Trans. Inf. Theory 34(5), 1354\u20131359 (1988)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9423_CR54","doi-asserted-by":"crossref","unstructured":"Y. Lindell, B. Pinkas, N.P. Smart, A. Yanai, Efficient constant round multi-party computation combining BMR and SPDZ, in R. Gennaro, M.J.B. Robshaw editors, CRYPTO 2015, Part\u00a0II. LNCS, vol. 9216 (Springer, Heidelberg, August 2015), pp. 319\u2013338","DOI":"10.1007\/978-3-662-48000-7_16"},{"key":"9423_CR55","doi-asserted-by":"crossref","unstructured":"Y. Lindell, N.P. Smart, E. Soria-Vazquez, More efficient constant-round multi-party computation from BMR and SHE, in M. Hirt, A.D. Smith editors, TCC\u00a02016-B, Part\u00a0I. LNCS, vol. 9985 (Springer, Heidelberg, October\/November 2016), pp. 554\u2013581","DOI":"10.1007\/978-3-662-53641-4_21"},{"key":"9423_CR56","doi-asserted-by":"crossref","unstructured":"A. May, A. Meurer, E. Thomae, Decoding random linear codes in $${\\tilde{\\cal{O}}}(2^{0.0 54n})$$, in ASIACRYPT (2011), pp. 107\u2013124","DOI":"10.1007\/978-3-642-25385-0_6"},{"key":"9423_CR57","doi-asserted-by":"crossref","unstructured":"A. May, I. Ozerov, On computing nearest neighbors with applications to decoding of binary linear codes, in EUROCRYPT (2015), pp. 203\u2013228","DOI":"10.1007\/978-3-662-46800-5_9"},{"key":"9423_CR58","volume-title":"The Theory of Error Correcting Codes","author":"FJ MacWilliams","year":"1977","unstructured":"F.J. MacWilliams, N.J.A. Sloane, The Theory of Error Correcting Codes (North Holland, LL 1977)"},{"key":"9423_CR59","doi-asserted-by":"crossref","unstructured":"L. Minder, A. Sinclair, The extended k-tree algorithm, in C. Mathieu editor, 20th SODA (ACM-SIAM, January 2009), pp. 586\u2013595","DOI":"10.1137\/1.9781611973068.65"},{"key":"9423_CR60","unstructured":"R. Niebuhr, P.-L. Cayrel, J. Buchmann, Improving the efficiency of Generalized Birthday Attacks against certain structured cryptosystems, in WCC (Paris, France, 2011), pp. 163\u2013172"},{"key":"9423_CR61","doi-asserted-by":"crossref","unstructured":"J.B. Nielsen, P.S. Nordholt, C. Orlandi, S.S. Burra, A new approach to practical active-secure two-party computation, in R. Safavi-Naini, R. Canetti editors, CRYPTO 2012. LNCS, vol. 7417 (Springer, Heidelberg, August 2012), pp. 681\u2013700","DOI":"10.1007\/978-3-642-32009-5_40"},{"key":"9423_CR62","doi-asserted-by":"crossref","unstructured":"J.B. Nielsen, S. Ranellucci, On the computational overhead of MPC with dishonest majority, in S. Fehr editor, PKC\u00a02017, Part\u00a0II. LNCS, vol. 10175 (Springer, Heidelberg, 2017), pp. 369\u2013395","DOI":"10.1007\/978-3-662-54388-7_13"},{"key":"9423_CR63","doi-asserted-by":"crossref","unstructured":"K. Pietrzak, Subspace LWE, in R. Cramer editor, TCC 2012. LNCS, vol. 7194 (Springer, Heidelberg, March 2012), pp. 548\u2013563","DOI":"10.1007\/978-3-642-28914-9_31"},{"issue":"5","key":"9423_CR64","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1109\/TIT.1962.1057777","volume":"8","author":"E Prange","year":"1962","unstructured":"E. Prange. The use of information sets in decoding cyclic codes. IRE Trans. Inf. Theory 8(5), 5\u20139 (1962)","journal-title":"IRE Trans. Inf. Theory"},{"key":"9423_CR65","doi-asserted-by":"crossref","unstructured":"M.-J.O. Saarinen, Linearization attacks against syndrome based hashes, in K. Srinathan, C.P. Rangan, M. Yung editors, INDOCRYPT\u00a02007. LNCS, vol. 4859 (Springer, Heidelberg, December 2007), pp. 1\u20139","DOI":"10.1007\/978-3-540-77026-8_1"},{"key":"9423_CR66","unstructured":"N. Sendrier, Decoding one out of many. Cryptol. ePrint Arch. Report 2011\/367 (2011). http:\/\/eprint.iacr.org\/2011\/367"},{"key":"9423_CR67","doi-asserted-by":"crossref","unstructured":"J. Stern, A method for finding codewords of small weight, in Coding Theory and Applications (1988), pp. 106\u2013113","DOI":"10.1007\/BFb0019850"},{"key":"9423_CR68","doi-asserted-by":"crossref","unstructured":"R.C. Torres, N. Sendrier, Analysis of information set decoding for a sub-linear error weight, in PQCrypto (2016), pp. 144\u2013161","DOI":"10.1007\/978-3-319-29360-8_10"},{"key":"9423_CR69","unstructured":"S.R. Tate, K. Xu, On Garbled Circuits and Constant Round Secure Function Evaluation (CoPS Lab, University of North Texas, Tech. Rep, 2:2003, 2003)"},{"key":"9423_CR70","doi-asserted-by":"crossref","unstructured":"J. van Tilburg, On the McEliece public-key cryptosystem, in CRYPTO (1988), pp. 119\u2013131","DOI":"10.1007\/0-387-34799-2_10"},{"key":"9423_CR71","doi-asserted-by":"crossref","unstructured":"D. Wagner, A generalized birthday problem, in M. Yung editor, CRYPTO 2002, LNCS, vol. 2442 (Springer, Heidelberg, August 2002), pp. 288\u2013303","DOI":"10.1007\/3-540-45708-9_19"},{"key":"9423_CR72","doi-asserted-by":"crossref","unstructured":"X. Wang, S. Ranellucci, J. Katz, Global-scale secure multiparty computation, in B.M. Thuraisingham, D. Evans, T. Malkin, D. Xu editors, ACM CCS 2017 (ACM Press, October\/November 2017), pp. 39\u201356","DOI":"10.1145\/3133956.3133979"},{"key":"9423_CR73","unstructured":"A.C.-C. Yao, How to generate and exchange secrets (extended abstract), in 27th FOCS (IEEE Computer Society Press, October 1986), pp. 162\u2013167"},{"key":"9423_CR74","doi-asserted-by":"crossref","unstructured":"K. Yang, X. Wang, J. Zhang. More efficient MPC from improved triple generation and authenticated garbling, in J. Ligatti, X. Ou, J. Katz, G. Vigna editors, ACM CCS 2020 (ACM Press, November 2020), pp. 1627\u20131646","DOI":"10.1145\/3372297.3417285"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-022-09423-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00145-022-09423-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-022-09423-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,31]],"date-time":"2023-01-31T22:12:08Z","timestamp":1675203128000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00145-022-09423-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4]]},"references-count":74,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,4]]}},"alternative-id":["9423"],"URL":"https:\/\/doi.org\/10.1007\/s00145-022-09423-5","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,4]]},"assertion":[{"value":"26 April 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 February 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 February 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 April 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"13"}}