{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T01:37:11Z","timestamp":1740101831755,"version":"3.37.3"},"reference-count":29,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,5,1]],"date-time":"2023-05-01T00:00:00Z","timestamp":1682899200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,5,1]],"date-time":"2023-05-01T00:00:00Z","timestamp":1682899200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100007140","name":"Synopsys","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100007140","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,5,1]]},"DOI":"10.1109\/host55118.2023.10133215","type":"proceedings-article","created":{"date-parts":[[2023,5,25]],"date-time":"2023-05-25T17:29:36Z","timestamp":1685035776000},"page":"304-314","source":"Crossref","is-referenced-by-count":3,"title":["Generating Lower-Cost Garbled Circuits: Logic Synthesis Can Help"],"prefix":"10.1109","author":[{"given":"Mingfei","family":"Yu","sequence":"first","affiliation":[{"name":"EPFL Lausanne,Integrated Systems Laboratory,Switzerland"}]},{"given":"Giovanni De","family":"Micheli","sequence":"additional","affiliation":[{"name":"EPFL Lausanne,Integrated Systems Laboratory,Switzerland"}]}],"member":"263","reference":[{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978410"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2022.3147444"},{"key":"ref15","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1007\/s12095-018-0297-2","article-title":"The multiplicative com-plexity of 6-variable boolean functions","volume":"11","author":"\u00e7 alik","year":"2019","journal-title":"Cryptography and Communi-cations"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(99)00182-6"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.23919\/DATE48585.2020.9116467"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/HST.2019.8740831"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/100216.100287"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1986.25"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.01.030"},{"key":"ref16","first-page":"1","article-title":"The role of multiplicative complexity in compiling low t -count oracle circuits","author":"meuli","year":"2019","journal-title":"IEEE\/ACM International Conference on Computer-Aided Design"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/296399.296425"},{"key":"ref18","article-title":"The multiplicative complexity of interval checking","author":"haner","year":"2022","journal-title":"arXiv preprint arXiv 2201 10200"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/321229.321232"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/336992.337028"},{"key":"ref26","doi-asserted-by":"crossref","first-page":"502","DOI":"10.1007\/978-3-540-24605-3_37","article-title":"An extensible sat-solver","volume":"2919","author":"e\u00e9 n","year":"2004","journal-title":"Lecture Notes in Computer Science"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-20323-8_9"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.23919\/DATE.2019.8715185"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2020.3032625"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/FPT.2013.6718374"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ASPDAC.2017.7858312"},{"key":"ref27","article-title":"The epfl logic synthesis libraries","author":"soeken","year":"2018","journal-title":"arXiv preprint arXiv 1805 05121"},{"key":"ref29","article-title":"The epfl combinational benchmark suite","author":"amar\u00fa","year":"2015","journal-title":"Proc of the International Workshop on Logic Synthesis"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46803-6_8"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70583-3_40"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2015.32"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2008.32"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/11889663_10"},{"key":"ref6","first-page":"2505","article-title":"Delphi: A cryptographic inference service for neural networks","author":"mishra","year":"2020","journal-title":"29th USENIX Security Sym-posium"},{"key":"ref5","first-page":"201","article-title":"Cryptonets: Applying neural networks to encrypted data with high throughput and accuracy","author":"gilad-bachrach","year":"2016","journal-title":"Int Conference on Machine Learning"}],"event":{"name":"2023 IEEE International Symposium on Hardware Oriented Security and Trust (HOST)","start":{"date-parts":[[2023,5,1]]},"location":"San Jose, CA, USA","end":{"date-parts":[[2023,5,4]]}},"container-title":["2023 IEEE International Symposium on Hardware Oriented Security and Trust (HOST)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10132842\/10132914\/10133215.pdf?arnumber=10133215","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,12]],"date-time":"2023-06-12T17:56:10Z","timestamp":1686592570000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10133215\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,1]]},"references-count":29,"URL":"https:\/\/doi.org\/10.1109\/host55118.2023.10133215","relation":{},"subject":[],"published":{"date-parts":[[2023,5,1]]}}}