{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,8]],"date-time":"2026-09-08T14:35:22Z","timestamp":1788878122627,"version":"build-2803163510"},"reference-count":39,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2025,2,24]],"date-time":"2025-02-24T00:00:00Z","timestamp":1740355200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"National Science Foundation","award":["2239334"],"award-info":[{"award-number":["2239334"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Des. Autom. Electron. Syst."],"published-print":{"date-parts":[[2025,5,31]]},"abstract":"<jats:p>Homomorphic encryption is a powerful privacy-preserving technology that is notoriously difficult to configure and use, even for experts. The key difficulties include restrictive programming models of homomorphic schemes and choosing suitable parameters for an application. In this tutorial, we outline methodologies to solve these issues and allow for conversion of any application to the encrypted domain using both leveled and fully homomorphic encryption.<\/jats:p>\n          <jats:p>The first approach, called Walrus, is suitable for arithmetic-intensive applications with limited depth and applications with high throughput requirements. Walrus provides an intuitive programming interface and handles parameterization automatically by analyzing the application and gathering statistics such as homomorphic noise growth to derive a parameter set tuned specifically for the application. We provide an in-depth example of this approach in the form of a neural network inference as well as guidelines for using Walrus effectively.<\/jats:p>\n          <jats:p>Conversely, the second approach (HELM) takes existing HDL designs and converts them to the encrypted domain for secure outsourcing on powerful cloud servers. Unlike Walrus, HELM supports FHE backends and is well-suited for complex applications. At a high level, HELM consumes netlists and is capable of performing logic gate operations homomorphically on encryptions of individual bits. HELM incorporates both CPU and GPU acceleration by taking advantage of the inherent parallelism provided by Boolean circuits. As a case study, we walk through the process of taking an off-the-shelf HDL design in the form of AES-128 decryption and running it in the encrypted domain with HELM.<\/jats:p>","DOI":"10.1145\/3715877","type":"journal-article","created":{"date-parts":[[2025,2,3]],"date-time":"2025-02-03T09:54:06Z","timestamp":1738576446000},"page":"1-31","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Data Privacy Made Easy: Enhancing Applications with Homomorphic Encryption"],"prefix":"10.1145","volume":"30","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7670-830X","authenticated-orcid":false,"given":"Charles","family":"Gouert","sequence":"first","affiliation":[{"name":"Electrical and Computer Engineering, University of Delaware, Newark, United States"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5769-0124","authenticated-orcid":false,"given":"Nektarios Georgios","family":"Tsoutsos","sequence":"additional","affiliation":[{"name":"Electrical and Computer Engineering, University of Delaware, Newark, United States"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2025,2,24]]},"reference":[{"key":"e_1_3_1_2_2","unstructured":"Ehud Aharoni Allon Adir Moran Baruch Nir Drucker Gilad Ezov Ariel Farkash Lev Greenberg Ramy Masalha Guy Moshkowich Dov Murik and others. 2020. HeLayers: A tile tensors framework for large neural networks on encrypted data. (2020)."},{"key":"e_1_3_1_3_2","unstructured":"akashjha25. 2021. AES Decryption. https:\/\/github.com\/akashjha25\/aes-decryption\/tree\/main"},{"key":"e_1_3_1_4_2","series-title":"WAHC\u201922","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1145\/3560827.3563379","volume-title":"Proceedings of the 10th Workshop on Encrypted Computing & Applied Homomorphic Cryptography","author":"Badawi Ahmad Al","year":"2022","unstructured":"Ahmad Al Badawi, Jack Bates, Flavio Bergamaschi, David Bruce Cousins, Saroja Erabelli, Nicholas Genise, Shai Halevi, Hamish Hunt, Andrey Kim, Yongwoo Lee, et al. 2022. OpenFHE: Open-source fully homomorphic encryption library. In Proceedings of the 10th Workshop on Encrypted Computing & Applied Homomorphic Cryptography (Los Angeles, CA, USA) (WAHC\u201922). Association for Computing Machinery, New York, NY, USA, 53\u201363. DOI:10.1145\/3560827.3563379"},{"key":"e_1_3_1_5_2","article-title":"Homomorphic Encryption Standard","author":"Albrecht Martin","year":"2019","unstructured":"Martin Albrecht, Melissa Chase, Hao Chen, Jintai Ding, Shafi Goldwasser, Sergey Gorbunov, Shai Halevi, Jeffrey Hoffstein, Kim Laine, Kristin Lauter, et\u00a0al. 2019. Homomorphic Encryption Standard. Cryptology ePrint Archive, Paper 2019\/939. https:\/\/eprint.iacr.org\/2019\/939","journal-title":"Cryptology ePrint Archive, Paper 2019\/939"},{"key":"e_1_3_1_6_2","first-page":"307","volume-title":"Proceedings of the April 30\u2013May 2, 1968, Spring Joint Computer Conference","author":"Batcher Kenneth E.","year":"1968","unstructured":"Kenneth E. Batcher. 1968. Sorting networks and their applications. In Proceedings of the April 30\u2013May 2, 1968, Spring Joint Computer Conference. Association for Computing Machinery, New York, NY, USA, 307\u2013314."},{"key":"e_1_3_1_7_2","unstructured":"Ayoub Benaissa Bilal Retiat Bogdan Cebere and Alaa Eddine Belfedhal. 2021. TenSEAL: A library for encrypted tensor operations using homomorphic encryption. arxiv:2104.03152 [cs.CR]"},{"issue":"3","key":"e_1_3_1_8_2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2633600","article-title":"(Leveled) fully homomorphic encryption without bootstrapping","volume":"6","author":"Brakerski Zvika","year":"2014","unstructured":"Zvika Brakerski, Craig Gentry, and Vinod Vaikuntanathan. 2014. (Leveled) fully homomorphic encryption without bootstrapping. ACM Transactions on Computation Theory (TOCT) 6, 3 (2014), 1\u201336.","journal-title":"ACM Transactions on Computation Theory (TOCT)"},{"key":"e_1_3_1_9_2","series-title":"CAV\u201910","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1007\/978-3-642-14295-6_5","volume-title":"Proceedings of the 22nd International Conference on Computer Aided Verification","author":"Brayton Robert","year":"2010","unstructured":"Robert Brayton and Alan Mishchenko. 2010. ABC: An academic industrial-strength verification tool. In Proceedings of the 22nd International Conference on Computer Aided Verification (Edinburgh, UK) (CAV\u201910). Springer-Verlag, Berlin, 24\u201340. DOI:10.1007\/978-3-642-14295-6_5"},{"key":"e_1_3_1_10_2","first-page":"663","volume-title":"IEEE ISCAS","author":"Brglez Franc","year":"1985","unstructured":"Franc Brglez. 1985. A neutral netlist of 10 combinatorial benchmark circuits and a target translator in FORTRAN. In IEEE ISCAS. IEEE, Kyoto, Japan, 663\u2013698."},{"key":"e_1_3_1_11_2","first-page":"1929","volume-title":"IEEE ISCAS","author":"Brglez Franc","year":"1989","unstructured":"Franc Brglez, David Bryan, and Krzysztof Kozminski. 1989. Combinational profiles of sequential benchmark circuits. In IEEE ISCAS. IEEE, Portland, OR, USA, 1929\u20131934."},{"key":"e_1_3_1_12_2","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1007\/978-3-319-70694-8_15","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2017","author":"Cheon Jung Hee","year":"2017","unstructured":"Jung Hee Cheon, Andrey Kim, Miran Kim, and Yongsoo Song. 2017. Homomorphic encryption for arithmetic of approximate numbers. In Advances in Cryptology \u2013 ASIACRYPT 2017, Tsuyoshi Takagi and Thomas Peyrin (Eds.). Springer International Publishing, Cham, 409\u2013437."},{"issue":"1","key":"e_1_3_1_13_2","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1007\/s00145-019-09319-x","article-title":"TFHE: Fast fully homomorphic encryption over the torus","volume":"33","author":"Chillotti Ilaria","year":"2020","unstructured":"Ilaria Chillotti, Nicolas Gama, Mariya Georgieva, and Malika Izabach\u00e8ne. 2020. TFHE: Fast fully homomorphic encryption over the torus. Journal of Cryptology 33, 1 (2020), 34\u201391.","journal-title":"Journal of Cryptology"},{"key":"e_1_3_1_14_2","unstructured":"Ilaria Chillotti Marc Joye Damien Ligier Jean-Baptiste Orfila and Samuel Tap. 2020. CONCRETE: Concrete Operates oN Ciphertexts Rapidly by Extending TfhE."},{"key":"e_1_3_1_15_2","volume-title":"A Robust and Verifiable Cryptographically Secure Election Scheme","author":"Cohen Josh D.","year":"1985","unstructured":"Josh D. Cohen and Michael J. Fischer. 1985. A Robust and Verifiable Cryptographically Secure Election Scheme. Yale University. Department of Computer Science, New Haven, CT, USA."},{"key":"e_1_3_1_16_2","first-page":"210","article-title":"Accurate low-degree polynomial approximation of non-polynomial operators for fast private inference in homomorphic encryption","volume":"6","author":"Dang Jingtian","year":"2024","unstructured":"Jingtian Dang, Jianming Tong, Anupam Golder, Cong Hao, Arijit Raychowdhury, and Tushar Krishna. 2024. Accurate low-degree polynomial approximation of non-polynomial operators for fast private inference in homomorphic encryption. Proceedings of Machine Learning and Systems 6 (2024), 210\u2013223.","journal-title":"Proceedings of Machine Learning and Systems"},{"key":"e_1_3_1_17_2","first-page":"201","volume-title":"Proceedings of the 33rd International Conference on International Conference on Machine Learning - Volume 48 (ICML\u201916)","author":"Dowlin Nathan","year":"2016","unstructured":"Nathan Dowlin, Ran Gilad-Bachrach, Kim Laine, Kristin Lauter, Michael Naehrig, and John Wernsing. 2016. CryptoNets: Applying neural networks to encrypted data with high throughput and accuracy. In Proceedings of the 33rd International Conference on International Conference on Machine Learning - Volume 48 (ICML\u201916). JMLR.org, New York, NY, USA, 201\u2013210."},{"key":"e_1_3_1_18_2","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1007\/978-3-662-46800-5_24","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2015","author":"Ducas L\u00e9o","year":"2015","unstructured":"L\u00e9o Ducas and Daniele Micciancio. 2015. FHEW: Bootstrapping homomorphic encryption in less than a second. In Advances in Cryptology \u2013 EUROCRYPT 2015, Elisabeth Oswald and Marc Fischlin (Eds.). Springer Berlin, Berlin, 617\u2013640."},{"issue":"4","key":"e_1_3_1_19_2","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","article-title":"A public key cryptosystem and a signature scheme based on discrete logarithms","volume":"31","author":"ElGamal Taher","year":"1985","unstructured":"Taher ElGamal. 1985. A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Transactions on Information Theory 31, 4 (1985), 469\u2013472.","journal-title":"IEEE Transactions on Information Theory"},{"key":"e_1_3_1_20_2","unstructured":"Junfeng Fan and Frederik Vercauteren. 2012. Somewhat practical fully homomorphic encryption. https:\/\/eprint.iacr.org\/2012\/144"},{"key":"e_1_3_1_21_2","article-title":"REDsec: Running encrypted discretized neural networks in seconds","author":"Folkerts Lars","year":"2021","unstructured":"Lars Folkerts, Charles Gouert, and Nektarios Georgios Tsoutsos. 2021. REDsec: Running encrypted discretized neural networks in seconds. Cryptology ePrint Archive, Report 2021\/1100.","journal-title":"Cryptology ePrint Archive, Report 2021\/1100"},{"key":"e_1_3_1_22_2","series-title":"STOC\u201909","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1145\/1536414.1536440","volume-title":"Proceedings of the Forty-First Annual ACM Symposium on Theory of Computing","author":"Gentry Craig","year":"2009","unstructured":"Craig Gentry. 2009. Fully homomorphic encryption using ideal lattices. In Proceedings of the Forty-First Annual ACM Symposium on Theory of Computing (Bethesda, MD, USA) (STOC\u201909). Association for Computing Machinery, New York, NY, USA, 169\u2013178. DOI:10.1145\/1536414.1536440"},{"key":"e_1_3_1_23_2","unstructured":"Shruthi Gorantala Rob Springer Sean Purser-Haskell William Lam Royce Wilson Asra Ali Eric P. Astor Itai Zukerman Sam Ruth Christoph Dibak and others. 2021. A General Purpose Transpiler for Fully Homomorphic Encryption."},{"key":"e_1_3_1_24_2","unstructured":"Charles Gouert Vinu Joseph Steven Dalton Cedric Augonnet Michael Garland and Nektarios Georgios Tsoutsos. 2023. Accelerated encrypted execution of general-purpose applications. Cryptology ePrint Archive Paper 2023\/641. https:\/\/eprint.iacr.org\/2023\/641"},{"key":"e_1_3_1_25_2","article-title":"HELM: Navigating homomorphic encryption through gates and lookup tables","author":"Gouert Charles","year":"2023","unstructured":"Charles Gouert, Dimitris Mouris, and Nektarios Georgios Tsoutsos. 2023. HELM: Navigating homomorphic encryption through gates and lookup tables. Cryptology ePrint Archive, Paper 2023\/1382. https:\/\/eprint.iacr.org\/2023\/1382","journal-title":"Cryptology ePrint Archive, Paper 2023\/1382"},{"key":"e_1_3_1_26_2","doi-asserted-by":"publisher","DOI":"10.56553\/popets-2023-0075"},{"key":"e_1_3_1_27_2","first-page":"1","volume-title":"2020 57th ACM\/IEEE Design Automation Conference (DAC\u201920)","author":"Gouert Charles","year":"2020","unstructured":"Charles Gouert and Nektarios Georgios Tsoutsos. 2020. Romeo: Conversion and evaluation of HDL designs in the encrypted domain. In 2020 57th ACM\/IEEE Design Automation Conference (DAC\u201920). IEEE, San Francisco, CA, USA, 1\u20136."},{"key":"e_1_3_1_28_2","unstructured":"Andy Greenberg. 2009. IBM\u2019s blindfolded calculator. https:\/\/www.forbes.com\/forbes\/2009\/0713\/breakthroughs-privacy-super-secret-encryption.html?sh=5a71e2a37124"},{"key":"e_1_3_1_29_2","first-page":"4007","volume-title":"30th USENIX Security Symposium (USENIX Security 21)","author":"Matsuoka Kotaro","year":"2021","unstructured":"Kotaro Matsuoka, Ryotaro Banno, Naoki Matsumoto, Takashi Sato, and Song Bian. 2021. Virtual secure platform: A five-stage pipeline processor over TFHE. In 30th USENIX Security Symposium (USENIX Security 21). USENIX Association, Virtual, 4007\u20134024."},{"key":"e_1_3_1_30_2","unstructured":"Microsoft Research. 2023. Microsoft SEAL (release 4.1). Retrieved from https:\/\/github.com\/Microsoft\/SEAL"},{"issue":"2","key":"e_1_3_1_31_2","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1109\/LCA.2018.2812814","article-title":"Terminator suite: Benchmarking privacy-preserving architectures","volume":"17","author":"Mouris Dimitris","year":"2018","unstructured":"Dimitris Mouris, Nektarios Georgios Tsoutsos, and Michail Maniatakos. 2018. Terminator suite: Benchmarking privacy-preserving architectures. IEEE Computer Architecture Letters 17, 2 (2018), 122\u2013125.","journal-title":"IEEE Computer Architecture Letters"},{"key":"e_1_3_1_32_2","series-title":"EUROCRYPT\u201999","first-page":"223","volume-title":"Proceedings of the 17th International Conference on Theory and Application of Cryptographic Techniques","author":"Paillier Pascal","year":"1999","unstructured":"Pascal Paillier. 1999. Public-key cryptosystems based on composite degree residuosity classes. In Proceedings of the 17th International Conference on Theory and Application of Cryptographic Techniques (Prague, Czech Republic) (EUROCRYPT\u201999). Springer-Verlag, Berlin, 223\u2013238."},{"key":"e_1_3_1_33_2","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1109\/HPCA51647.2021.00013","volume-title":"2021 IEEE International Symposium on High-Performance Computer Architecture (HPCA\u201921)","author":"Reagen Brandon","year":"2021","unstructured":"Brandon Reagen, Woo-Seok Choi, Yeongil Ko, Vincent T. Lee, Hsien-Hsin S. Lee, Gu-Yeon Wei, and David Brooks. 2021. Cheetah: Optimizing and accelerating homomorphic encryption for private inference. In 2021 IEEE International Symposium on High-Performance Computer Architecture (HPCA\u201921). IEEE, Seoul, South Korea, 26\u201339."},{"issue":"6","key":"e_1_3_1_34_2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1568318.1568324","article-title":"On lattices, learning with errors, random linear codes, and cryptography","volume":"56","author":"Regev Oded","year":"2009","unstructured":"Oded Regev. 2009. On lattices, learning with errors, random linear codes, and cryptography. Journal of the ACM (JACM) 56, 6 (2009), 1\u201340.","journal-title":"Journal of the ACM (JACM)"},{"issue":"2","key":"e_1_3_1_35_2","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1145\/359340.359342","article-title":"A method for obtaining digital signatures and public-key cryptosystems","volume":"21","author":"Rivest Ronald L.","year":"1978","unstructured":"Ronald L. Rivest, Adi Shamir, and Leonard Adleman. 1978. A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 21, 2 (1978), 120\u2013126.","journal-title":"Commun. ACM"},{"key":"e_1_3_1_36_2","unstructured":"Rostin Shokri Charles Gouert and Nektarios Georgios Tsoutsos. 2023. MatcHEd: Privacy-preserving set similarity based on MinHash. https:\/\/github.com\/TrustworthyComputing\/minhash-HE\/blob\/main\/MatcHEd.pdf"},{"key":"e_1_3_1_37_2","doi-asserted-by":"crossref","first-page":"831","DOI":"10.1007\/s00779-017-1056-7","article-title":"Utilizing fully homomorphic encryption to implement secure medical computation in smart cities","volume":"21","author":"Sun Xiaoqiang","year":"2017","unstructured":"Xiaoqiang Sun, Peng Zhang, Mehdi Sookhak, Jianping Yu, and Weixin Xie. 2017. Utilizing fully homomorphic encryption to implement secure medical computation in smart cities. Personal and Ubiquitous Computing 21 (2017), 831\u2013839.","journal-title":"Personal and Ubiquitous Computing"},{"key":"e_1_3_1_38_2","doi-asserted-by":"crossref","first-page":"1092","DOI":"10.1109\/SP40001.2021.00068","volume-title":"2021 IEEE Symposium on Security and Privacy (SP\u201921)","author":"Viand Alexander","year":"2021","unstructured":"Alexander Viand, Patrick Jattke, and Anwar Hithnawi. 2021. SoK: Fully homomorphic encryption compilers. In 2021 IEEE Symposium on Security and Privacy (SP\u201921). IEEE, IEEE, San Francisco, CA, USA, 1092\u20131108."},{"key":"e_1_3_1_39_2","article-title":"Yosys Open SYnthesis Suite","author":"Wolf Clifford","year":"2012","unstructured":"Clifford Wolf. 2012. Yosys Open SYnthesis Suite. http:\/\/www.clifford.at\/yosys\/","journal-title":"http:\/\/www.clifford.at\/yosys\/"},{"key":"e_1_3_1_40_2","unstructured":"Zama. 2022. TFHE-rs: A pure Rust implementation of the TFHE scheme for Boolean and integer arithmetics over encrypted data. https:\/\/github.com\/zama-ai\/tfhe-rs"}],"container-title":["ACM Transactions on Design Automation of Electronic Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3715877","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3715877","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T01:18:48Z","timestamp":1750295928000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3715877"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2,24]]},"references-count":39,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,5,31]]}},"alternative-id":["10.1145\/3715877"],"URL":"https:\/\/doi.org\/10.1145\/3715877","relation":{},"ISSN":["1084-4309","1557-7309"],"issn-type":[{"value":"1084-4309","type":"print"},{"value":"1557-7309","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,2,24]]},"assertion":[{"value":"2024-01-25","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-01-15","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-02-24","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}