{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:43:06Z","timestamp":1760708586874,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642389795"},{"type":"electronic","value":"9783642389801"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","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-38980-1_21","type":"book-chapter","created":{"date-parts":[[2013,6,20]],"date-time":"2013-06-20T18:26:48Z","timestamp":1371752808000},"page":"339-356","source":"Crossref","is-referenced-by-count":23,"title":["Fast and Maliciously Secure Two-Party Computation Using the GPU"],"prefix":"10.1007","author":[{"given":"Tore Kasper","family":"Frederiksen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jesper Buus","family":"Nielsen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"21_CR1","doi-asserted-by":"crossref","unstructured":"Beaver, D.: Correlated pseudorandomness and the complexity of private computations. In: STOC 1996, pp. 479\u2013488. ACM (1996)","DOI":"10.1145\/237814.237996"},{"key":"21_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/978-3-642-03549-4_20","volume-title":"Financial Cryptography and Data Security","author":"P. Bogetoft","year":"2009","unstructured":"Bogetoft, P., et al.: Secure multiparty computation goes live. In: Dingledine, R., Golle, P. (eds.) FC 2009. LNCS, vol.\u00a05628, pp. 325\u2013343. Springer, Heidelberg (2009)"},{"key":"21_CR3","unstructured":"Nvidia Corporation. NVIDIA CUDA C Programming Best Practices Guide. Technical report (2012)"},{"key":"21_CR4","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: STOC 1987, pp. 218\u2013229. ACM (1987)","DOI":"10.1145\/28395.28420"},{"key":"21_CR5","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":"21_CR6","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: ACM Conference on Computer and Communications Security, pp. 451\u2013462. ACM (2010)","DOI":"10.1145\/1866307.1866358"},{"key":"21_CR7","doi-asserted-by":"crossref","unstructured":"Huang, Y., Evans, D., Katz, J., Malka, L.: Faster secure two-party computation using garbled circuits. In: USENIX Security Symposium (2011)","DOI":"10.1007\/978-3-642-25560-1_2"},{"key":"21_CR8","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":"21_CR9","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":"21_CR10","unstructured":"Kolesnikov, V., Sadeghi, A.-R., Schneider, T.: From dust to dawn: Practically efficient two-party secure function evaluation protocols and their modular design. Cryptology ePrint Archive, Report 2010\/079 (2010), \n                    \n                      http:\/\/eprint.iacr.org\/"},{"key":"21_CR11","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":"21_CR12","unstructured":"Kreuter, B., Shelat, A., Shen, C.-H.: Billion-gate secure computation with malicious adversaries. In: 21th USENIX Conference on Security Symposium, p. 14. USENIX (2012)"},{"key":"21_CR13","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":"21_CR14","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":"21_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/978-3-642-19571-6_20","volume-title":"Theory of Cryptography","author":"Y. Lindell","year":"2011","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)"},{"key":"21_CR16","doi-asserted-by":"crossref","unstructured":"Mansour, Y., Nisan, N., Tiwari, P.: The computational complexity of universal hashing. In: Structure in Complexity Theory Conference, p. 90. IEEE (1990)","DOI":"10.1145\/100216.100246"},{"key":"21_CR17","doi-asserted-by":"crossref","unstructured":"Naor, M., Pinkas, B., Sumner, R.: Privacy preserving auctions and mechanism design. In: ACM Conference on Electronic Commerce, pp. 129\u2013139. ACM (1999)","DOI":"10.1145\/336992.337028"},{"key":"21_CR18","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":"21_CR19","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":"21_CR20","doi-asserted-by":"crossref","unstructured":"Nishikawa, N., Iwai, K., Kurokawa, T.: High-performance symmetric block ciphers on multicore CPU and GPUs. International Journal of Networking and Computing\u00a02(2) (2012)","DOI":"10.15803\/ijnc.2.2_251"},{"key":"21_CR21","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.P., Williams, S.C.: Secure two-party computation is practical. In: Matsui, M. (ed.) ASIACRYPT 2009. LNCS, vol.\u00a05912, pp. 250\u2013267. Springer, Heidelberg (2009)"},{"key":"21_CR22","unstructured":"Pu, S., Duan, P., Liu, J.-C.: Fastplay-a parallelization model and implementation of SMC on cuda based GPU cluster architecture. IACR Cryptology ePrint Archive, 2011:97 (2011)"},{"key":"21_CR23","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":"21_CR24","unstructured":"Xu, L., Lin, D., Zou, J.: ECDLP on GPU. IACR Cryptology ePrint Archive, 2011:146 (2011)"},{"key":"21_CR25","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: Protocols for secure computations. In: FOCS 1982, pp. 160\u2013164. IEEE (1982)","DOI":"10.1109\/SFCS.1982.38"}],"container-title":["Lecture Notes in Computer Science","Applied Cryptography and Network Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38980-1_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T21:56:45Z","timestamp":1558303005000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38980-1_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642389795","9783642389801"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38980-1_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}