{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:26:10Z","timestamp":1740122770117,"version":"3.37.3"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2017,9,14]],"date-time":"2017-09-14T00:00:00Z","timestamp":1505347200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["CRC 1119"],"award-info":[{"award-number":["CRC 1119"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Form Methods Syst Des"],"published-print":{"date-parts":[[2017,11]]},"DOI":"10.1007\/s10703-017-0300-0","type":"journal-article","created":{"date-parts":[[2017,9,14]],"date-time":"2017-09-14T06:50:12Z","timestamp":1505371812000},"page":"308-331","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["On compiling Boolean circuits optimized for secure multi-party computation"],"prefix":"10.1007","volume":"51","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0146-7142","authenticated-orcid":false,"given":"Niklas","family":"B\u00fcscher","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Franz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andreas","family":"Holzer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Helmut","family":"Veith","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Katzenbeisser","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,9,14]]},"reference":[{"key":"300_CR1","unstructured":"Berkeley logic synthesis and verification group, abc: a system for sequential synthesis and verification, release 30916. http:\/\/www.eecs.berkeley.edu\/~alanmi\/abc\/"},{"key":"300_CR2","doi-asserted-by":"crossref","unstructured":"Bellare M, Hoang VT, Keelveedhi S, Rogaway P (2013) Efficient garbling from a fixed-key blockcipher. In: IEEE S&P","DOI":"10.1109\/SP.2013.39"},{"key":"300_CR3","doi-asserted-by":"crossref","unstructured":"Bilogrevic I, Jadliwala M, Hubaux J, Aad I, Niemi V (2011) Privacy-preserving activity scheduling on mobile devices. In: ACM CODASPY","DOI":"10.1145\/1943513.1943549"},{"key":"300_CR4","unstructured":"Bjesse P, Bor\u00e4lv A (2004) Dag-aware circuit compression for formal verification. In: ICCAD"},{"key":"300_CR5","doi-asserted-by":"crossref","unstructured":"Bogdanov D, Laur S, Willemson J (2008) Sharemind: a framework for fast privacy-preserving computations. In: ESORICS","DOI":"10.1007\/978-3-540-88313-5_13"},{"key":"300_CR6","doi-asserted-by":"crossref","unstructured":"Bogetoft P, Christensen DL, Damg\u00e5rd I, Geisler M, Jakobsen T, Kr\u00f8igaard M, Nielsen JD, Nielsen JB, Nielsen K, Pagter J et al (2009) Secure multiparty computation goes live. In: FC","DOI":"10.1007\/978-3-642-03549-4_20"},{"issue":"1","key":"300_CR7","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1016\/j.jcss.2010.06.011","volume":"77","author":"D Buchfuhrer","year":"2011","unstructured":"Buchfuhrer D, Umans C (2011) The complexity of Boolean formula minimization. J. Comput. Syst. Sci. 77(1):142\u2013153","journal-title":"J. Comput. Syst. Sci."},{"key":"300_CR8","doi-asserted-by":"crossref","unstructured":"Buescher N, Holzer A, Weber A, Katzenbeisser S (2016) Compiling low depth circuits for practical secure computation. In: ESORICS","DOI":"10.1007\/978-3-319-45741-3_5"},{"key":"300_CR9","doi-asserted-by":"crossref","unstructured":"Buescher N, Kretzmer D, Jindal A, Stefan K (2016) Scalable secure computation from ansi-c. In: IEEE WIFS","DOI":"10.1109\/WIFS.2016.7823913"},{"key":"300_CR10","unstructured":"B\u00fcscher N, Katzenbeisser S (2015) Faster secure computation through automatic parallelization. In: USENIX Security"},{"key":"300_CR11","doi-asserted-by":"crossref","unstructured":"Clarke EM, Kroening D, Lerda F (2004) A tool for checking ANSI-C programs. In: TACAS","DOI":"10.1007\/978-3-540-24730-2_15"},{"key":"300_CR12","doi-asserted-by":"crossref","unstructured":"Clarke EM, Kroening D, Yorav K (2003) Behavioral consistency of C and verilog programs using bounded model checking. In: DAC","DOI":"10.21236\/ADA461052"},{"key":"300_CR13","unstructured":"Courtois N, Hulme D, Mourouzis T (2011) Solving circuit optimisation problems in cryptography and cryptanalysi. IACR cryptology ePrint archive"},{"key":"300_CR14","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd I, Pastro V, Smart NP, Zakarias S (2012) Multiparty computation from somewhat homomorphic encryption. In: CRYPTO","DOI":"10.1007\/978-3-642-32009-5_38"},{"key":"300_CR15","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1147\/rd.254.0272","volume":"25","author":"JA Darringer","year":"1981","unstructured":"Darringer JA, Joyner WH, Berman CL, Trevillyan L (1981) Logic synthesis through local transformations. IBM J Res Dev 25:272\u2013280","journal-title":"IBM J Res Dev"},{"key":"300_CR16","doi-asserted-by":"crossref","unstructured":"Demmler D, Dessouky G, Koushanfar F, Sadeghi AR, Schneider T, Zeitouni S (2015) Automated synthesis of optimized circuits for secure computation. In: ACM CCS","DOI":"10.1145\/2810103.2813678"},{"key":"300_CR17","doi-asserted-by":"crossref","unstructured":"Demmler D, Schneider T, Zohner M (2015) ABY\u2014a framework for efficient mixed-protocol secure two-party computation. In: NDSS","DOI":"10.14722\/ndss.2015.23113"},{"key":"300_CR18","doi-asserted-by":"crossref","unstructured":"Erkin Z, Franz M, Guajardo J, Katzenbeisser S, Lagendijk I, Toft T (2009) Privacy-preserving face recognition. In: PETS","DOI":"10.1007\/978-3-642-03168-7_14"},{"key":"300_CR19","doi-asserted-by":"crossref","unstructured":"Franz M, Holzer A, Katzenbeisser S, Schallhart C, Veith H (2014) CBMC-GC: an ANSI C compiler for secure two-party computations. In: Compiler construction CC","DOI":"10.1007\/978-3-642-54807-9_15"},{"key":"300_CR20","doi-asserted-by":"crossref","unstructured":"Goldreich O, Micali S, Wigderson A (1987) How to play any mental game or a completeness theorem for protocols with honest majority. In: ACM STOC","DOI":"10.1145\/28395.28420"},{"issue":"3","key":"300_CR21","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1145\/233551.233553","volume":"43","author":"O Goldreich","year":"1996","unstructured":"Goldreich O, Ostrovsky R (1996) Software protection and simulation on oblivious rams. J ACM 43(3):431\u2013473","journal-title":"J ACM"},{"key":"300_CR22","doi-asserted-by":"crossref","unstructured":"Goudarzi D, Rivain M (2016) On the multiplicative complexity of boolean functions and bitsliced higher-order masking. In: CHES","DOI":"10.1007\/978-3-662-53140-2_22"},{"key":"300_CR23","doi-asserted-by":"crossref","unstructured":"Henecka W, K\u00f6gl S, Sadeghi AR, Schneider T, Wehrenberg I (2010) TASTY: tool for automating secure two-party computations. In: ACM CCS","DOI":"10.1145\/1866307.1866358"},{"key":"300_CR24","doi-asserted-by":"crossref","unstructured":"Holzer A, Franz M, Katzenbeisser S, Veith H (2012) Secure two-party computations in ANSI C. In: ACM CCS","DOI":"10.1145\/2382196.2382278"},{"key":"300_CR25","doi-asserted-by":"crossref","unstructured":"Kolesnikov V, Sadeghi AR, Schneider T (2009) Improved garbled circuit building blocks and applications to auctions and computing minima. In: CANS","DOI":"10.1007\/978-3-642-10433-6_1"},{"key":"300_CR26","unstructured":"Kolesnikov V, Schneider T (2008) Improved garbled circuit: free XOR gates and applications. In: ICALP"},{"key":"300_CR27","unstructured":"Kreuter B, Shelat A, Mood B, Butler K (2013) PCF: a portable circuit format for scalable two-party secure computation. In: USENIX security"},{"key":"300_CR28","doi-asserted-by":"crossref","unstructured":"Kreuter B, Shelat A, Shen C (2012) Billion-gate secure computation with malicious adversaries. In: USENIX security","DOI":"10.1007\/978-3-642-20465-4_22"},{"key":"300_CR29","doi-asserted-by":"crossref","unstructured":"Kuehlmann A (2004) Dynamic transition relation simplification for bounded property checking. In: IEEE ICCAD","DOI":"10.1109\/ICCAD.2004.1382542"},{"key":"300_CR30","doi-asserted-by":"crossref","unstructured":"Larraia E, Orsini E, Smart NP (2014) Dishonest majority multi-party computation for binary circuits. In: CRYPTO","DOI":"10.1007\/978-3-662-44381-1_28"},{"key":"300_CR31","doi-asserted-by":"crossref","unstructured":"Liu C, Huang Y, Shi E, Katz J, Hicks MW (2014) Automating efficient RAM-model secure computation. In: IEEE S&P","DOI":"10.1109\/SP.2014.46"},{"key":"300_CR32","doi-asserted-by":"crossref","unstructured":"Liu C, Wang XS, Nayak K, Huang Y, Shi E (2015) ObliVM: a programming framework for secure computation. In: IEEE S&P","DOI":"10.1109\/SP.2015.29"},{"key":"300_CR33","unstructured":"Malkhi D, Nisan N, Pinkas B, Sella Y (2004) Fairplay - secure two-party computation system. In: USENIX Security"},{"key":"300_CR34","doi-asserted-by":"crossref","unstructured":"Mishchenko A, Chatterjee S, Brayton R, Een N (2006) Improvements to combinational equivalence checking. In: IEEE ICCAD","DOI":"10.1109\/ICCAD.2006.320087"},{"key":"300_CR35","doi-asserted-by":"crossref","unstructured":"Mishchenko A, Chatterjee S, Brayton RK (2006) Dag-aware AIG rewriting a fresh look at combinational logic synthesis. In: DAC","DOI":"10.1145\/1146909.1147048"},{"key":"300_CR36","doi-asserted-by":"crossref","unstructured":"Mood B, Gupta D, Carter H, Butler K, Traynor P (2016) Frigate: a validated, extensible, and efficient compiler and interpreter for secure computation. In: IEEE Euro S&P","DOI":"10.1109\/EuroSP.2016.20"},{"key":"300_CR37","doi-asserted-by":"crossref","unstructured":"Mood B, Letaw L, Butler K (2012) Memory-efficient garbled circuit generation for mobile devices. In: FC","DOI":"10.1007\/978-3-642-32946-3_19"},{"key":"300_CR38","doi-asserted-by":"crossref","unstructured":"Nielsen JB, Nordholt PS, Orlandi C, Burra SS (2012) A new approach to practical active-secure two-party computation. In: CRYPTO","DOI":"10.1007\/978-3-642-32009-5_40"},{"key":"300_CR39","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1109\/TEC.1958.5222579","volume":"3","author":"JE Robertson","year":"1958","unstructured":"Robertson JE (1958) A new class of digital division methods. IRE Trans Electron Comput 3:218\u2013222","journal-title":"IRE Trans Electron Comput"},{"key":"300_CR40","doi-asserted-by":"crossref","unstructured":"Schneider T, Zohner M (2013) GMW vs. Yao? Efficient secure two-party computation with low depth circuits. In: FC","DOI":"10.1007\/978-3-642-39884-1_23"},{"key":"300_CR41","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/BF02246615","volume":"13","author":"CP Schnorr","year":"1974","unstructured":"Schnorr CP (1974) Zwei lineare untere Schranken f\u00fcr die Komplexit\u00e4t Boolescher Funktionen. Computing 13:155\u2013171","journal-title":"Computing"},{"key":"300_CR42","doi-asserted-by":"crossref","unstructured":"Schr\u00f6pfer A, Kerschbaum F, M\u00fcller G (2011) L1\u2014an intermediate language for mixed-protocol secure computation. In: COMPSAC","DOI":"10.1109\/COMPSAC.2011.46"},{"key":"300_CR43","doi-asserted-by":"crossref","unstructured":"Songhori EM, Hussain SU, Sadeghi A, Schneider T, Koushanfar F (2015) Tinygarble: Highly compressed and scalable sequential garbled circuits. In: IEEE S&P","DOI":"10.1109\/SP.2015.32"},{"key":"300_CR44","unstructured":"Turan MS, Peralta R (2014) The multiplicative complexity of boolean functions on four and five variables. In: LightSec"},{"key":"300_CR45","doi-asserted-by":"crossref","unstructured":"Yao ACC (1982) Protocols for secure computations (extended abstract). In: IEEE\u00a0FOCS","DOI":"10.1109\/SFCS.1982.38"},{"key":"300_CR46","doi-asserted-by":"crossref","unstructured":"Yao ACC (1986) How to generate and exchange secrets (extended abstract). In: IEEE\u00a0FOCS","DOI":"10.1109\/SFCS.1986.25"},{"key":"300_CR47","unstructured":"Zahur S, Evans D (2015) Obliv-c: a language for extensible data-oblivious computation. IACR cryptology ePrint archive"}],"container-title":["Formal Methods in System Design"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10703-017-0300-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10703-017-0300-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10703-017-0300-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,3]],"date-time":"2019-10-03T09:13:23Z","timestamp":1570094003000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10703-017-0300-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,9,14]]},"references-count":47,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,11]]}},"alternative-id":["300"],"URL":"https:\/\/doi.org\/10.1007\/s10703-017-0300-0","relation":{},"ISSN":["0925-9856","1572-8102"],"issn-type":[{"type":"print","value":"0925-9856"},{"type":"electronic","value":"1572-8102"}],"subject":[],"published":{"date-parts":[[2017,9,14]]}}}