{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T23:22:34Z","timestamp":1771024954120,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,11,19]],"date-time":"2023-11-19T00:00:00Z","timestamp":1700352000000},"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":[[2023,11,19]]},"DOI":"10.1145\/3689945.3694803","type":"proceedings-article","created":{"date-parts":[[2024,11,19]],"date-time":"2024-11-19T18:23:11Z","timestamp":1732040591000},"page":"51-63","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["On the Synthesis of High-performance Homomorphic Boolean Circuits"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0009-6816-8903","authenticated-orcid":false,"given":"Mingfei","family":"Yu","sequence":"first","affiliation":[{"name":"Integrated Systems Laboratory, EPFL, Lausanne, Switzerland"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1724-1591","authenticated-orcid":false,"given":"Sergiu","family":"Carpov","sequence":"additional","affiliation":[{"name":"Arcium, Zug, Switzerland"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1312-2907","authenticated-orcid":false,"given":"Alessandro","family":"Tempia Calvino","sequence":"additional","affiliation":[{"name":"Integrated Systems Laboratory, EPFL, Lausanne, Switzerland"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7827-3215","authenticated-orcid":false,"given":"Giovanni","family":"De Micheli","sequence":"additional","affiliation":[{"name":"Integrated Systems Laboratory, EPFL, Lausanne, Switzerland"}]}],"member":"320","published-online":{"date-parts":[[2024,11,19]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Luca Amar\u00fa Pierre-Emmanuel Gaillardon and Giovanni De Micheli. 2015. The EPFL Combinational Benchmark Suite. In IWLS."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"Guillaume Bonnoron L\u00e9o Ducas and Max Fillinger. 2018. Large FHE Gates from Tensored Homomorphic Accumulator. In AFRICACRYPT. 217--251.","DOI":"10.1007\/978-3-319-89339-6_13"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2090236.2090262"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"Alessandro Tempia Calvino and Giovanni De Micheli. 2023. Technology Mapping Using Multi-Output Library Cells. In ICCAD. 1--9.","DOI":"10.1109\/ICCAD57390.2023.10323999"},{"key":"e_1_3_2_1_5_1","unstructured":"Sergiu Carpov. 2024. A Fast Heuristic for Mapping Boolean Circuits to Functional Bootstrapping. Cryptology ePrint Archive Paper 2024\/1204."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2732516.2732520"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"Sergiu Carpov Malika Izabach\u00e8ne and Victor Mollimard. 2019. New Techniques for Multi-value Input Homomorphic Evaluation and Applications. In CT-RSA. 106--126.","DOI":"10.1007\/978-3-030-12612-4_6"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-019-09319-x"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","unstructured":"Jason Cong Chang Wu and Yuzheng Ding. 1999. Cut Ranking and Pruning: Enabling a General and Efficient FPGA Mapping Solution. In FPGA. 29--35.","DOI":"10.1145\/296399.296425"},{"key":"e_1_3_2_1_10_1","volume-title":"FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second. In EUROCRYPT. 617--640.","author":"Ducas L\u00e9o","year":"2015","unstructured":"L\u00e9o Ducas and Daniele Micciancio. 2015. FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second. In EUROCRYPT. 617--640."},{"key":"e_1_3_2_1_11_1","unstructured":"Junfeng Fan and Frederik Vercauteren. 2012. Somewhat Practical Fully Homomorphic Encryption. Cryptology ePrint Archive Paper 2012\/144."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536440"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","unstructured":"Craig Gentry Amit Sahai and Brent Waters. 2013. Homomorphic Encryption from Learning with Errors: Conceptually-Simpler Asymptotically-Faster Attribute-Based. In CRYPTO. 75--92.","DOI":"10.1007\/978-3-642-40041-4_5"},{"key":"e_1_3_2_1_14_1","volume-title":"Yurii Sushko, and Bryant Gipson.","author":"Gorantala Shruthi","year":"2021","unstructured":"Shruthi Gorantala, Rob Springer, Sean Purser-Haskell, William Lam, Royce Wilson, Asra Ali, Eric P. Astor, Itai Zukerman, Sam Ruth, Christoph Dibak, Phillipp Schoppmann, Sasha Kulankhina, Alain Forget, David Marn, Cameron Tew, Rafael Misoczki, Bernat Guillen, Xinyu Ye, Dennis Kraft, Damien Desfontaines, Aishe Krishnamurthy, Miguel Guevara, Irippuge Milinda Perera, Yurii Sushko, and Bryant Gipson. 2021. A General Purpose Transpiler for Fully Homomorphic Encryption. Technical Report. Google LLC."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"Charles Gouert and Nektarios Georgios Tsoutsos. 2020. Romeo: conversion and evaluation of HDL designs in the encrypted domain. In DAC.","DOI":"10.1109\/DAC18072.2020.9218579"},{"key":"e_1_3_2_1_16_1","first-page":"1971","article-title":"AutoHoG: Automating Homomorphic Gate Design for Large-Scale Logic Circuit Evaluation","volume":"43","author":"Guan Zhenyu","year":"2024","unstructured":"Zhenyu Guan, Ran Mao, Qianyun Zhang, Zhou Zhang, Zian Zhao, and Song Bian. 2024. AutoHoG: Automating Homomorphic Gate Design for Large-Scale Logic Circuit Evaluation. IEEE TCAD, Vol. 43, 7 (2024), 1971--1983.","journal-title":"IEEE TCAD"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2006.882119"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"crossref","unstructured":"Kotaro Matsuoka Yusuke Hoshizuki Takashi Sato and Song Bian. 2021. Towards Better Standard Cell Library: Optimizing Compound Logic Gates for TFHE. In WAHC.","DOI":"10.1145\/3474366.3486927"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"crossref","unstructured":"Alan Mishchenko Sungmin Cho Satrajit Chatterjee and Robert Brayton. 2007. Combinational and Sequential Mapping with Priority Cuts. In ICCAD. 354--361.","DOI":"10.1109\/ICCAD.2007.4397290"},{"key":"e_1_3_2_1_20_1","unstructured":"Johannes Mono Kamil Kluczniak and Tim G\u00fcneysu. 2023. Improved Circuit Synthesis with Amortized Bootstrapping for FHEW-like Schemes. Cryptology ePrint Archive Paper 2023\/1223."},{"key":"e_1_3_2_1_21_1","first-page":"169","article-title":"On Data Banks and Privacy Homomorphisms","volume":"4","author":"Rivest Ronald L.","year":"1978","unstructured":"Ronald L. Rivest, Len Adleman, and Michael L. Dertouzos. 1978. On Data Banks and Privacy Homomorphisms. Foundations of Secure Computation, Vol. 4, 11 (1978), 169--180.","journal-title":"Foundations of Secure Computation"},{"key":"e_1_3_2_1_22_1","volume-title":"Dewmini Sudara Marakkalage, and Giovanni De Micheli.","author":"Soeken Mathias","year":"2022","unstructured":"Mathias Soeken, Heinz Riener, Winston Haaswijk, Eleonora Testa, Bruno Schmitt, Giulia Meuli, Fereshte Mozafari, Siang-Yun Lee, Alessandro Tempia Calvino, Dewmini Sudara Marakkalage, and Giovanni De Micheli. 2022. The EPFL Logic Synthesis Libraries. arxiv: 1805.05121"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","unstructured":"Alessandro Tempia Calvino Heinz Riener Shubham Rai Akash Kumar and Giovanni De Micheli. 2022. A Versatile Mapping Approach for Technology Mapping and Graph Optimization. In ASPDAC. 410--416.","DOI":"10.1109\/ASP-DAC52403.2022.9712552"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"crossref","unstructured":"Feng Wang Liren Zhu Jiaxi Zhang Lei Li Yang Zhang and Guojie Luo. 2020. Dual-Output LUT Merging during FPGA Technology Mapping. In ICCAD. 1--9.","DOI":"10.1145\/3400302.3415617"},{"key":"e_1_3_2_1_25_1","unstructured":"Claire Wolf. [n. d.]. Yosys Open SYnthesis Suite. https:\/\/yosyshq.net\/yosys\/."},{"key":"e_1_3_2_1_26_1","volume-title":"Concrete: TFHE Compiler that Converts Python Programs into FHE Equivalent. https:\/\/github.com\/zama-ai\/co","year":"2022","unstructured":"Zama. 2022. Concrete: TFHE Compiler that Converts Python Programs into FHE Equivalent. https:\/\/github.com\/zama-ai\/co"}],"event":{"name":"CCS '24: ACM SIGSAC Conference on Computer and Communications Security","location":"Salt Lake City UT USA","acronym":"CCS '24","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 12th Workshop on Encrypted Computing & Applied Homomorphic Cryptography"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3689945.3694803","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3689945.3694803","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,23]],"date-time":"2025-08-23T18:43:24Z","timestamp":1755974604000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3689945.3694803"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,19]]},"references-count":26,"alternative-id":["10.1145\/3689945.3694803","10.1145\/3689945"],"URL":"https:\/\/doi.org\/10.1145\/3689945.3694803","relation":{},"subject":[],"published":{"date-parts":[[2023,11,19]]},"assertion":[{"value":"2024-11-19","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}