{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T23:45:55Z","timestamp":1771631155800,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":50,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,11,19]]},"DOI":"10.1145\/3719027.3765097","type":"proceedings-article","created":{"date-parts":[[2025,11,22]],"date-time":"2025-11-22T23:42:02Z","timestamp":1763854922000},"page":"1113-1126","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Towards Verifiable FHE in Practice: Proving Correct Execution of TFHE's Bootstrapping using plonky2"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5804-3703","authenticated-orcid":false,"given":"Louis","family":"Tremblay Thibault","sequence":"first","affiliation":[{"name":"Zama, Paris, France"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3186-2482","authenticated-orcid":false,"given":"Michael","family":"Walter","sequence":"additional","affiliation":[{"name":"Zama, Paris, France"}]}],"member":"320","published-online":{"date-parts":[[2025,11,22]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-22365-5_3"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1515\/jmc-2015-0016"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-96-0935-2_10"},{"key":"e_1_3_2_1_4_1","unstructured":"Aztec. 2023. The Noir Programming Language. https:\/\/noir-lang.org\/. Accessed: 2024-03-01."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2022.3232813"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ICALP.2018.14"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"Eli Ben-Sasson Iddo Bentov Yinon Horesh and Michael Riabzev. 2018. Scalable transparent and post-quantum secure computational integrity. Cryptology ePrint Archive Paper 2018\/046. https:\/\/eprint.iacr.org\/2018\/046 https:\/\/eprint.iacr.org\/2018\/046.","DOI":"10.1088\/1475-7516\/2018\/03\/046"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-023-09463-5"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3658644.3670376"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-75248-4_19"},{"key":"e_1_3_2_1_11_1","unstructured":"Dan Boneh and Binyi Chen. 2024. LatticeFold: A Lattice-based Folding Scheme and its Applications to Succinct Proof Systems. Cryptology ePrint Archive Paper 2024\/257. https:\/\/eprint.iacr.org\/2024\/257 https:\/\/eprint.iacr.org\/2024\/257."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-56617-7_9"},{"key":"e_1_3_2_1_13_1","volume-title":"Halo: Recursive Proof Composition without a Trusted Setup. Cryptology ePrint Archive, Report 2019\/1021. https:\/\/eprint.iacr.org\/2019\/1021","author":"Bowe Sean","year":"2019","unstructured":"Sean Bowe, Jack Grigg, and Daira Hopwood. 2019. Halo: Recursive Proof Composition without a Trusted Setup. Cryptology ePrint Archive, Report 2019\/1021. https:\/\/eprint.iacr.org\/2019\/1021"},{"key":"e_1_3_2_1_14_1","unstructured":"Jeremy Bruestle Paul Gafni and RISC Zero. 2023. RISC Zero zkVM: Scalable Transparent Arguments of RISC-V Integrity. https:\/\/dev.risczero.com\/proof-system-in-detail.pdf. Accessed: 2024-02-29."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.62056\/aee0iv7sf"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-99-8724-5_3"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2001.959888"},{"key":"e_1_3_2_1_18_1","volume-title":"Verifiable Encodings for Secure Homomorphic Analytics. CoRR","author":"Chatel Sylvain","year":"2022","unstructured":"Sylvain Chatel, Christian Knabenhans, Apostolos Pyrgelis, and Jean-Pierre Hubaux. 2022. Verifiable Encodings for Secure Homomorphic Analytics. CoRR, Vol. abs\/2207.14071 (2022)."},{"key":"e_1_3_2_1_19_1","first-page":"3525","article-title":"Poster","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 CCS. ACM, 3525-3527.","journal-title":"Verifiable Encodings for Maliciously-Secure Homomorphic Encryption Evaluation. In CCS. ACM"},{"key":"e_1_3_2_1_20_1","unstructured":"Alessandro Chiesa. 2014. Succinct non-Interactive arguments. Ph.D. Dissertation. Massachusetts Institute of Technology Cambridge MA USA."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53887-6_1"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-019-09319-x"},{"key":"e_1_3_2_1_23_1","unstructured":"Ilaria Chillotti Nicolas Gama and Louis Goubin. 2016a. Attacking FHE-based applications by software fault injections. Cryptology ePrint Archive Report 2016\/1164. https:\/\/eprint.iacr.org\/2016\/1164"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-92078-4_23"},{"key":"e_1_3_2_1_25_1","volume-title":"Nigel Smart, and Louis Tremblay Thibault","author":"Dahl Morten","year":"2023","unstructured":"Morten Dahl, Cl\u00e9ment Danjou, Daniel Demmler, Tore Frederiksen, Petar Ivanov, Marc Joye, Dragos Rotaru, Nigel Smart, and Louis Tremblay Thibault. 2023. fhEVM: Confidential EVM Smart Contracts using Fully Homomorphic Encryption. https:\/\/github.com\/zama-ai\/fhevm\/blob\/main\/fhevm-whitepaper.pdf. Accessed: 2023-11-22."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2660267.2660366"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-45388-6_5"},{"key":"e_1_3_2_1_28_1","volume-title":"PLONK: Permutations over Lagrange-bases for Oecumenical Noninteractive arguments of Knowledge. Cryptology ePrint Archive, Report 2019\/953. https:\/\/eprint.iacr.org\/2019\/953","author":"Gabizon Ariel","year":"2019","unstructured":"Ariel Gabizon, Zachary J. Williamson, and Oana Ciobotaru. 2019. PLONK: Permutations over Lagrange-bases for Oecumenical Noninteractive arguments of Knowledge. Cryptology ePrint Archive, Report 2019\/953. https:\/\/eprint.iacr.org\/2019\/953"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-023-09481-3"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-68403-6_14"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14623-7_25"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40041-4_5"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40084-1_30"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.46586\/tches.v2022.i4.661-692"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-15985-5_13"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2022.3159694"},{"key":"e_1_3_2_1_37_1","unstructured":"Fengrun Liu Haofei Liang Tianyu Zhang Yuncong Hu Xiang Xie Haisheng Tan and Yu Yu. 2025. HasteBoots: Proving FHE Bootstrapping in Seconds. Cryptology ePrint Archive Paper 2025\/261. https:\/\/eprint.iacr.org\/2025\/261"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-58723-8_3"},{"key":"e_1_3_2_1_39_1","unstructured":"Polygon. 2022. Plonky2. https:\/\/github.com\/mir-protocol\/plonky2. Accessed: 2023-11-22."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-47818-5_14"},{"key":"e_1_3_2_1_41_1","unstructured":"Starknet. 2020. The Cairo Programming Language. https:\/\/www.cairo-lang.org\/. Accessed: 2024-03-01."},{"key":"e_1_3_2_1_42_1","unstructured":"Succinct. 2024. SP1. https:\/\/github.com\/succinctlabs\/sp1\/. Accessed: 2024-02-29."},{"key":"e_1_3_2_1_43_1","unstructured":"The Fhenix Team. 2023. FHE-Rollups: Scaling Confidential Smart Contracts on Ethereum and Beyond. https:\/\/www.fhenix.io\/wp-content\/uploads\/2023\/11\/FHE_Rollups_Whitepaper-v0.1-1.pdf. Accessed: 2023-11-22."},{"key":"e_1_3_2_1_44_1","first-page":"2","article-title":"Proofs, Arguments, and Zero-Knowledge","volume":"4","author":"Thaler Justin","year":"2022","unstructured":"Justin Thaler. 2022. Proofs, Arguments, and Zero-Knowledge. Found. Trends Priv. Secur., Vol. 4, 2-4 (2022), 117-660.","journal-title":"Found. Trends Priv. Secur."},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2022.3200051"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78524-8_1"},{"key":"e_1_3_2_1_47_1","unstructured":"Alexander Viand Christian Knabenhans and Anwar Hithnawi. 2023. Verifiable Fully Homomorphic Encryption. arXiv:2301.07041 [cs.CR]"},{"key":"e_1_3_2_1_48_1","unstructured":"Michael Walter. 2024. What Have SNARGs Ever Done for FHE? Cryptology ePrint Archive Report 2024\/1207. https:\/\/eprint.iacr.org\/2024\/1207"},{"key":"e_1_3_2_1_49_1","unstructured":"Zama. 2022a. Concrete ML: a Privacy-Preserving Machine Learning Library using Fully Homomorphic Encryption for Data Scientists. https:\/\/github.com\/zama-ai\/concrete-ml."},{"key":"e_1_3_2_1_50_1","unstructured":"Zama. 2022b. 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."}],"event":{"name":"CCS '25: ACM SIGSAC Conference on Computer and Communications Security","location":"Taipei Taiwan","acronym":"CCS '25","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 2025 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3719027.3765097","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T22:29:42Z","timestamp":1766442582000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3719027.3765097"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,19]]},"references-count":50,"alternative-id":["10.1145\/3719027.3765097","10.1145\/3719027"],"URL":"https:\/\/doi.org\/10.1145\/3719027.3765097","relation":{},"subject":[],"published":{"date-parts":[[2025,11,19]]},"assertion":[{"value":"2025-11-22","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}