{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,11]],"date-time":"2026-01-11T01:55:01Z","timestamp":1768096501124,"version":"3.49.0"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,2,28]],"date-time":"2015-02-28T00:00:00Z","timestamp":1425081600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Cryptol"],"published-print":{"date-parts":[[2016,4]]},"DOI":"10.1007\/s00145-015-9198-0","type":"journal-article","created":{"date-parts":[[2015,2,27]],"date-time":"2015-02-27T20:45:00Z","timestamp":1425069900000},"page":"456-490","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":56,"title":["Fast Cut-and-Choose-Based Protocols for Malicious and Covert Adversaries"],"prefix":"10.1007","volume":"29","author":[{"given":"Yehuda","family":"Lindell","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,2,28]]},"reference":[{"issue":"2","key":"9198_CR1","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/s00145-009-9040-7","volume":"23","author":"Y Aumann","year":"2010","unstructured":"Y. Aumann, Y. Lindell, Security against covert adversaries: efficient protocols for realistic adversaries. J. Cryptol. 23(2), 281\u2013343 (2010).","journal-title":"J. Cryptol."},{"key":"9198_CR2","doi-asserted-by":"crossref","unstructured":"D. Beaver, Foundations of secure interactive computing, in CRYPTO\u201991. LNCS 576 (Springer, 1991), pp. 377\u2013391.","DOI":"10.1007\/3-540-46766-1_31"},{"key":"9198_CR3","doi-asserted-by":"crossref","unstructured":"R. Bendlin, I. Damg\u00e5rd, C. Orlandi, S. Zakarias, Semi-homomorphic encryption and multiparty computation, in EUROCRYPT 2011. LNCS 6632 (Springer, 2011), pp. 169\u2013188.","DOI":"10.1007\/978-3-642-20465-4_11"},{"issue":"1","key":"9198_CR4","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s001459910006","volume":"13","author":"R Canetti","year":"2000","unstructured":"R. Canetti, Security and composition of multiparty cryptographic protocols. J. Cryptol. 13(1), 143\u2013202 (2000).","journal-title":"J. Cryptol."},{"key":"9198_CR5","unstructured":"R. Canetti, Universally composable security: a new paradigm for cryptographic protocols, in \n                    \n                      \n                    \n                    $$42$$\n                    \n                      \n                        \n                          42\n                        \n                      \n                    \n                   nd FOCS (2001), pp. 136\u2013145. Full version available at \n                    http:\/\/eprint.iacr.org\/2000\/067"},{"key":"9198_CR6","doi-asserted-by":"crossref","unstructured":"I. Damg\u00e5rd, C. Orlandi, Multiparty computation for dishonest majority: from passive to active security at low cost, in CRYPTO 2010. LNCS 6223 (Springer, 2010), pp. 558\u2013576.","DOI":"10.1007\/978-3-642-14623-7_30"},{"key":"9198_CR7","doi-asserted-by":"crossref","unstructured":"I. Damg\u00e5rd, V. Pastro, N.P. Smart, S. Zakarias, Multiparty computation from somewhat homomorphic encryption, in CRYPTO 2012. Springer (LNCS 7417, 2012), pp. 643\u2013662.","DOI":"10.1007\/978-3-642-32009-5_38"},{"key":"9198_CR8","doi-asserted-by":"crossref","unstructured":"Y. Dodis, R. Gennaro, J. Hastad, H. Krawczyk, T. Rabin, Randomness extraction and key derivation using the CBC, cascade and HMAC modes, in CRYPTO 2004. LNCS 3152 (Springer, 2004), pp. 494\u2013510.","DOI":"10.1007\/978-3-540-28628-8_30"},{"issue":"5","key":"9198_CR9","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1145\/229459.229469","volume":"39","author":"R Fagin","year":"1996","unstructured":"R. Fagin, M. Naor, P. Winkler, Comparing information without leaking it. Commun. ACM 39(5), 77\u201385 (1996).","journal-title":"Commun. ACM"},{"key":"9198_CR10","doi-asserted-by":"crossref","unstructured":"T.K. Frederiksen, J.B. Nielsen, Fast and maliciously secure two-party computation using the GPU. Cryptology ePrint Archive: Report 2013\/046 (2013).","DOI":"10.1007\/978-3-642-38980-1_21"},{"key":"9198_CR11","doi-asserted-by":"crossref","unstructured":"S. Goldwasser, L. Levin, Fair computation of general functions in presence of immoral majority, in CRYPTO\u201990. LNCS 537 (Springer, 1990), pp. 77\u201393.","DOI":"10.1007\/3-540-38424-3_6"},{"key":"9198_CR12","unstructured":"O. Goldreich, Foundations of Cryptography: Vol. 2: Basic Applications (Cambridge University Press, Cambridge, 2004)."},{"key":"9198_CR13","unstructured":"O. Goldreich, S. Micali, A. Wigderson, How to play any mental game\u2013a completeness theorem for protocols with honest majority, in \n                    \n                      \n                    \n                    $$19$$\n                    \n                      \n                        \n                          19\n                        \n                      \n                    \n                   th STOC (1987), pp. 218\u2013229."},{"key":"9198_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14303-8","volume-title":"Efficient Secure Two-Party Protocols: Techniques and Constructions","author":"C Hazay","year":"2010","unstructured":"C. Hazay, Y. Lindell, Efficient Secure Two-Party Protocols: Techniques and Constructions (Springer, Berlin, 2010)."},{"key":"9198_CR15","doi-asserted-by":"crossref","unstructured":"Y. Huang, J. Katz, D. Evans, Efficient secure two-party computation using symmetric cut-and-choose, in CRYPTO 2013. LNCS 8043, vol. 2 (Springer, 2013), pp. 1\u201317.","DOI":"10.1007\/978-3-642-40084-1_2"},{"key":"9198_CR16","doi-asserted-by":"crossref","unstructured":"Y. Ishai, J. Kilian, K. Nissim, E. Petrank, Extending oblivious transfer efficiently, in CRYPTO 2003. LNCS 2729 (Springer, 2003), pp. 145\u2013161.","DOI":"10.1007\/978-3-540-45146-4_9"},{"key":"9198_CR17","doi-asserted-by":"crossref","unstructured":"Y. Ishai, M. Prabhakaran, A. Sahai, Founding cryptography on oblivious transfer\u2013efficiently, in CRYPTO 2008. LNCS 5157 (Springer, 2008), pp. 572\u2013591.","DOI":"10.1007\/978-3-540-85174-5_32"},{"key":"9198_CR18","doi-asserted-by":"crossref","unstructured":"Y. Ishai, M. Prabhakaran, A. Sahai, Secure Arithmetic computation with no honest majority, in TCC 2009. LNCS 5444 (Springer, 2009), pp. 294\u2013314.","DOI":"10.1007\/978-3-642-00457-5_18"},{"key":"9198_CR19","doi-asserted-by":"crossref","unstructured":"S. Jarecki, V. Shmatikov. Efficient two-party secure computation on committed inputs, in EUROCRYPT 2007. LNCS 4515 (Springer, 2007), pp. 97\u2013114.","DOI":"10.1007\/978-3-540-72540-4_6"},{"key":"9198_CR20","unstructured":"B. Kreuter, A. Shelat, C. Shen, Billion-gate secure computation with malicious adversaries, in The \n                    \n                      \n                    \n                    $$21$$\n                    \n                      \n                        \n                          21\n                        \n                      \n                    \n                   st USENIX Security Symposium (2012)."},{"key":"9198_CR21","doi-asserted-by":"crossref","unstructured":"Y. Lindell, E. Oxman, B. Pinkas. The IPS compiler: optimizations, variants and concrete efficiency, in CRYPTO 2011. LNCS 6841 (Springer, 2011), pp. 259\u2013276.","DOI":"10.1007\/978-3-642-22792-9_15"},{"issue":"2","key":"9198_CR22","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/s00145-008-9036-8","volume":"22","author":"Y Lindell","year":"2009","unstructured":"Y. Lindell, B. Pinkas, A proof of Yao\u2019s protocol for secure two-party computation. J. Cryptol. 22(2), 161\u2013188 (2009).","journal-title":"J. Cryptol."},{"key":"9198_CR23","doi-asserted-by":"crossref","unstructured":"Y. Lindell, B. Pinkas, An efficient protocol for secure two-party computation in the presence of malicious adversaries. J. Cryptol. (to appear). Extended abstract appeared in EUROCRYPT 2007. LNCS 4515 (Springer, 2007), pp. 52\u201378.","DOI":"10.1007\/978-3-540-72540-4_4"},{"key":"9198_CR24","doi-asserted-by":"crossref","unstructured":"Y.\u00a0Lindell, B.\u00a0Pinkas, Secure two-party computation via cut-and-choose oblivious transfer, in TCC 2011. J. Cryptol. 25(4),LNCS 6597 (Springer, 2011), pp. 329\u2013346","DOI":"10.1007\/978-3-642-19571-6_20"},{"key":"9198_CR25","volume-title":"Handbook of Applied Cryptography","author":"AJ Menezes","year":"2001","unstructured":"A.J. Menezes, P.C. van Oorschot, S.A. Vanstone, Handbook of Applied Cryptography (CRC Press, Boca Raton, 2001)."},{"key":"9198_CR26","unstructured":"S. Micali, P. Rogaway, Secure computation. Unpublished manuscript (1992). Preliminary version in CRYPTO\u201991. LNCS 576 (Springer, 1991), pp. 392\u2013404."},{"key":"9198_CR27","doi-asserted-by":"crossref","unstructured":"P. Mohassel, B. Riva, Garbled circuits checking garbled circuits: more efficient and secure two-party computation, in CRYPTO 2013. LNCS 8043 (Springer, 2013), pp. 36\u201353.","DOI":"10.1007\/978-3-642-40084-1_3"},{"key":"9198_CR28","doi-asserted-by":"crossref","unstructured":"J.B. Nielsen, P.S. Nordholt, C. Orlandi, S. Sheshank Burra, A new approach to practical active-secure two-party computation, in CRYPTO 2012. LNCS 7417 (Springer, 2012), pp. 681\u2013700.","DOI":"10.1007\/978-3-642-32009-5_40"},{"key":"9198_CR29","doi-asserted-by":"crossref","unstructured":"J.B. Nielsen, C. Orlandi, LEGO for two-party secure computation, in TCC 2009. LNCS 5444 (Springer, 2009), pp. 368\u2013386.","DOI":"10.1007\/978-3-642-00457-5_22"},{"key":"9198_CR30","doi-asserted-by":"crossref","unstructured":"B. Schoenmakers, P. Tuyls, Practical two-party computation based on the conditional gate, in ASIACRYPT 2004. LNCS 3329 (Springer, 2004), pp. 119\u2013136.","DOI":"10.1007\/978-3-540-30539-2_10"},{"key":"9198_CR31","doi-asserted-by":"crossref","unstructured":"A. Shelat, C.H. Shen, Two-output secure computation with malicious adversaries, in EUROCRYPT 2011. LNCS 6632 (Springer, 2011), pp. 386\u2013405.","DOI":"10.1007\/978-3-642-20465-4_22"},{"key":"9198_CR32","unstructured":"A. Yao, How to generate and exchange secrets, in \n                    \n                      \n                    \n                    $$27$$\n                    \n                      \n                        \n                          27\n                        \n                      \n                    \n                   th FOCS (1986), pp. 162\u2013167."},{"key":"9198_CR33","unstructured":"Bristol Cryptography Group. Circuits of basic functions suitable for MPC and FHE. \n                    http:\/\/www.cs.bris.ac.uk\/Research\/CryptographySecurity\/MPC\/"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-015-9198-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00145-015-9198-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-015-9198-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-015-9198-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T08:20:43Z","timestamp":1586334043000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00145-015-9198-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,2,28]]},"references-count":33,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,4]]}},"alternative-id":["9198"],"URL":"https:\/\/doi.org\/10.1007\/s00145-015-9198-0","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,2,28]]},"assertion":[{"value":"23 December 2013","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 February 2015","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}