{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,7]],"date-time":"2026-10-07T05:53:34Z","timestamp":1791352414088,"version":"4.3.1"},"publisher-location":"Berlin, Heidelberg","reference-count":35,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642400834","type":"print"},{"value":"9783642400841","type":"electronic"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40084-1_2","type":"book-chapter","created":{"date-parts":[[2013,8,14]],"date-time":"2013-08-14T09:56:37Z","timestamp":1376474197000},"page":"18-35","source":"Crossref","is-referenced-by-count":75,"title":["Efficient Secure Two-Party Computation Using Symmetric Cut-and-Choose"],"prefix":"10.1007","author":[{"given":"Yan","family":"Huang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jonathan","family":"Katz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"David","family":"Evans","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"2","key":"2_CR1","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/s00145-009-9040-7","volume":"23","author":"Y. Aumann","year":"2010","unstructured":"Aumann, Y., Lindell, Y.: Security against covert adversaries: Efficient protocols for realistic adversaries. Journal of Cryptology\u00a023(2), 281\u2013343 (2010)","journal-title":"Journal of Cryptology"},{"key":"2_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/BFb0054130","volume-title":"Advances in Cryptology - EUROCRYPT \u201998","author":"M. Bellare","year":"1998","unstructured":"Bellare, M., Garay, J.A., Rabin, T.: Fast batch verification for modular exponentiation and digital signatures. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol.\u00a01403, pp. 236\u2013250. Springer, Heidelberg (1998)"},{"issue":"1","key":"2_CR3","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s001459910006","volume":"13","author":"R. Canetti","year":"2000","unstructured":"Canetti, R.: Security and composition of multiparty cryptographic protocols. Journal of Cryptology\u00a013(1), 143\u2013202 (2000)","journal-title":"Journal of Cryptology"},{"key":"2_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/978-3-642-32928-9_14","volume-title":"Security and Cryptography for Networks","author":"I. Damg\u00e5rd","year":"2012","unstructured":"Damg\u00e5rd, I., Keller, M., Larraia, E., Miles, C., Smart, N.P.: Implementing AES via an actively\/Covertly secure dishonest-majority MPC protocol. In: Visconti, I., De Prisco, R. (eds.) SCN 2012. LNCS, vol.\u00a07485, pp. 241\u2013263. Springer, Heidelberg (2012)"},{"key":"2_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1007\/978-3-642-32009-5_38","volume-title":"Crypto","author":"I. Damg\u00e5rd","year":"2012","unstructured":"Damg\u00e5rd, I., Pastro, V., Smart, N.P., Zakarias, S.: Multiparty computation from somewhat homomorphic encryption. In: Safavi-Naini, R. (ed.) CRYPTO 2012. LNCS, vol.\u00a07417, pp. 643\u2013662. Springer, Heidelberg (2012)"},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"Feldman, P.: A practical scheme for non-interactive verifiable secret sharing. In: 28th Annual Symposium on Foundations of Computer Science (FOCS), pp. 427\u2013437. IEEE (1987)","DOI":"10.1109\/SFCS.1987.4"},{"key":"2_CR7","series-title":"Basic Applications","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511721656","volume-title":"Foundations of Cryptography","author":"O. Goldreich","year":"2004","unstructured":"Goldreich, O.: Foundations of Cryptography. Basic Applications, vol.\u00a02. Cambridge University Press, Cambridge (2004)"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game, or a completeness theorem for protocols with honest majority. In: 19th Annual ACM Symposium on Theory of Computing (STOC), pp. 218\u2013229. ACM Press (1987)","DOI":"10.1145\/28395.28420"},{"key":"2_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/978-3-540-78967-3_17","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"V. Goyal","year":"2008","unstructured":"Goyal, V., Mohassel, P., Smith, A.: Efficient two party and multi party computation against covert adversaries. In: Smart, N.P. (ed.) EUROCRYPT 2008. LNCS, vol.\u00a04965, pp. 289\u2013306. Springer, Heidelberg (2008)"},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"Henecka, W., K\u00f6gl, S., Sadeghi, A.-R., Schneider, T., Wehrenberg, I.: TASTY: tool for automating secure two-party computations. In: 17th ACM Conf. on Computer and Communications Security (CCS), pp. 451\u2013462. ACM Press (2010)","DOI":"10.1145\/1866307.1866358"},{"key":"2_CR11","unstructured":"Huang, Y., Evans, D., Katz, J.: Private set intersection: Are garbled circuits better than custom protocols? In: Network and Distributed System Security Symposium (NDSS). The Internet Society (2012)"},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"Huang, Y., Evans, D., Katz, J., Malka, L.: Faster secure two-party computation using garbled circuits. In: 20th USENIX Security Symposium. USENIX Association (2011)","DOI":"10.1007\/978-3-642-25560-1_2"},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"Huang, Y., Katz, J., Evans, D.: Quid pro quo-tocols: Strengthening semi-honest protocols with dual execution. In: IEEE Symposium on Security & Privacy, pp. 239\u2013254. IEEE (2012)","DOI":"10.1109\/SP.2012.43"},{"key":"2_CR14","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.\u00a05157, pp. 572\u2013591. Springer, Heidelberg (2008)"},{"key":"2_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/978-3-540-72540-4_6","volume-title":"Advances in Cryptology - EUROCRYPT 2007","author":"S. Jarecki","year":"2007","unstructured":"Jarecki, S., Shmatikov, V.: Efficient two-party secure computation on committed inputs. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol.\u00a04515, pp. 97\u2013114. Springer, Heidelberg (2007)"},{"key":"2_CR16","unstructured":"Kiraz, M., Schoenmakers, B.: A protocol issue for the malicious case of yao\u2019s garbled-circuit construction. In: Proc. 27th Symp. on Information Theory in the Benelux, pp. 283\u2013290 (2006)"},{"key":"2_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1007\/978-3-540-70583-3_40","volume-title":"Automata, Languages and Programming","author":"V. Kolesnikov","year":"2008","unstructured":"Kolesnikov, V., Schneider, T.: Improved garbled circuit: Free XOR gates and applications. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part II. LNCS, vol.\u00a05126, pp. 486\u2013498. Springer, Heidelberg (2008)"},{"key":"2_CR18","unstructured":"Kreuter, B., Shelat, A., Shen, C.: Billion-gate secure computation with malicious adversaries. In: 21st USENIX Security Symposium. USENIX Association (2012)"},{"key":"2_CR19","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-40084-1_1","volume-title":"CRYPTO 2013","author":"Y. Lindell","year":"2013","unstructured":"Lindell, Y.: Fast cut-and-choose based protocols for malicious and covert adversaries. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013, Part II. LNCS, vol.\u00a08043, pp. 1\u201317. Springer, Heidelberg (2013)"},{"key":"2_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/978-3-642-22792-9_15","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"Y. Lindell","year":"2011","unstructured":"Lindell, Y., Oxman, E., Pinkas, B.: The IPS compiler: Optimizations, variants and concrete efficiency. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol.\u00a06841, pp. 259\u2013276. Springer, Heidelberg (2011)"},{"key":"2_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/978-3-540-72540-4_4","volume-title":"Advances in Cryptology - EUROCRYPT 2007","author":"Y. Lindell","year":"2007","unstructured":"Lindell, Y., Pinkas, B.: An efficient protocol for secure two-party computation in the presence of malicious adversaries. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol.\u00a04515, pp. 52\u201378. Springer, Heidelberg (2007)"},{"issue":"2","key":"2_CR22","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/s00145-008-9036-8","volume":"22","author":"Y. Lindell","year":"2009","unstructured":"Lindell, Y., Pinkas, B.: A proof of security of Yao\u2019s protocol for two-party computation. Journal of Cryptology\u00a022(2), 161\u2013188 (2009)","journal-title":"Journal of Cryptology"},{"issue":"4","key":"2_CR23","doi-asserted-by":"publisher","first-page":"680","DOI":"10.1007\/s00145-011-9107-0","volume":"25","author":"Y. Lindell","year":"2012","unstructured":"Lindell, Y., Pinkas, B.: Secure two-party computation via cut-and-choose oblivious transfer. Journal of Cryptology\u00a025(4), 680\u2013722 (2012)","journal-title":"Journal of Cryptology"},{"key":"2_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/978-3-540-85855-3_2","volume-title":"Security and Cryptography for Networks","author":"Y. Lindell","year":"2008","unstructured":"Lindell, Y., Pinkas, B., Smart, N.P.: Implementing two-party computation efficiently with security against malicious adversaries. In: Ostrovsky, R., De Prisco, R., Visconti, I. (eds.) SCN 2008. LNCS, vol.\u00a05229, pp. 2\u201320. Springer, Heidelberg (2008)"},{"key":"2_CR25","unstructured":"Malkhi, D., Nisan, N., Pinkas, B., Sella, Y.: Fairplay \u2014 a secure two-party computation system. In: Proc. 13th USENIX Security Symposium, pp. 287\u2013302. USENIX Association (2004)"},{"key":"2_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1007\/11745853_30","volume-title":"Public Key Cryptography - PKC 2006","author":"P. Mohassel","year":"2006","unstructured":"Mohassel, P., Franklin, M.: Efficiency tradeoffs for malicious two-party computation. In: Yung, M., Dodis, Y., Kiayias, A., Malkin, T. (eds.) PKC 2006. LNCS, vol.\u00a03958, pp. 458\u2013473. Springer, Heidelberg (2006)"},{"key":"2_CR27","unstructured":"Naor, M., Pinkas, B.: Efficient oblivious transfer protocols. In: 12th SODA Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 448\u2013457. ACM-SIAM (2001)"},{"key":"2_CR28","doi-asserted-by":"crossref","unstructured":"Naor, M., Pinkas, B., Sumner, R.: Privacy preserving auctions and mechanism design. In: Proc. 1st ACM Conf. on Electronic Commerce, pp. 129\u2013139. ACM (1999)","DOI":"10.1145\/336992.337028"},{"key":"2_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1007\/978-3-642-32009-5_40","volume-title":"CRYPTO 2012","author":"J.B. Nielsen","year":"2012","unstructured":"Nielsen, J.B., Nordholt, P.S., Orlandi, C., Burra, S.S.: A new approach to practical active-secure two-party computation. In: Safavi-Naini, R. (ed.) CRYPTO 2012. LNCS, vol.\u00a07417, pp. 681\u2013700. Springer, Heidelberg (2012)"},{"key":"2_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1007\/978-3-642-00457-5_22","volume-title":"Theory of Cryptography","author":"J.B. Nielsen","year":"2009","unstructured":"Nielsen, J.B., Orlandi, C.: LEGO for two-party secure computation. In: Reingold, O. (ed.) TCC 2009. LNCS, vol.\u00a05444, pp. 368\u2013386. Springer, Heidelberg (2009)"},{"key":"2_CR31","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.\u00a05157, pp. 554\u2013571. Springer, Heidelberg (2008)"},{"key":"2_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/978-3-642-10366-7_15","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2009","author":"B. Pinkas","year":"2009","unstructured":"Pinkas, B., Schneider, T., Smart, N., Williams, S.: Secure two-party computation is practical. In: Matsui, M. (ed.) ASIACRYPT 2009. LNCS, vol.\u00a05912, pp. 250\u2013267. Springer, Heidelberg (2009)"},{"key":"2_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1007\/978-3-642-20465-4_22","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2011","author":"A. Shelat","year":"2011","unstructured":"Shelat, A., Shen, C.-H.: Two-output secure computation with malicious adversaries. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol.\u00a06632, pp. 386\u2013405. Springer, Heidelberg (2011)"},{"key":"2_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/978-3-540-72540-4_5","volume-title":"Advances in Cryptology - EUROCRYPT 2007","author":"D.P. Woodruff","year":"2007","unstructured":"Woodruff, D.P.: Revisiting the efficiency of malicious two-party computation. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol.\u00a04515, pp. 79\u201396. Springer, Heidelberg (2007)"},{"key":"2_CR35","doi-asserted-by":"crossref","unstructured":"Yao, A.C.-C.: How to generate and exchange secrets. In: 27th Annual Symposium on Foundations of Computer Science (FOCS), pp. 162\u2013167. IEEE (1986)","DOI":"10.1109\/SFCS.1986.25"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2013"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40084-1_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T15:33:56Z","timestamp":1558020836000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40084-1_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642400834","9783642400841"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40084-1_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}