{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:17:47Z","timestamp":1763468267739,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":46,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,10,12]],"date-time":"2015-10-12T00:00:00Z","timestamp":1444608000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"German Federal Ministry of Education and Research (BMBF)","award":["CRC 1119 CROSSING"],"award-info":[{"award-number":["CRC 1119 CROSSING"]}]},{"name":"European Union's 7th Framework Program","award":["609611\/PRACTICE"],"award-info":[{"award-number":["609611\/PRACTICE"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2015,10,12]]},"DOI":"10.1145\/2810103.2813678","type":"proceedings-article","created":{"date-parts":[[2015,10,6]],"date-time":"2015-10-06T15:22:12Z","timestamp":1444144932000},"page":"1504-1517","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":65,"title":["Automated Synthesis of Optimized Circuits for Secure Computation"],"prefix":"10.1145","author":[{"given":"Daniel","family":"Demmler","sequence":"first","affiliation":[{"name":"TU Darmstadt, Darmstadt, Germany"}]},{"given":"Ghada","family":"Dessouky","sequence":"additional","affiliation":[{"name":"TU Darmstadt, Darmstadt, Germany"}]},{"given":"Farinaz","family":"Koushanfar","sequence":"additional","affiliation":[{"name":"Rice University, Houston, USA"}]},{"given":"Ahmad-Reza","family":"Sadeghi","sequence":"additional","affiliation":[{"name":"TU Darmstadt, Darmstadt, Germany"}]},{"given":"Thomas","family":"Schneider","sequence":"additional","affiliation":[{"name":"TU Darmstadt, Darmstadt, Germany"}]},{"given":"Shaza","family":"Zeitouni","sequence":"additional","affiliation":[{"name":"TU Darmstadt, Darmstadt, Germany"}]}],"member":"320","published-online":{"date-parts":[[2015,10,12]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"NDSS'13","author":"Aliasgari M.","year":"2013","unstructured":"M. Aliasgari , M. Blanton , Y. Zhang , A. Steele . Secure computation on floating point numbers . In NDSS'13 . The Internet Society , 2013 . M. Aliasgari, M. Blanton, Y. Zhang, A. Steele. Secure computation on floating point numbers. In NDSS'13. The Internet Society, 2013."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516738"},{"key":"e_1_3_2_1_3_1","series-title":"LNCS","volume-title":"CRYPTO'91","author":"Beaver D.","year":"1991","unstructured":"D. Beaver . Efficient multiparty protocols using circuit randomization . In CRYPTO'91 , volume 576 of LNCS , p. 420--432. Springer , 1991 . D. Beaver. Efficient multiparty protocols using circuit randomization. In CRYPTO'91, volume 576 of LNCS, p. 420--432. Springer, 1991."},{"key":"e_1_3_2_1_4_1","unstructured":"ABCBerkeley Logic Synthesis. ABC: a system for sequential synthesis and verification release 70930.mboxhttp:\/\/www.eecs.berkeley.edu\/alanmi\/abc\/.  ABCBerkeley Logic Synthesis. ABC: a system for sequential synthesis and verification release 70930.mboxhttp:\/\/www.eecs.berkeley.edu\/alanmi\/abc\/."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2013.39"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1455770.1455804"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10207-012-0177-2"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/11821069_16"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(99)00182-6"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-27954-6_26"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2015.23113"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2037252.2037271"},{"key":"e_1_3_2_1_13_1","first-page":"1","article-title":"standard for floating-point arithmetic","author":"IEEE","year":"2008","unstructured":"IEEE standard for floating-point arithmetic . IEEE Std 754-- 2008 , p. 1 -- 70 , Aug 2008. IEEE standard for floating-point arithmetic. IEEE Std 754--2008, p. 1--70, Aug 2008.","journal-title":"IEEE Std 754--"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28420"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/1760564.1760594"},{"key":"e_1_3_2_1_16_1","volume-title":"NDSS'12","author":"Huang Y.","year":"2012","unstructured":"Y. Huang , D. Evans , J. Katz . Private set intersection: Are garbled circuits better than custom protocols? In NDSS'12 . The Internet Society , 2012 . Y. Huang, D. Evans, J. Katz. Private set intersection: Are garbled circuits better than custom protocols? In NDSS'12. The Internet Society, 2012."},{"key":"e_1_3_2_1_17_1","first-page":"539","volume-title":"USENIX Security'11","author":"Huang Y.","year":"2011","unstructured":"Y. Huang , D. Evans , J. Katz , L. Malka . Faster secure two-party computation using garbled circuits . In USENIX Security'11 , p. 539 -- 554 . USENIX , 2011 . Y. Huang, D. Evans, J. Katz, L. Malka. Faster secure two-party computation using garbled circuits. In USENIX Security'11, p. 539--554. USENIX, 2011."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2382196.2382278"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1866307.1866358"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45146-4_9"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/344588.344618"},{"key":"e_1_3_2_1_22_1","first-page":"293","article-title":"Multiplication of many-digital numbers by automatic computers","volume":"145","author":"Karatsuba A. A.","year":"1962","unstructured":"A. A. Karatsuba , Y. Ofman . Multiplication of many-digital numbers by automatic computers . SSSR Academy of Sciences , 145 : 293 -- 294 , 1962 . A. A. Karatsuba, 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_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70583-3_40"},{"key":"e_1_3_2_1_24_1","first-page":"321","volume-title":"USENIX Security'13","author":"Kreuter B.","year":"2013","unstructured":"B. Kreuter , A. Shelat , B. Mood , K. R. B. Butler . PCF: A portable circuit format for scalable two-party secure computation . In USENIX Security'13 , p. 321 -- 336 . USENIX , 2013 . B. Kreuter, A. Shelat, B. Mood, K. R. B. Butler. PCF: A portable circuit format for scalable two-party secure computation. In USENIX Security'13, p. 321--336. USENIX, 2013."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10433-6_1"},{"key":"e_1_3_2_1_26_1","first-page":"285","volume-title":"USENIX Security'12","author":"Kreuter B.","year":"2012","unstructured":"B. Kreuter , A. Shelat , C.-H. Shen . Billion-gate secure computation with malicious adversaries . In USENIX Security'12 , p. 285 -- 300 . USENIX , 2012 . B. Kreuter, A. Shelat, C.-H. Shen. Billion-gate secure computation with malicious adversaries. In USENIX Security'12, p. 285--300. USENIX, 2012."},{"key":"e_1_3_2_1_27_1","series-title":"LNCS","volume-title":"ACNS'15","author":"Kerschbaum F.","year":"2013","unstructured":"F. Kerschbaum , T. Schneider , A. Schr\u00f6pfer . Automatic protocol selection in secure two-party computations . In ACNS'15 , volume 8479 of LNCS , p. 1--18. Springer , 2013 . F. Kerschbaum, T. Schneider, A. Schr\u00f6pfer. Automatic protocol selection in secure two-party computations. In ACNS'15, volume 8479 of LNCS, p. 1--18. Springer, 2013."},{"key":"e_1_3_2_1_28_1","first-page":"1","volume-title":"International Journal of Information Security","author":"Kamm L.","year":"2014","unstructured":"L. Kamm , J. Willemson . Secure floating point arithmetic and private satellite collision analysis . International Journal of Information Security , p. 1 -- 18 , 2014 . L. Kamm, J. Willemson. Secure floating point arithmetic and private satellite collision analysis. International Journal of Information Security, p. 1--18, 2014."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/322217.322232"},{"key":"e_1_3_2_1_30_1","volume-title":"ObliVM: A programming framework for secure computation","author":"Liu C.","year":"2015","unstructured":"5}oblivm C. Liu , X. S. Wang , K. Nayak , Y. Huang , E. Shi . ObliVM: A programming framework for secure computation . In IEEE S&P'15, p. 359--376. IEEE , 2015 . 5}oblivmC. Liu, X. S. Wang, K. Nayak, Y. Huang, E. Shi. ObliVM: A programming framework for secure computation. In IEEE S&P'15, p. 359--376. IEEE, 2015."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2046707.2046787"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32946-3_19"},{"key":"e_1_3_2_1_33_1","first-page":"287","volume-title":"USENIX Security'04","author":"Malkhi D.","year":"2004","unstructured":"D. Malkhi , N. Nisan , B. Pinkas , Y. Sella . Fairplay -- a secure two-party computation system . In USENIX Security'04 , p. 287 -- 302 . USENIX , 2004 . D. Malkhi, N. Nisan, B. Pinkas, Y. Sella. Fairplay -- a secure two-party computation system. In USENIX Security'04, p. 287--302. USENIX, 2004."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32009-5_40"},{"key":"e_1_3_2_1_35_1","volume-title":"Models of Computation: Exploring the Power of Computing","author":"Savage J. E.","year":"1997","unstructured":"J. E. Savage . Models of Computation: Exploring the Power of Computing . Addison-Wesley Pub , Boston, MA, USA , 1 st edition, 1997 . J. E. Savage. Models of Computation: Exploring the Power of Computing. Addison-Wesley Pub, Boston, MA, USA, 1st edition, 1997.","edition":"1"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2590296.2590307"},{"key":"e_1_3_2_1_37_1","volume-title":"TinyGarble: Highly compressed and scalable sequential garbled circuits","author":"Songhori E. M.","year":"2015","unstructured":"E. M. Songhori , S. U. Hussain , A.-R. Sadeghi , T. Schneider , F. Koushanfar . TinyGarble: Highly compressed and scalable sequential garbled circuits . In IEEE S&P'15, p. 411--428. IEEE , 2015 . E. M. Songhori, S. U. Hussain, A.-R. Sadeghi, T. Schneider, F. Koushanfar. TinyGarble: Highly compressed and scalable sequential garbled circuits. In IEEE S&P'15, p. 411--428. IEEE, 2015."},{"key":"e_1_3_2_1_38_1","unstructured":"N. Smart S. Tillich. Circuits of basic functions suitable for MPC and FHE. http:\/\/www.cs.bris.ac.uk\/Research\/CryptographySecurity\/MPC\/.  N. Smart S. Tillich. Circuits of basic functions suitable for MPC and FHE. http:\/\/www.cs.bris.ac.uk\/Research\/CryptographySecurity\/MPC\/."},{"key":"e_1_3_2_1_39_1","volume-title":"Design compiler","author":"Synopsys Inc.","year":"2010","unstructured":"Synopsys Inc. Design compiler , 2010 . http:\/\/www.synopsys.com\/Tools\/Implementation\/RTLSynthesis\/DesignCompiler. Synopsys Inc. Design compiler, 2010. http:\/\/www.synopsys.com\/Tools\/Implementation\/RTLSynthesis\/DesignCompiler."},{"key":"e_1_3_2_1_40_1","volume-title":"DesignWare library - datapath and building block IP. https:\/\/www.synopsys.com\/dw\/buildingblock.php","author":"Synopsys Inc.","year":"2015","unstructured":"Synopsys Inc. DesignWare library - datapath and building block IP. https:\/\/www.synopsys.com\/dw\/buildingblock.php , 2015 . Synopsys Inc. DesignWare library - datapath and building block IP. https:\/\/www.synopsys.com\/dw\/buildingblock.php, 2015."},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-39884-1_23"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/321439.321449"},{"key":"e_1_3_2_1_43_1","unstructured":"C. Wolf. Yosys open synthesis suite. http:\/\/www.clifford.at\/yosys\/.  C. Wolf. Yosys open synthesis suite. http:\/\/www.clifford.at\/yosys\/."},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1986.25"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46803-6_8"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516752"}],"event":{"name":"CCS'15: The 22nd ACM Conference on Computer and Communications Security","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"],"location":"Denver Colorado USA","acronym":"CCS'15"},"container-title":["Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2810103.2813678","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2810103.2813678","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T05:48:24Z","timestamp":1750225704000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2810103.2813678"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,10,12]]},"references-count":46,"alternative-id":["10.1145\/2810103.2813678","10.1145\/2810103"],"URL":"https:\/\/doi.org\/10.1145\/2810103.2813678","relation":{},"subject":[],"published":{"date-parts":[[2015,10,12]]},"assertion":[{"value":"2015-10-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}