{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T16:58:06Z","timestamp":1776790686756,"version":"3.51.2"},"reference-count":69,"publisher":"Association for Computing Machinery (ACM)","issue":"11","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Comput. Surv."],"published-print":{"date-parts":[[2026,8,30]]},"abstract":"<jats:p>\n                    Fully Homomorphic Encryption (FHE) enables arbitrary computations on encrypted data but lacks mechanisms to ensure the integrity of those computations. In particular, verifying that algorithm inputs are correct or that the intended algorithm was indeed executed remains an open challenge. This article addresses the issue by making two key contributions. First, we perform a comprehensive analysis of integrity faults in FHE, culminating in the definition of\n                    <jats:italic toggle=\"yes\">verifiable FHE<\/jats:italic>\n                    as a novel concept to tackle these concerns. Second, we present a systematic review of existing approaches aimed at providing verifiable FHE, assessing their strengths and weaknesses, as well as their applicability in practical settings. Our findings reveal that, despite promising advances, significant gaps persist in both the theoretical foundations and the practical deployment of verifiable FHE. We conclude by outlining future research directions necessary to achieve verifiable FHE computations.\n                  <\/jats:p>","DOI":"10.1145\/3797902","type":"journal-article","created":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T11:34:50Z","timestamp":1771587290000},"page":"1-27","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Systematic Review on Verifiable Fully Homomorphic Encryption: Integrity, Proofs and Open Problems"],"prefix":"10.1145","volume":"58","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2130-3591","authenticated-orcid":false,"given":"Julen","family":"Bernab\u00e9-Rodr\u00edguez","sequence":"first","affiliation":[{"name":"Tecnalia Research & Innovation Foundation","place":["San Sebasti\u00e1n, Spain"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1168-1932","authenticated-orcid":false,"given":"Oscar","family":"Lage Serrano","sequence":"additional","affiliation":[{"name":"Tecnalia Research & Innovation Foundation","place":["San Sebasti\u00e1n, Spain"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5532-004X","authenticated-orcid":false,"given":"Jasone","family":"Astorga Burgo","sequence":"additional","affiliation":[{"name":"Bilbao School of Engineering, University of the Basque Country UPV\/EHU","place":["Bilbao, Spain"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7093-0586","authenticated-orcid":false,"given":"Eduardo","family":"Jacob Taquet","sequence":"additional","affiliation":[{"name":"Bilbao School of Engineering, University of the Basque Country UPV\/EHU","place":["Bilbao, Spain"]}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2026,4,21]]},"reference":[{"key":"e_1_3_2_2_2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2024.3424420"},{"key":"e_1_3_2_3_2","series-title":"STOC \u201996","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1145\/237814.237838","volume-title":"Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing","author":"Ajtai M.","year":"1996","unstructured":"M. Ajtai. 1996. Generating hard instances of lattice problems (extended abstract). In Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing (Philadelphia, Pennsylvania, USA) (STOC \u201996). Association for Computing Machinery, New York, NY, USA, 99\u2013108. DOI:10.1145\/237814.237838"},{"key":"e_1_3_2_4_2","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\u00a0al. 2022. Openfhe: Open-source fully homomorphic encryption library. In Proceedings of the 10th Workshop on Encrypted Computing & Applied Homomorphic Cryptography. 53\u201363."},{"key":"e_1_3_2_5_2","unstructured":"Martin Albrecht Melissa Chase Hao Chen Jintai Ding Shafi Goldwasser Sergey Gorbunov Shai Halevi Jeffrey Hoffstein Kim Laine Kristin Lauter et\u00a0al. 2018. Homomorphic encryption security standard. HomomorphicEncryption.org Toronto Canada."},{"key":"e_1_3_2_6_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-75539-3_10"},{"key":"e_1_3_2_7_2","doi-asserted-by":"crossref","unstructured":"Diego F. Aranha Anamaria Costache Antonio Guimar\u00e3es and Eduardo Soria-Vazquez. 2023. HELIOPOLIS: Verifiable Computation over Homomorphically Encrypted Data from Interactive Oracle Proofs is Practical. Retrieved from https:\/\/eprint.iacr.org\/2023\/1949","DOI":"10.1007\/978-981-96-0935-2_10"},{"key":"e_1_3_2_8_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-56880-1_17"},{"key":"e_1_3_2_9_2","first-page":"94","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2024","author":"Bae Youngjin","year":"2024","unstructured":"Youngjin Bae, Jung Hee Cheon, Jaehyung Kim, and Damien Stehl\u00e9. 2024. Bootstrapping bits with CKKS. In Advances in Cryptology \u2013 EUROCRYPT 2024. Marc Joye and Gregor Leander (Eds.). Springer Nature Switzerland, Cham, 94\u2013123."},{"key":"e_1_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-98113-0_20"},{"key":"e_1_3_2_11_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-45611-8_29"},{"key":"e_1_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-75248-4_19"},{"key":"e_1_3_2_13_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-26948-7_7"},{"key":"e_1_3_2_14_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-93387-0_9"},{"key":"e_1_3_2_15_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-44223-1_14"},{"key":"e_1_3_2_16_2","article-title":"Security guidelines for implementing homomorphic encryption","author":"Bossuat Jean-Philippe","year":"2024","unstructured":"Jean-Philippe Bossuat, Rosario Cammarota, Ilaria Chillotti, Benjamin R Curtis, Wei Dai, Huijing Gong, Erin Hales, Duhyeong Kim, Bryan Kumara, Changmin Lee, et\u00a0al. 2024. Security guidelines for implementing homomorphic encryption. Cryptology ePrint Archive (2024).","journal-title":"Cryptology ePrint Archive"},{"key":"e_1_3_2_17_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_2_18_2","doi-asserted-by":"crossref","first-page":"100118","DOI":"10.1016\/j.array.2021.100118","article-title":"TFHE-rs: A library for safe and secure remote computing using fully homomorphic encryption and trusted execution environments","volume":"13","author":"Brenna Lars","year":"2022","unstructured":"Lars Brenna, Isak Sunde Singh, H\u00e5vard Dagenborg Johansen, and Dag Johansen. 2022. TFHE-rs: A library for safe and secure remote computing using fully homomorphic encryption and trusted execution environments. Array 13 (2022), 100118.","journal-title":"Array"},{"key":"e_1_3_2_19_2","doi-asserted-by":"crossref","first-page":"3525","DOI":"10.1145\/3576915.3624403","volume-title":"Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security","author":"Chatel Sylvain","year":"2023","unstructured":"Sylvain Chatel, Christian Knabenhans, Apostolos Pyrgelis, Carmela Troncoso, and Jean-Pierre Hubaux. 2023. Poster: Verifiable Encodings for Maliciously-Secure Homomorphic Encryption Evaluation. In Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security (New York, NY, USA). ACM, 3525\u20133527. DOI:10.1145\/3576915.3624403"},{"key":"e_1_3_2_20_2","series-title":"EuroSys \u201924","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1145\/3627703.3650088","volume-title":"Proceedings of the Nineteenth European Conference on Computer Systems","author":"Chen Bing-Jyue","year":"2024","unstructured":"Bing-Jyue Chen, Suppakit Waiwitlikhit, Ion Stoica, and Daniel Kang. 2024. ZKML: An optimizing system for ML inference in zero-knowledge proofs. In Proceedings of the Nineteenth European Conference on Computer Systems (Athens, Greece) (EuroSys \u201924). Association for Computing Machinery, New York, NY, USA, 560\u2013574. DOI:10.1145\/3627703.3650088"},{"key":"e_1_3_2_21_2","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1007\/978-3-319-70694-8_15","volume-title":"Advances in Cryptology\u2013ASIACRYPT 2017: 23rd International Conference on the Theory and Applications of Cryptology and Information Security, Hong Kong, China, December 3-7, 2017, Proceedings, Part I 23","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\u2013ASIACRYPT 2017: 23rd International Conference on the Theory and Applications of Cryptology and Information Security, Hong Kong, China, December 3-7, 2017, Proceedings, Part I 23. 409\u2013437."},{"key":"e_1_3_2_22_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-019-09319-x"},{"key":"e_1_3_2_23_2","doi-asserted-by":"crossref","first-page":"670","DOI":"10.1007\/978-3-030-92078-4_23","volume-title":"Advances in Cryptology\u2013ASIACRYPT 2021: 27th International Conference on the Theory and Application of Cryptology and Information Security, Singapore, December 6\u201310, 2021, Proceedings, Part III 27","author":"Chillotti Ilaria","year":"2021","unstructured":"Ilaria Chillotti, Damien Ligier, Jean-Baptiste Orfila, and Samuel Tap. 2021. Improved programmable bootstrapping with larger precision and efficient arithmetic circuits for TFHE. In Advances in Cryptology\u2013ASIACRYPT 2021: 27th International Conference on the Theory and Application of Cryptology and Information Security, Singapore, December 6\u201310, 2021, Proceedings, Part III 27. Springer, 670\u2013699."},{"key":"e_1_3_2_24_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-17253-4_12"},{"key":"e_1_3_2_25_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46800-5_24"},{"key":"e_1_3_2_26_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-64834-3_9"},{"key":"e_1_3_2_27_2","unstructured":"Junfeng Fan and Frederik Vercauteren. 2012. Somewhat Practical Fully Homomorphic Encryption. Retrieved from https:\/\/eprint.iacr.org\/2012\/144https:\/\/eprint.iacr.org\/2012\/144."},{"key":"e_1_3_2_28_2","article-title":"On the IND-CCA1 Security of FHE Schemes","author":"Fauzi Prastudy","year":"2021","unstructured":"Prastudy Fauzi, Martha Norberg Hovd, and H\u00e5vard Raddum. 2021. On the IND-CCA1 Security of FHE Schemes. Cryptology ePrint Archive, Paper 2021\/1624. Retrieved from https:\/\/eprint.iacr.org\/2021\/1624","journal-title":"Cryptology ePrint Archive, Paper 2021\/1624"},{"key":"e_1_3_2_29_2","doi-asserted-by":"crossref","first-page":"844","DOI":"10.1145\/2660267.2660366","volume-title":"Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security","author":"Fiore Dario","year":"2014","unstructured":"Dario Fiore, Rosario Gennaro, and Valerio Pastro. 2014. Efficiently verifiable computation on encrypted data. In Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security (New York, NY, USA). ACM, 844\u2013855. DOI:10.1145\/2660267.2660366"},{"key":"e_1_3_2_30_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-45388-6_5"},{"key":"e_1_3_2_31_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-023-09481-3"},{"key":"e_1_3_2_32_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-68403-6_14"},{"key":"e_1_3_2_33_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14623-7_25"},{"key":"e_1_3_2_34_2","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. 169\u2013178."},{"key":"e_1_3_2_35_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-22301-3_18"},{"key":"e_1_3_2_36_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30576-7_29"},{"key":"e_1_3_2_37_2","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1007\/978-3-662-49896-5_11","volume-title":"Advances in Cryptology\u2014EUROCRYPT 2016","author":"Groth Jens","year":"2016","unstructured":"Jens Groth. 2016. On the Size of Pairing-Based Non-interactive Arguments. In Advances in Cryptology\u2014EUROCRYPT 2016, Marc Fischlin and Jean-S\u00e9bastien Coron (Eds.). Springer, Berlin, 305\u2013326."},{"key":"e_1_3_2_38_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11432-020-2940-8"},{"key":"e_1_3_2_39_2","article-title":"Design and implementation of HElib: A homomorphic encryption library","author":"Halevi Shai","year":"2020","unstructured":"Shai Halevi and Victor Shoup. 2020. Design and implementation of HElib: A homomorphic encryption library. Cryptology ePrint Archive (2020).","journal-title":"Cryptology ePrint Archive"},{"key":"e_1_3_2_40_2","article-title":"Secure federated learning with fully homomorphic encryption for iot communications","author":"Hijazi Neveen Mohammad","year":"2023","unstructured":"Neveen Mohammad Hijazi, Moayad Aloqaily, Mohsen Guizani, Bassem Ouni, and Fakhri Karray. 2023. Secure federated learning with fully homomorphic encryption for iot communications. IEEE Internet of Things Journal 11, 3 (2023), 4289\u20134300.","journal-title":"IEEE Internet of Things Journal"},{"issue":"3","key":"e_1_3_2_41_2","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1002\/jrsm.1635","article-title":"Citation tracking for systematic literature searching: A scoping review","volume":"14","author":"Hirt Julian","year":"2023","unstructured":"Julian Hirt, Thomas Nordhausen, Christian Appenzeller-Herzog, and Hannah Ewald. 2023. Citation tracking for systematic literature searching: A scoping review. Research Synthesis Methods 14, 3 (2023), 563\u2013579.","journal-title":"Research Synthesis Methods"},{"key":"e_1_3_2_42_2","article-title":"Guide to Fully Homomorphic Encryption over the [Discretized] Torus","author":"Joye Marc","year":"2021","unstructured":"Marc Joye. 2021. Guide to Fully Homomorphic Encryption over the [Discretized] Torus. Cryptology ePrint Archive, Paper 2021\/1402. Retrieved from https:\/\/eprint.iacr.org\/2021\/1402","journal-title":"Cryptology ePrint Archive, Paper 2021\/1402"},{"key":"e_1_3_2_43_2","doi-asserted-by":"crossref","first-page":"2175","DOI":"10.1109\/TIFS.2023.3263631","article-title":"Optimized privacy-preserving cnn inference with fully homomorphic encryption","volume":"18","author":"Kim Dongwoo","year":"2023","unstructured":"Dongwoo Kim and Cyril Guyot. 2023. Optimized privacy-preserving cnn inference with fully homomorphic encryption. IEEE Transactions on Information Forensics and Security 18 (2023), 2175\u20132187.","journal-title":"IEEE Transactions on Information Forensics and Security"},{"key":"e_1_3_2_44_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-38554-4_18"},{"key":"e_1_3_2_45_2","first-page":"711","volume-title":"Proceedings of the 49th Annual International Symposium on Computer Architecture","author":"Kim Sangpyo","year":"2022","unstructured":"Sangpyo Kim, Jongmin Kim, Michael Jaemin Kim, Wonkyung Jung, John Kim, Minsoo Rhu, and Jung Ho Ahn. 2022. Bts: An accelerator for bootstrappable fully homomorphic encryption. In Proceedings of the 49th Annual International Symposium on Computer Architecture. 711\u2013725."},{"issue":"1","key":"e_1_3_2_46_2","first-page":"1","article-title":"Verifiable computation over encrypted data via MPC-in-the-head zero-knowledge proofs","volume":"24","author":"Lee Joohee","year":"2025","unstructured":"Joohee Lee, Sangrae Cho, Soohyung Kim, and Saerom Park. 2025. Verifiable computation over encrypted data via MPC-in-the-head zero-knowledge proofs. International Journal of Information Security 24, 1 (2025), 1\u201315.","journal-title":"International Journal of Information Security"},{"key":"e_1_3_2_47_2","doi-asserted-by":"crossref","first-page":"30039","DOI":"10.1109\/ACCESS.2022.3159694","article-title":"Privacy-preserving machine learning with fully homomorphic encryption for deep neural network","volume":"10","author":"Lee Joon-Woo","year":"2022","unstructured":"Joon-Woo Lee, HyungChul Kang, Yongwoo Lee, Woosuk Choi, Jieun Eom, Maxim Deryabin, Eunsang Lee, Junghyun Lee, Donghoon Yoo, Young-Sik Kim, et\u00a0al. 2022. Privacy-preserving machine learning with fully homomorphic encryption for deep neural network. IEEE Access 10 (2022), 30039\u201330054.","journal-title":"IEEE Access"},{"key":"e_1_3_2_48_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-99136-8_19"},{"key":"e_1_3_2_49_2","article-title":"Basic Lattice Cryptography: The concepts behind Kyber (ML-KEM) and Dilithium (ML-DSA)","author":"Lyubashevsky Vadim","year":"2024","unstructured":"Vadim Lyubashevsky. 2024. Basic Lattice Cryptography: The concepts behind Kyber (ML-KEM) and Dilithium (ML-DSA). Cryptology ePrint Archive, Paper 2024\/1287. Retrieved from https:\/\/eprint.iacr.org\/2024\/1287","journal-title":"Cryptology ePrint Archive, Paper 2024\/1287"},{"key":"e_1_3_2_50_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-56620-7_11"},{"key":"e_1_3_2_51_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-15979-4_3"},{"key":"e_1_3_2_52_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-75245-3_9"},{"key":"e_1_3_2_53_2","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2004.72"},{"issue":"4","key":"e_1_3_2_54_2","first-page":"219","article-title":"Fast secure matrix multiplications over ring-based homomorphic encryption","volume":"30","author":"Mishra Pradeep Kumar","year":"2021","unstructured":"Pradeep Kumar Mishra, Deevashwer Rathee, Dung Hoang Duong, and Masaya Yasuda. 2021. Fast secure matrix multiplications over ring-based homomorphic encryption. Information Security Journal: A Global Perspective 30, 4 (2021), 219\u2013234.","journal-title":"Information Security Journal: A Global Perspective"},{"key":"e_1_3_2_55_2","first-page":"64","volume-title":"Proceedings of the 8th Workshop on Encrypted Computing and Applied Homomorphic Cryptography","author":"Mouchet Christian Vincent","year":"2020","unstructured":"Christian Vincent Mouchet, Jean-Philippe Bossuat, Juan Ram\u00f3n Troncoso-Pastoriza, and Jean-Pierre Hubaux. 2020. Lattigo: A multiparty homomorphic encryption library in go. In Proceedings of the 8th Workshop on Encrypted Computing and Applied Homomorphic Cryptography. 64\u201370."},{"key":"e_1_3_2_56_2","doi-asserted-by":"publisher","DOI":"10.1145\/2856449"},{"key":"e_1_3_2_57_2","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/3-540-46766-1_9","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201991","author":"Pedersen Torben Pryds","year":"1992","unstructured":"Torben Pryds Pedersen. 1992. Non-interactive and information-theoretic secure verifiable secret sharing. In Advances in Cryptology \u2014 CRYPTO \u201991, Joan Feigenbaum (Ed.). Springer, Berlin, 129\u2013140."},{"key":"e_1_3_2_58_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)"},{"key":"e_1_3_2_59_2","unstructured":"Microsoft Research. 2018. Microsoft SEAL. Retrieved from https:\/\/github.com\/Microsoft\/SEALMicrosoft Research Redmond WA."},{"key":"e_1_3_2_60_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-5906-5_24"},{"key":"e_1_3_2_61_2","first-page":"238","volume-title":"MICRO-54: 54th Annual IEEE\/ACM International Symposium on Microarchitecture","author":"Samardzic Nikola","year":"2021","unstructured":"Nikola Samardzic, Axel Feldmann, Aleksandar Krastev, Srinivas Devadas, Ronald Dreslinski, Christopher Peikert, and Daniel Sanchez. 2021. F1: A fast and programmable accelerator for fully homomorphic encryption. In MICRO-54: 54th Annual IEEE\/ACM International Symposium on Microarchitecture. 238\u2013252."},{"key":"e_1_3_2_62_2","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1145\/3470496.3527393","volume-title":"Proceedings of the 49th Annual International Symposium on Computer Architecture","author":"Samardzic Nikola","year":"2022","unstructured":"Nikola Samardzic, Axel Feldmann, Aleksandar Krastev, Nathan Manohar, Nicholas Genise, Srinivas Devadas, Karim Eldefrawy, Chris Peikert, and Daniel Sanchez. 2022. Craterlake: A hardware accelerator for efficient unbounded computation on encrypted data. In Proceedings of the 49th Annual International Symposium on Computer Architecture. 173\u2013187."},{"key":"e_1_3_2_63_2","first-page":"381","volume-title":"International Conference on Financial Cryptography and Data Security","author":"Silde Tjerand","year":"2022","unstructured":"Tjerand Silde. 2022. Short paper: Verifiable decryption for BGV. In International Conference on Financial Cryptography and Data Security. 381\u2013390."},{"key":"e_1_3_2_64_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-32415-4_26"},{"key":"e_1_3_2_65_2","doi-asserted-by":"crossref","unstructured":"Louis Tremblay Thibault and Michael Walter. 2024. Towards Verifiable FHE in Practice: Proving Correct Execution of TFHE\u2019s Bootstrapping using plonky2. Retrieved from https:\/\/eprint.iacr.org\/2024\/451","DOI":"10.1145\/3719027.3765097"},{"key":"e_1_3_2_66_2","doi-asserted-by":"crossref","first-page":"1092","DOI":"10.1109\/SP40001.2021.00068","volume-title":"2021 IEEE Symposium on Security and Privacy (SP)","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). IEEE, 1092\u20131108."},{"key":"e_1_3_2_67_2","unstructured":"Alexander Viand Christian Knabenhans and Anwar Hithnawi. 2023. Verifiable Fully Homomorphic Encryption. arXiv:2301.07041. Retrieved from https:\/\/arxiv.org\/abs\/2301.07041"},{"key":"e_1_3_2_68_2","unstructured":"Alexander Viand Christian Knabenhans and Anwar Hithnawi. 2023. Verifiable Fully Homomorphic Encryption. arXiv preprint arXiv:2301.07041. (12023)."},{"key":"e_1_3_2_69_2","doi-asserted-by":"crossref","first-page":"870","DOI":"10.1109\/HPCA56546.2023.10070984","volume-title":"2023 IEEE International Symposium on High-Performance Computer Architecture (HPCA)","author":"Yang Yinghao","year":"2023","unstructured":"Yinghao Yang, Huaizhi Zhang, Shengyu Fan, Hang Lu, Mingzhe Zhang, and Xiaowei Li. 2023. Poseidon: Practical homomorphic encryption accelerator. In 2023 IEEE International Symposium on High-Performance Computer Architecture (HPCA). IEEE, 870\u2013881."},{"key":"e_1_3_2_70_2","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1986.25"}],"container-title":["ACM Computing Surveys"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3797902","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T16:08:52Z","timestamp":1776787732000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3797902"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,4,21]]},"references-count":69,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2026,8,30]]}},"alternative-id":["10.1145\/3797902"],"URL":"https:\/\/doi.org\/10.1145\/3797902","relation":{},"ISSN":["0360-0300","1557-7341"],"issn-type":[{"value":"0360-0300","type":"print"},{"value":"1557-7341","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,4,21]]},"assertion":[{"value":"2025-04-08","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2026-02-04","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2026-04-21","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}