{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,14]],"date-time":"2026-10-14T04:03:45Z","timestamp":1791950625119,"version":"4.3.4"},"publisher-location":"New York, NY, USA","reference-count":49,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,10,4]],"date-time":"2010-10-04T00:00:00Z","timestamp":1286150400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2010,10,4]]},"DOI":"10.1145\/1866307.1866358","type":"proceedings-article","created":{"date-parts":[[2010,10,5]],"date-time":"2010-10-05T14:38:23Z","timestamp":1286289503000},"page":"451-462","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":213,"title":["TASTY"],"prefix":"10.1145","author":[{"given":"Wilko","family":"Henecka","sequence":"first","affiliation":[{"name":"Ruhr-University Bochum, Bochum, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Stefan","family":"K \u00f6gl","sequence":"additional","affiliation":[{"name":"Ruhr-University Bochum, Bochum, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ahmad-Reza","family":"Sadeghi","sequence":"additional","affiliation":[{"name":"Ruhr-University Bochum, Bochum, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Thomas","family":"Schneider","sequence":"additional","affiliation":[{"name":"Ruhr-University Bochum, Bochum, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Immo","family":"Wehrenberg","sequence":"additional","affiliation":[{"name":"Ruhr-University Bochum, Bochum, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2010,10,4]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/1813084.1813119"},{"key":"e_1_3_2_1_2_1","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/3-540-44750-4_8","volume-title":"Advances in Cryptology -- CRYPTO'95","author":"Beaver D.","year":"1995","unstructured":"}} D. Beaver . Precomputing oblivious transfer . In Advances in Cryptology -- CRYPTO'95 , volume 963 of LNCS , pages 97 -- 109 . Springer , 1995 . }}D. Beaver. Precomputing oblivious transfer. In Advances in Cryptology -- CRYPTO'95, volume 963 of LNCS, pages 97--109. Springer, 1995."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1455770.1455804"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62213"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-88313-5_13"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30576-7_18"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1315245.1315307"},{"key":"e_1_3_2_1_8_1","volume-title":"Introduction to Algorithms","author":"Cormen T. H.","year":"2001","unstructured":"}} T. H. Cormen , C. E. Leiserson , R. L. Rivest , and C. Stein . Introduction to Algorithms , Second Edition. MIT Press and McGraw-Hill Book Company , 2001 . }}T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms, Second Edition. MIT Press and McGraw-Hill Book Company, 2001."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/1770231.1770269"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00468-1_10"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/648118.746742"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13190-5_2"},{"key":"e_1_3_2_1_14_1","series-title":"LNCS","first-page":"10","volume-title":"Advances in Cryptology -- CRYPTO '84","author":"El Gamal T.","year":"1985","unstructured":"}} T. El Gamal . A public key cryptosystem and a signature scheme based on discrete logarithms . In Advances in Cryptology -- CRYPTO '84 , volume 196 of LNCS , pages 10 -- 18 . Springer , 1985 . }}T. El Gamal. A public key cryptosystem and a signature scheme based on discrete logarithms. In Advances in Cryptology -- CRYPTO '84, volume 196 of LNCS, pages 10--18. Springer, 1985."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03168-7_14"},{"key":"e_1_3_2_1_16_1","series-title":"LNCS","first-page":"1","volume-title":"Advances in Cryptology -- EUROCRYPT'04","author":"Freedman M. J.","year":"2004","unstructured":"}} M. J. Freedman , K. Nissim , and B. Pinkas . Efficient private matching and set intersection . In Advances in Cryptology -- EUROCRYPT'04 , volume 3027 of LNCS , pages 1 -- 19 . Springer , 2004 . }}M. J. Freedman, K. Nissim, and B. Pinkas. Efficient private matching and set intersection. In Advances in Cryptology -- EUROCRYPT'04, volume 3027 of LNCS, pages 1--19. Springer, 2004."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536440"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13190-5_26"},{"key":"e_1_3_2_1_19_1","volume-title":"Cryptographic key length recommendation","author":"Giry D.","year":"2010","unstructured":"}} D. Giry and J.-J. Quisquater . Cryptographic key length recommendation , 2010 . http:\/\/keylength.com. }}D. Giry and J.-J. Quisquater. Cryptographic key length recommendation, 2010. http:\/\/keylength.com."},{"key":"e_1_3_2_1_20_1","unstructured":"}}GMP -- GNU multi precision arithmetic library. http:\/\/gmplib.org.  }}GMP -- GNU multi precision arithmetic library. http:\/\/gmplib.org."},{"key":"e_1_3_2_1_21_1","unstructured":"}}gmpy -- multiprecision arithmetic for Python. http:\/\/code.google.com\/p\/gmpy.  }}gmpy -- multiprecision arithmetic for Python. http:\/\/code.google.com\/p\/gmpy."},{"key":"e_1_3_2_1_22_1","unstructured":"}}Gnuplot.py. http:\/\/gnuplot-py.sourceforge.net.  }}Gnuplot.py. http:\/\/gnuplot-py.sourceforge.net."},{"key":"e_1_3_2_1_24_1","series-title":"LNCS","first-page":"145","volume-title":"Advances in Cryptology -- CRYPTO'03","author":"Ishai Y.","year":"2003","unstructured":"}} Y. Ishai , J. Kilian , K. Nissim , and E. Petrank . Extending oblivious transfers efficiently . In Advances in Cryptology -- CRYPTO'03 , volume 2729 of LNCS , pages 145 -- 161 . Springer , 2003 . }}Y. Ishai, J. Kilian, K. Nissim, and E. Petrank. Extending oblivious transfers efficiently. In Advances in Cryptology -- CRYPTO'03, volume 2729 of LNCS, pages 145--161. Springer, 2003."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-01957-9_7"},{"key":"e_1_3_2_1_26_1","first-page":"293","article-title":"Multiplication of many-digital numbers by automatic computers","volume":"145","author":"Karatsuba A.","year":"1962","unstructured":"}} A. Karatsuba and Y. Ofman . Multiplication of many-digital numbers by automatic computers . SSSR Academy of Sciences , 145 : 293 -- 294 , 1962 . }}A. Karatsuba and Y. Ofman. Multiplication of many-digital numbers by automatic computers. SSSR Academy of Sciences, 145:293--294, 1962.","journal-title":"SSSR Academy of Sciences"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10433-6_1"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-008-9036-8"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.29012\/jpc.v1i1.566"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85855-3_2"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/948109.948139"},{"key":"e_1_3_2_1_33_1","volume-title":"USENIX Security Symposium","author":"Malkhi D.","year":"2004","unstructured":"}} D. Malkhi , N. Nisan , B. Pinkas , and Y. Sella . Fairplay -- a secure two-party computation system . In USENIX Security Symposium , 2004 . http:\/\/fairplayproject.net\/fairplay.html. }}D. Malkhi, N. Nisan, B. Pinkas, and Y. Sella. Fairplay -- a secure two-party computation system. In USENIX Security Symposium, 2004. http:\/\/fairplayproject.net\/fairplay.html."},{"key":"e_1_3_2_1_34_1","unstructured":"}}T. Moran. The qilin crypto SDK -- an open-source java SDK for rapid prototyping of cryptographic protocols. http:\/\/qilin.seas.harvard.edu.  }}T. Moran. The qilin crypto SDK -- an open-source java SDK for rapid prototyping of cryptographic protocols. http:\/\/qilin.seas.harvard.edu."},{"key":"e_1_3_2_1_35_1","first-page":"448","volume-title":"ACM-SIAM Symposium On Discrete Algorithms (SODA'01)","author":"Naor M.","year":"2001","unstructured":"}} M. Naor and B. Pinkas . Efficient oblivious transfer protocols . In ACM-SIAM Symposium On Discrete Algorithms (SODA'01) , pages 448 -- 457 . Society for Industrial and Applied Mathematics , 2001 . }}M. Naor and B. Pinkas. Efficient oblivious transfer protocols. In ACM-SIAM Symposium On Discrete Algorithms (SODA'01), pages 448--457. Society for Industrial and Applied Mathematics, 2001."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/336992.337028"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/1255329.1255333"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/AAMAS.2004.240"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2010.39"},{"key":"e_1_3_2_1_41_1","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/3-540-48910-X_16","volume-title":"Advances in Cryptology -- EUROCRYPT'99","author":"Paillier P.","year":"1999","unstructured":"}} P. Paillier . Public-key cryptosystems based on composite degree residuosity classes . In Advances in Cryptology -- EUROCRYPT'99 , volume 1592 of LNCS , pages 223 -- 238 . Springer , 1999 . }}P. Paillier. Public-key cryptosystems based on composite degree residuosity classes. In Advances in Cryptology -- EUROCRYPT'99, volume 1592 of LNCS, pages 223--238. Springer, 1999."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-01957-9_6"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.5555\/646756.705507"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10366-7_15"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.5555\/1883749.1883771"},{"key":"e_1_3_2_1_46_1","volume-title":"ECRYPT Workshop on Software Performance Enhancements for Encryption and Decryption and Cryptographic Compilers (SPEED-CC '09)","author":"Schr \u00f6pfer A.","year":"2009","unstructured":"}} A. Schr \u00f6pfer , F. Kerschbaum , D. Biswas , S. Gei \u00dfinger , and C. Sch \u00fctz . L1 -- faster development and benchmarking of cryptographic protocols . In ECRYPT Workshop on Software Performance Enhancements for Encryption and Decryption and Cryptographic Compilers (SPEED-CC '09) , October 12 --13 , 2009 . }}A. Schr \u00f6pfer, F. Kerschbaum, D. Biswas, S. Gei \u00dfinger, and C. Sch \u00fctz. L1 -- faster development and benchmarking of cryptographic protocols. In ECRYPT Workshop on Software Performance Enhancements for Encryption and Decryption and Cryptographic Compilers (SPEED-CC '09), October 12--13, 2009."},{"key":"e_1_3_2_1_47_1","volume-title":"Certicom Research","year":"2000","unstructured":"}}Standards for efficient cryptography, SEC 2: Recommended elliptic curve domain parameters. Technical report , Certicom Research , 2000 . Available from http:\/\/www.secg.org. }}Standards for efficient cryptography, SEC 2: Recommended elliptic curve domain parameters. Technical report, Certicom Research, 2000. Available from http:\/\/www.secg.org."},{"key":"e_1_3_2_1_48_1","unstructured":"}}M. C. Silaghi. SMC: Secure multiparty computation language. http:\/\/cs.fit.edu\/ msilaghi\/SMC\/ 2004.  }}M. C. Silaghi. SMC: Secure multiparty computation language. http:\/\/cs.fit.edu\/ msilaghi\/SMC\/ 2004."},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13013-7_25"},{"key":"e_1_3_2_1_50_1","unstructured":"}}TASTY -- Tool for Automating Secure Two-partY computations. http:\/\/tastyproject.net.  }}TASTY -- Tool for Automating Secure Two-partY computations. http:\/\/tastyproject.net."},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1162\/jocn.1991.3.1.71"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.5555\/1382436.1382751"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1986.25"}],"event":{"name":"CCS '10: 17th ACM Conference on Computer and Communications Security 2010","location":"Chicago Illinois USA","acronym":"CCS '10","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 17th ACM conference on Computer and communications security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1866307.1866358","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1866307.1866358","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:08:59Z","timestamp":1750248539000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1866307.1866358"}},"subtitle":["tool for automating secure two-party computations"],"short-title":[],"issued":{"date-parts":[[2010,10,4]]},"references-count":49,"alternative-id":["10.1145\/1866307.1866358","10.1145\/1866307"],"URL":"https:\/\/doi.org\/10.1145\/1866307.1866358","relation":{},"subject":[],"published":{"date-parts":[[2010,10,4]]},"assertion":[{"value":"2010-10-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}