{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T08:42:48Z","timestamp":1774946568684,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":53,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642420443","type":"print"},{"value":"9783642420450","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-42045-0_23","type":"book-chapter","created":{"date-parts":[[2013,11,23]],"date-time":"2013-11-23T08:53:33Z","timestamp":1385196813000},"page":"441-463","source":"Crossref","is-referenced-by-count":24,"title":["Secure Two-Party Computation with Reusable Bit-Commitments, via a Cut-and-Choose with Forge-and-Lose Technique"],"prefix":"10.1007","author":[{"given":"Lu\u00eds T. A. N.","family":"Brand\u00e3o","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"23_CR1","doi-asserted-by":"crossref","unstructured":"Barker, E., Barker, W., Burr, W., Polk, W., Smid, M.: Recommendation for Key Management \u2013 Part 1: General (Revision 3) \u2013 NIST Special Publication 800-57. U.S. Department of Commerce, NIST-ITL-CSD (July 2012)","DOI":"10.6028\/NIST.SP.800-57p1r3"},{"issue":"2","key":"23_CR2","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1016\/0022-0000(88)90005-0","volume":"37","author":"G. Brassard","year":"1988","unstructured":"Brassard, G., Chaum, D., Cr\u00e9peau, C.: Minimum Disclosure Proofs of Knowledge. J. Comput. Syst. Sci.\u00a037(2), 156\u2013189 (1988)","journal-title":"J. Comput. Syst. Sci."},{"key":"23_CR3","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1007\/s001450010011","volume":"13","author":"J. Boyar","year":"2000","unstructured":"Boyar, J., Damg\u00e5rd, I., Peralta, R.: Short Non-Interactive Cryptographic Proofs. J. Cryptology\u00a013, 449\u2013472 (2000)","journal-title":"J. Cryptology"},{"key":"23_CR4","first-page":"479","volume-title":"Proc. STOC 1996","author":"D. Beaver","year":"1996","unstructured":"Beaver, D.: Correlated pseudorandomness and the complexity of private computations. In: Proc. STOC 1996, pp. 479\u2013488. ACM, New York (1996)"},{"key":"23_CR5","doi-asserted-by":"crossref","unstructured":"Bellare, M., Hoang, V.T., Rogaway, P.: Foundations of garbled circuits. In: Proc. CCS 2012, pp. 784\u2013796. ACM, New York (2012), See also Cryptology ePrint Archive, Report 2012\/265","DOI":"10.1145\/2382196.2382279"},{"key":"23_CR6","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1145\/1008908.1008911","volume":"15","author":"M. Blum","year":"1983","unstructured":"Blum, M.: Coin flipping by telephone a protocol for solving impossible problems. SIGACT News\u00a015, 23\u201327 (1983)","journal-title":"SIGACT News"},{"key":"23_CR7","first-page":"503","volume-title":"Proc. STOC 1990","author":"D. Beaver","year":"1990","unstructured":"Beaver, D., Micali, S., Rogaway, P.: The round complexity of secure protocols. In: Proc. STOC 1990, pp. 503\u2013513. ACM, New York (1990)"},{"key":"23_CR8","unstructured":"Brand\u00e3o, L.T.A.N.: A Framework for Interactive Argument Systems using Quasigroupic Homorphic Commitment. Cryptology ePrint Archive, Report 2006\/472 (2006)"},{"key":"23_CR9","unstructured":"Bristol Cryptography Group. Circuits of Basic Functions Suitable For MPC and FHE, http:\/\/www.cs.bris.ac.uk\/Research\/CryptographySecurity\/MPC\/ (accessed June 2013)"},{"key":"23_CR10","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/s001459910006","volume":"13","author":"R. Canetti","year":"2000","unstructured":"Canetti, R.: Security and Composition of Multiparty Cryptographic Protocols. J. Cryptology\u00a013, 143\u2013202 (2000), See also Cryptology ePrint Archive, Report 1998\/018","journal-title":"J. Cryptology"},{"key":"23_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1007\/3-540-44750-4_9","volume-title":"Advances in Cryptology - CRYPTO \u201995","author":"C. Cr\u00e9peau","year":"1995","unstructured":"Cr\u00e9peau, C., van de Graaf, J., Tapp, A.: Committed Oblivious Transfer and Private Multi-party Computation. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol.\u00a0963, pp. 110\u2013123. Springer, Heidelberg (1995)"},{"key":"23_CR12","doi-asserted-by":"crossref","unstructured":"Canetti, R., Lindell, Y., Ostrovsky, R., Sahai, A.: Universally composable two-party and multi-party secure computation. In: Proc. STOC 2002, pp. 494\u2013503. ACM, New York (2002), See also Cryptology ePrint Archive, Report 2002\/140","DOI":"10.1145\/509907.509980"},{"key":"23_CR13","unstructured":"Damg\u00e5rd, I.B.: The application of claw free functions in cryptography. PhD thesis, Aarhus University, Mathematical Institute (1988)"},{"key":"23_CR14","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1145\/3812.3818","volume":"28","author":"S. Even","year":"1985","unstructured":"Even, S., Goldreich, O., Lempel, A.: A randomized protocol for signing contracts. Commun. ACM\u00a028, 637\u2013647 (1985)","journal-title":"Commun. ACM"},{"key":"23_CR15","doi-asserted-by":"crossref","unstructured":"Frederiksen, T.K., Jakobsen, T.P., Nielsen, J.B., Nordholt, P.S., Orlandi, C.: MiniLEGO: Efficient Secure Two-Party Computation from General Assumptions. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol.\u00a07881, pp. 537\u2013556. Springer, Heidelberg (2013), See also Cryptology ePrint Archive, Report 2013\/155","DOI":"10.1007\/978-3-642-38348-9_32"},{"key":"23_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/978-3-642-38980-1_21","volume-title":"Applied Cryptography and Network Security","author":"T.K. Frederiksen","year":"2013","unstructured":"Frederiksen, T.K., Nielsen, J.B.: Fast and Maliciously Secure Two-Party Computation Using the GPU. In: Jacobson, M., Locasto, M., Mohassel, P., Safavi-Naini, R. (eds.) ACNS 2013. LNCS, vol.\u00a07954, pp. 339\u2013356. Springer, Heidelberg (2013)"},{"issue":"2","key":"23_CR17","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S. Goldwasser","year":"1984","unstructured":"Goldwasser, S., Micali, S.: Probabilistic encryption. Journal of Computer and System Sciences\u00a028(2), 270\u2013299 (1984)","journal-title":"Journal of Computer and System Sciences"},{"key":"23_CR18","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Micali, S., Rivest, R.L.: A \u201cParadoxical\u201d Solution To The Signature Problem. In: Proc. FOCS 1984, pp. 441\u2013448. IEEE Computer Society (1984)","DOI":"10.1109\/SFCS.1984.715946"},{"key":"23_CR19","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. (ed.) EUROCRYPT 2008. LNCS, vol.\u00a04965, pp. 289\u2013306. Springer, Heidelberg (2008)"},{"key":"23_CR20","first-page":"218","volume-title":"Proc. STOC 1987","author":"O. Goldreich","year":"1987","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play ANY mental game. In: Proc. STOC 1987, pp. 218\u2013229. ACM, New York (1987)"},{"key":"23_CR21","unstructured":"Goldreich, O.: Foundations of Cryptography: Volume 2, Basic Applications, 7th edn. Cambridge University Press, New York (2004)"},{"key":"23_CR22","doi-asserted-by":"crossref","unstructured":"Huang, Y., Evans, D., Katz, J., Malka, L.: Faster Secure Two-Party Computation Using Garbled Circuits. In: Proc. SEC 2011. USENIX Association (2011)","DOI":"10.1007\/978-3-642-25560-1_2"},{"key":"23_CR23","doi-asserted-by":"crossref","unstructured":"Huang, Y., Katz, J., Evans, D.: Quid-Pro-Quo-tocols: Strengthening Semi-Honest Protocols with Dual Execution. In: Proc. S&P 2012 (May 2012)","DOI":"10.1109\/SP.2012.43"},{"key":"23_CR24","doi-asserted-by":"crossref","unstructured":"Huang, Y., Katz, J., Evans, D.: Efficient Secure Two-Party Computation Using Symmetric Cut-and-Choose. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013, Part II. LNCS, vol.\u00a08043, pp. 18\u201335. Springer, Heidelberg (2013), See also Cryptology ePrint Archive, Report 2013\/081","DOI":"10.1007\/978-3-642-40084-1_2"},{"key":"23_CR25","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.\u00a02729, pp. 145\u2013161. Springer, Heidelberg (2003)"},{"key":"23_CR26","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":"23_CR27","unstructured":"Kiraz, M.S.: Secure and Fair Two-Party Computation. Phd thesis, Technische Universiteit Eindhoven, Netherlands (2008)"},{"key":"23_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/978-3-642-32928-9_12","volume-title":"Security and Cryptography for Networks","author":"V. Kolesnikov","year":"2012","unstructured":"Kolesnikov, V., Kumaresan, R.: Improved Secure Two-Party Computation via Information-Theoretic Garbled Circuits. In: Visconti, I., De Prisco, R. (eds.) SCN 2012. LNCS, vol.\u00a07485, pp. 205\u2013221. Springer, Heidelberg (2012)"},{"issue":"3","key":"23_CR29","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1002\/bltj.20396","volume":"14","author":"V. Kolesnikov","year":"2009","unstructured":"Kolesnikov, V.: Advances and impact of secure function evaluation. Bell Labs Technical Journal\u00a014(3), 187\u2013192 (2009)","journal-title":"Bell Labs Technical Journal"},{"key":"23_CR30","unstructured":"Kiraz, M.S., Schoenmakers, B.: A protocol issue for the malicious case of Yao\u2019s garbled circuit construction. In: Proc. 27th Symp. Information Theory in the Benelux, pp. 283\u2013290 (2006)"},{"key":"23_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/978-3-540-79263-5_6","volume-title":"Topics in Cryptology \u2013 CT-RSA 2008","author":"M.S. Kiraz","year":"2008","unstructured":"Kiraz, M.S., Schoenmakers, B.: An Efficient Protocol for Fair Secure Two-Party Computation. In: Malkin, T. (ed.) CT-RSA 2008. LNCS, vol.\u00a04964, pp. 88\u2013105. Springer, Heidelberg (2008)"},{"key":"23_CR32","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":"23_CR33","unstructured":"Kreuter, B., Shelat, A., Shen, C.-H.: Billion-gate secure computation with malicious adversaries. In: Proc. Security 2012, pp. 285\u2013300. USENIX Association (2012), See also Cryptology ePrint Archive, Report 2012\/179"},{"key":"23_CR34","doi-asserted-by":"crossref","unstructured":"Lindell: Parallel Coin-Tossing and Constant-Round Secure Two-Party Computation. J. Cryptology\u00a016(3), 143\u2013184 (2003), See also Cryptology ePrint Archive, Report 2001\/107","DOI":"10.1007\/s00145-002-0143-7"},{"key":"23_CR35","doi-asserted-by":"crossref","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), See also Cryptology ePrint Archive, Report 2013\/079","DOI":"10.1007\/978-3-642-40084-1_1"},{"issue":"3","key":"23_CR36","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/s00145-001-0019-2","volume":"15","author":"Y. Lindell","year":"2002","unstructured":"Lindell, Y., Pinkas, B.: Privacy Preserving Data Mining. J. Cryptology\u00a015(3), 177\u2013206 (2002)","journal-title":"J. Cryptology"},{"key":"23_CR37","doi-asserted-by":"crossref","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), See also Cryptology ePrint Archive, Report 2008\/049","DOI":"10.1007\/978-3-540-72540-4_4"},{"issue":"2","key":"23_CR38","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. J. Cryptology\u00a022(2), 161\u2013188 (2009)","journal-title":"J. Cryptology"},{"key":"23_CR39","doi-asserted-by":"crossref","unstructured":"Lindell, Y., Pinkas, B.: Secure two-party computation via cut-and-choose oblivious transfer. In: Ishai, Y. (ed.) TCC 2011. LNCS, vol.\u00a06597, pp. 329\u2013346. Springer, Heidelberg (2011), See also Cryptology ePrint Archive, Report 2010\/284","DOI":"10.1007\/978-3-642-19571-6_20"},{"key":"23_CR40","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.K.: 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":"23_CR41","doi-asserted-by":"crossref","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., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol.\u00a07417, pp. 681\u2013700. Springer, Heidelberg (2012), See also Cryptology ePrint Archive, Report 2011\/091","DOI":"10.1007\/978-3-642-32009-5_40"},{"key":"23_CR42","doi-asserted-by":"crossref","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), See also Cryptology ePrint Archive, Report 2008\/427","DOI":"10.1007\/978-3-642-00457-5_22"},{"key":"23_CR43","first-page":"448","volume-title":"SODA 2001","author":"M. Naor","year":"2001","unstructured":"Naor, M., Pinkas, B.: Efficient oblivious transfer protocols. In: SODA 2001, pp. 448\u2013457. SIAM, Philadelphia (2001)"},{"key":"23_CR44","first-page":"129","volume-title":"Proc. EC 1999","author":"M. Naor","year":"1999","unstructured":"Naor, M., Pinkas, B., Sumner, R.: Privacy preserving auctions and mechanism design. In: Proc. EC 1999, pp. 129\u2013139. ACM, New York (1999)"},{"key":"23_CR45","unstructured":"Niven, I.M., Zuckerman, H.S., Montgomery, H.L.: An introduction to the theory of numbers, 5th edn. Wiley (1991)"},{"key":"23_CR46","series-title":"Lecture Notes in Computer Science","first-page":"647","volume-title":"Advances in Cryptology \u2013 EUROCRPYT 2003","author":"B. Pinkas","year":"2003","unstructured":"Pinkas, B.: Fair Secure Two-Party Computation. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol.\u00a02656, pp. 647\u2013647. Springer, Heidelberg (2003)"},{"key":"23_CR47","doi-asserted-by":"crossref","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), See also Cryptology ePrint Archive, Report 2009\/314","DOI":"10.1007\/978-3-642-10366-7_15"},{"key":"23_CR48","unstructured":"Rabin, M.O.: How to exchange secrets with oblivious transfer. Technical Report TR-81, Harvard University, Aiken Computation Lab, Cambridge, MA (1981), See typesetted version in Cryptology ePrint Archive, Report 2005\/187"},{"key":"23_CR49","doi-asserted-by":"crossref","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), See also Cryptology ePrint Archive, Report 2011\/533","DOI":"10.1007\/978-3-642-20465-4_22"},{"key":"23_CR50","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1007\/3-540-48184-2_9","volume-title":"Advances in Cryptology - CRYPTO \u201987","author":"J. Graaf van de","year":"1988","unstructured":"van de Graaf, J., Peralta, R.: A Simple and Secure Way to Show the Validity of Your Public Key. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol.\u00a0293, pp. 128\u2013134. Springer, Heidelberg (1988)"},{"key":"23_CR51","doi-asserted-by":"crossref","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), See also Cryptology ePrint Archive, Report 2006\/397","DOI":"10.1007\/978-3-540-72540-4_5"},{"key":"23_CR52","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: Protocols for secure computations. In: Proc. FOCS 1982, pp. 160\u2013164. IEEE Computer Society (1982)","DOI":"10.1109\/SFCS.1982.38"},{"key":"23_CR53","doi-asserted-by":"crossref","unstructured":"Yao, A.C.-C.: How to generate and exchange secrets. In: FOCS 1986, pp. 162\u2013167 (1986)","DOI":"10.1109\/SFCS.1986.25"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology - ASIACRYPT 2013"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-42045-0_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,10]],"date-time":"2020-08-10T14:29:25Z","timestamp":1597069765000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-42045-0_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642420443","9783642420450"],"references-count":53,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-42045-0_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}