Fherret: Proof of FHE Correct-and-Honest Evaluation with Circuit Privacy from MPCitH
Authors
Janik Huth, Antoine Joux, Giacomo Santato
Janik Huth
CISPA - Helmholtz Center for Information Security, SaarbrĂĽcken, Germany
Saarland University, SaarbrĂĽcken, Germany
janik dot huth at cispa dot de
Saarland University, SaarbrĂĽcken, Germany
janik dot huth at cispa dot de
Antoine Joux
CISPA - Helmholtz Center for Information Security, SaarbrĂĽcken, Germany
joux at cispa dot de
joux at cispa dot de
Giacomo Santato
CISPA - Helmholtz Center for Information Security, SaarbrĂĽcken, Germany
Saarland University, SaarbrĂĽcken, Germany
giacomo dot santato at cispa dot de
Saarland University, SaarbrĂĽcken, Germany
giacomo dot santato at cispa dot de
Keywords:
Fully Homomorphic Encryption
Reaction-based attacks
$đť–¨đť–đť–Ł-𝖢𝖯𝖠^đť–Ł$ security
MPC-in-the-Head
Abstract
The major Fully Homomorphic Encryption (FHE) schemes guarantee the privacy of the encrypted message only in the honest-but-curious setting, when the server follows the protocol without deviating. However, various attacks in the literature show that an actively malicious server can recover sensitive information by executing incorrect functions, tampering with ciphertexts, or observing the client's reaction during decryption.
Existing integrity solutions for FHE schemes either fail to guarantee circuit privacy, exposing the server's computations to the client, or introduce significant computational overhead on the prover by requiring proofs of FHE operations on ciphertexts.
In this work, we present Fherret, a novel scheme leveraging the MPC-in-the-Head (MPCitH) paradigm to provide a proof of correct-and-honest homomorphic evaluation while preserving circuit privacy. This proof guarantees that the client can safely decrypt the ciphertext obtained from the server without being susceptible to reaction-based attacks, such as verification and decryption oracle attacks. Additionally, this proof guarantees that the server's evaluation maintains correctness, thereby protecting the client from IND-CPA-D-style attacks.
Our solution achieves a prover overhead of approximately 110-170 homomorphic evaluations of random functions from the function space F, while retaining a competitive verifier overhead of approximately 58-93 homomorphic evaluations and a communication size proportional to approximately 40 times the size of a function from F.
Furthermore, Fherret is inherently parallelizable because its MPCitH views can be computed independently, achieving a parallel computation overhead similar to a homomorphic evaluation of a single random function from F for both the prover and the verifier.
References
[ABBB+22]
Ahmad Al Badawi, Jack Bates, Flavio Bergamaschi, David Bruce Cousins, Saroja Erabelli, Nicholas Genise, Shai Halevi, Hamish Hunt, Andrey Kim, Yongwoo Lee, Zeyu Liu, Daniele Micciancio, Ian Quah, Yuriy Polyakov, Saraswathy R.V., Kurt Rohloff, Jonathan Saylor, Dmitriy Suponitsky, Matthew Triplett, Vinod Vaikuntanathan, and Vincent Zucca. OpenFHE: Open-Source Fully Homomorphic Encryption Library. In Proceedings of the 10th Workshop on Encrypted Computing & Applied Homomorphic Cryptography, pages 53–63, New York, NY, USA. 2022. Association for Computing Machinery. DOI: 10.1145/3560827.3563379
[ABPS24]
Shahla Atapoor, Karim Baghery, Hilder V. L. Pereira, and Jannik Spiessens. Verifiable FHE via Lattice-based SNARKs. IACR Communications in Cryptology, 1(1), 2024. DOI: 10.62056/a6ksdkp10
[ACGS24]
Diego F. Aranha, Anamaria Costache, Antonio Guimarães, and Eduardo Soria-Vazquez. HELIOPOLIS: Verifiable Computation over Homomorphically Encrypted Data from Interactive Oracle Proofs is Practical. In Kai-Min Chung and Yu Sasaki, editors, ASIACRYPT 2024, Part V, volume 15488 of LNCS, pages 302–334. December 2024. Springer, Singapore. DOI: 10.1007/978-981-96-0935-2_10
[AGH+23]
Carlos Aguilar-Melchor, Nicolas Gama, James Howe, Andreas Hülsing, David Joseph, and Dongze Yue. The Return of the SDitH. In Carmit Hazay and Martijn Stam, editors, EUROCRYPT 2023, Part V, volume 14008 of LNCS, pages 564–596. April 2023. Springer, Cham. DOI: 10.1007/978-3-031-30589-4_20
[AGHV22]
Adi Akavia, Craig Gentry, Shai Halevi, and Margarita Vald. Achievable CCA2 Relaxation for Homomorphic Encryption. In Eike Kiltz and Vinod Vaikuntanathan, editors, TCC 2022, Part II, volume 13748 of LNCS, pages 70–99. November 2022. Springer, Cham. DOI: 10.1007/978-3-031-22365-5_3
[AV21]
Adi Akavia and Margarita Vald. On the Privacy of Protocols based on CPA-Secure Homomorphic Encryption. Cryptology ePrint Archive, Report 2021/803. 2021.
[BBD+23]
Carsten Baum, Lennart Braun, Cyprien Delpech de Saint Guilhem, Michael Klooß, Emmanuela Orsini, Lawrence Roy, and Peter Scholl. Publicly Verifiable Zero-Knowledge and Post-Quantum Signatures from VOLE-in-the-Head. In Helena Handschuh and Anna Lysyanskaya, editors, CRYPTO 2023, Part V, volume 14085 of LNCS, pages 581–615. August 2023. Springer, Cham. DOI: 10.1007/978-3-031-38554-4_19
[BCC+24]
Dung Bui, Eliana Carozza, Geoffroy Couteau, Dahmun Goudarzi, and Antoine Joux. Faster Signatures from MPC-in-the-Head. In Kai-Min Chung and Yu Sasaki, editors, ASIACRYPT 2024, Part I, volume 15484 of LNCS, pages 396–428. December 2024. Springer, Singapore. DOI: 10.1007/978-981-96-0875-1_13
[BCFK21]
Alexandre Bois, Ignacio Cascudo, Dario Fiore, and Dongwoo Kim. Flexible and Efficient Verifiable Computation on Encrypted Data. In Juan Garay, editor, PKC 2021, Part II, volume 12711 of LNCS, pages 528–558. May 2021. Springer, Cham. DOI: 10.1007/978-3-030-75248-4_19
[BFG+24]
Loïc Bidoux, Thibauld Feneuil, Philippe Gaborit, Romaric Neveu, and Matthieu Rivain. Dual Support Decomposition in the Head: Shorter Signatures from Rank SD and MinRank. In Kai-Min Chung and Yu Sasaki, editors, ASIACRYPT 2024, Part II, volume 15485 of LNCS, pages 38–69. December 2024. Springer, Singapore. DOI: 10.1007/978-981-96-0888-1_2
[BGV12]
Zvika Brakerski, Craig Gentry, and Vinod Vaikuntanathan. (Leveled) fully homomorphic encryption without bootstrapping. In Shafi Goldwasser, editor, ITCS 2012, pages 309–325. January 2012. ACM. DOI: 10.1145/2090236.2090262
[Bui24]
Dung Bui. Shorter VOLEitH Signature from Multivariate Quadratic. https://eprint.iacr.org/2024/465. Cryptology ePrint Archive, Paper 2024/465. 2024.
[CCC+25]
Ignacio Cascudo, Anamaria Costache, Daniele Cozzo, Dario Fiore, Antonio Guimarães, and Eduardo Soria-Vazquez. Verifiable Computation for Approximate Homomorphic Encryption Schemes. In Yael Tauman Kalai and Seny F. Kamara, editors, CRYPTO 2025, Part VII, volume 16006 of LNCS, pages 643–677. August 2025. Springer, Cham. DOI: 10.1007/978-3-032-01907-3_21
[CCCM22]
Bhuvnesh Chaturvedi, Anirban Chakraborty, Ayantika Chatterjee, and Debdeep Mukhopadhyay. A Practical Full Key Recovery Attack on TFHE and FHEW by Inducing Decryption Errors. Cryptology ePrint Archive, Report 2022/1563. 2022.
[CCP+24]
Jung Hee Cheon, Hyeongmin Choe, Alain Passelègue, Damien Stehlé, and Elias Suvanto. Attacks Against the IND-CPA$^{\text{D}}$ Security of Exact FHE Schemes. In Bo Luo, Xiaojing Liao, Jun Xu, Engin Kirda, and David Lie, editors, ACM CCS 2024, pages 2505–2519. October 2024. ACM Press. DOI: 10.1145/3658644.3690341
[CF13]
Dario Catalano and Dario Fiore. Practical Homomorphic MACs for Arithmetic Circuits. In Thomas Johansson and Phong Q. Nguyen, editors, EUROCRYPT 2013, volume 7881 of LNCS, pages 336–352. May 2013. Springer, Berlin, Heidelberg. DOI: 10.1007/978-3-642-38348-9_21
[CGG16]
Ilaria Chillotti, Nicolas Gama, and Louis Goubin. Attacking FHE-based applications by software fault injections. Cryptology ePrint Archive, Report 2016/1164. 2016.
[CGGI20]
Ilaria Chillotti, Nicolas Gama, Mariya Georgieva, and Malika Izabachène. TFHE: Fast Fully Homomorphic Encryption Over the Torus. Journal of Cryptology, 33(1):34–91, January 2020. DOI: 10.1007/s00145-019-09319-x
[CKP+24]
Sylvain Chatel, Christian Knabenhans, Apostolos Pyrgelis, Carmela Troncoso, and Jean-Pierre Hubaux. VERITAS: Plaintext Encoders for Practical Verifiable Homomorphic Encryption. In Bo Luo, Xiaojing Liao, Jun Xu, Engin Kirda, and David Lie, editors, ACM CCS 2024, pages 2520–2534. October 2024. ACM Press. DOI: 10.1145/3658644.3670282
[CLY+24]
Hongrui Cui, Hanlin Liu, Di Yan, Kang Yang, Yu Yu, and Kaiyi Zhang. $\mathsf{ReSolveD}$: Shorter Signatures from Regular Syndrome Decoding and VOLE-in-the-Head. In Qiang Tang and Vanessa Teague, editors, PKC 2024, Part I, volume 14601 of LNCS, pages 229–258. April 2024. Springer, Cham. DOI: 10.1007/978-3-031-57718-5_8
[CSBB24]
Marina Checri, Renaud Sirdey, Aymen Boudguiga, and Jean-Paul Bultel. On the Practical $\text{CPA}^{D}$ Security of “exact” and Threshold FHE Schemes and Libraries. In Leonid Reyzin and Douglas Stebila, editors, CRYPTO 2024, Part III, volume 14922 of LNCS, pages 3–33. August 2024. Springer, Cham. DOI: 10.1007/978-3-031-68382-4_1
[DD22]
Nico Döttling and Jesko Dujmovic. Maliciously Circuit-Private FHE from Information-Theoretic Principles. In Dana Dachman-Soled, editor, ITC 2022, volume 230 of LIPIcs, pages 4:1–4:21. July 2022. Schloss Dagstuhl. DOI: 10.4230/LIPIcs.ITC.2022.4
[DDA13]
Angsuman Das, Sabyasachi Dutta, and Avishek Adhikari. Indistinguishability against Chosen Ciphertext Verification Attack Revisited: The Complete Picture. In Willy Susilo and Reza Reyhanitabar, editors, ProvSec 2013, volume 8209 of LNCS, pages 104–120. October 2013. Springer, Berlin, Heidelberg. DOI: 10.1007/978-3-642-41227-1_6
[DM15]
Léo Ducas and Daniele Micciancio. FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second. In Elisabeth Oswald and Marc Fischlin, editors, EUROCRYPT 2015, Part I, volume 9056 of LNCS, pages 617–640. April 2015. Springer, Berlin, Heidelberg. DOI: 10.1007/978-3-662-46800-5_24
[FGP14]
Dario Fiore, Rosario Gennaro, and Valerio Pastro. Efficiently Verifiable Computation on Encrypted Data. In Gail-Joon Ahn, Moti Yung, and Ninghui Li, editors, ACM CCS 2014, pages 844–855. November 2014. ACM Press. DOI: 10.1145/2660267.2660366
[FNP20]
Dario Fiore, Anca Nitulescu, and David Pointcheval. Boosting Verifiable Computation on Encrypted Data. In Aggelos Kiayias, Markulf Kohlweiss, Petros Wallden, and Vassilis Zikas, editors, PKC 2020, Part II, volume 12111 of LNCS, pages 124–154. May 2020. Springer, Cham. DOI: 10.1007/978-3-030-45388-6_5
[FV12]
Junfeng Fan and Frederik Vercauteren. Somewhat Practical Fully Homomorphic Encryption. Cryptology ePrint Archive, Report 2012/144. 2012.
[GBK+24]
Mariana Gama, Emad Heydari Beni, Jiayi Kang, Jannik Spiessens, and Frederik Vercauteren. Blind zkSNARKs for Private Proof Delegation and Verifiable Computation over Encrypted Data. Cryptology ePrint Archive, Paper 2024/1684. 2024.
[GGM86]
Oded Goldreich, Shafi Goldwasser, and Silvio Micali. How to Construct Random Functions. Journal of the ACM, 33(4):792–807, October 1986. DOI: 10.1145/6490.6503
[GGW24]
Sanjam Garg, Aarushi Goel, and Mingyuan Wang. How to Prove Statements Obliviously?. In Leonid Reyzin and Douglas Stebila, editors, CRYPTO 2024, Part X, volume 14929 of LNCS, pages 449–487. August 2024. Springer, Cham. DOI: 10.1007/978-3-031-68403-6_14
[GNS21]
Chaya Ganesh, Anca Nitulescu, and Eduardo Soria-Vazquez. Rinocchio: SNARKs for Ring Arithmetic. Cryptology ePrint Archive, Report 2021/322. 2021.
[GNS23]
Chaya Ganesh, Anca Nitulescu, and Eduardo Soria-Vazquez. Rinocchio: SNARKs for Ring Arithmetic. Journal of Cryptology, 36(4):41, October 2023. DOI: 10.1007/s00145-023-09481-3
[GW13]
Rosario Gennaro and Daniel Wichs. Fully Homomorphic Message Authenticators. In Kazue Sako and Palash Sarkar, editors, ASIACRYPT 2013, Part II, volume 8270 of LNCS, pages 301–320. December 2013. Springer, Berlin, Heidelberg. DOI: 10.1007/978-3-642-42045-0_16
[GYW+23]
Xiaojie Guo, Kang Yang, Xiao Wang, Wenhao Zhang, Xiang Xie, Jiang Zhang, and Zheli Liu. Half-Tree: Halving the Cost of Tree Expansion in COT and DPF. In Carmit Hazay and Martijn Stam, editors, EUROCRYPT 2023, Part I, volume 14004 of LNCS, pages 330–362. April 2023. Springer, Cham. DOI: 10.1007/978-3-031-30545-0_12
[HJ24]
Janik Huth and Antoine Joux. MPC in the Head Using the Subfield Bilinear Collision Problem. In Leonid Reyzin and Douglas Stebila, editors, CRYPTO 2024, Part I, volume 14920 of LNCS, pages 39–70. August 2024. Springer, Cham. DOI: 10.1007/978-3-031-68376-3_2
[HJ25]
Janik Huth and Antoine Joux. VOLE-in-the-Head Signatures from Subfield Bilinear Collisions. In Advances in Cryptology – ASIACRYPT 2025, pages 3–34. 2025. Springer-Verlag. DOI: 10.1007/978-981-95-5113-2_1
[IKOS07]
Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, and Amit Sahai. Zero-knowledge from secure multiparty computation. In David S. Johnson and Uriel Feige, editors, 39th ACM STOC, pages 21–30. June 2007. ACM Press. DOI: 10.1145/1250790.1250794
[LM21]
Baiyu Li and Daniele Micciancio. On the Security of Homomorphic Encryption on Approximate Numbers. In Anne Canteaut and François-Xavier Standaert, editors, EUROCRYPT 2021, Part I, volume 12696 of LNCS, pages 648–677. October 2021. Springer, Cham. DOI: 10.1007/978-3-030-77870-5_23
[LMSV12]
Jake Loftus, Alexander May, Nigel P. Smart, and Frederik Vercauteren. On CCA-Secure Somewhat Homomorphic Encryption. In Ali Miri and Serge Vaudenay, editors, SAC 2011, volume 7118 of LNCS, pages 55–72. August 2012. Springer, Berlin, Heidelberg. DOI: 10.1007/978-3-642-28496-0_4
[MN24]
Mark Manulis and Jérôme Nguyen. Fully Homomorphic Encryption Beyond IND-CCA1 Security: Integrity Through Verifiability. In Marc Joye and Gregor Leander, editors, EUROCRYPT 2024, Part II, volume 14652 of LNCS, pages 63–93. May 2024. Springer, Cham. DOI: 10.1007/978-3-031-58723-8_3
[NLDD23]
Deepika Natarajan, Andrew D. Loveless, Wei Dai, and Ronald G. Dreslinski. Chex-Mix: Combining Homomorphic Encryption with Trusted Execution Environments for Oblivious Inference in the Cloud. In 2023 IEEE European Symposium on Security and Privacy, pages 73–91. July 2023. IEEE Computer Society Press. DOI: 10.1109/EuroSP57164.2023.00014
[OPP14]
Rafail Ostrovsky, Anat Paskin-Cherniavsky, and Beni Paskin-Cherniavsky. Maliciously Circuit-Private FHE. In Juan A. Garay and Rosario Gennaro, editors, CRYPTO 2014, Part I, volume 8616 of LNCS, pages 536–553. August 2014. Springer, Berlin, Heidelberg. DOI: 10.1007/978-3-662-44371-2_30
[Roy22]
Lawrence Roy. SoftSpokenOT: Quieter OT Extension from Small-Field Silent VOLE in the Minicrypt Model. In Yevgeniy Dodis and Thomas Shrimpton, editors, CRYPTO 2022, Part I, volume 13507 of LNCS, pages 657–687. August 2022. Springer, Cham. DOI: 10.1007/978-3-031-15802-5_23
[VKH23]
Alexander Viand, Christian Knabenhans, and Anwar Hithnawi. Verifiable fully homomorphic encryption. arXiv preprint arXiv:2301.07041, 2023.
[ZLW+25]
Zhelei Zhou, Yun Li, Yuchen Wang, Zhaomin Yang, Bingsheng Zhang, Cheng Hong, Tao Wei, and Wenguang Chen. ZHE: Efficient Zero-Knowledge Proofs for HE Evaluations. In Marina Blanton, William Enck, and Cristina Nita-Rotaru, editors, 2025 IEEE Symposium on Security and Privacy, pages 3328–3346. May 2025. IEEE Computer Society Press. DOI: 10.1109/SP61157.2025.00199
[ZPS12]
Zhenfei Zhang, Thomas Plantard, and Willy Susilo. Reaction Attack on Outsourced Computing with Fully Homomorphic Encryption Schemes. In Howon Kim, editor, ICISC 11, volume 7259 of LNCS, pages 419–436. 2012. Springer, Berlin, Heidelberg. DOI: 10.1007/978-3-642-31912-9_28
[ZWL+25]
Xinxuan Zhang, Ruida Wang, Zeyu Liu, Binwu Xiang, Yi Deng, and Xianhui Lu. FHE-SNARK vs. SNARK-FHE: From Analysis to Practical Verifiable Computation. Cryptology ePrint Archive, Paper 2025/302. 2025.
[ABBB+22]
Ahmad Al Badawi, Jack Bates, Flavio Bergamaschi, David Bruce Cousins, Saroja Erabelli, Nicholas Genise, Shai Halevi, Hamish Hunt, Andrey Kim, Yongwoo Lee, Zeyu Liu, Daniele Micciancio, Ian Quah, Yuriy Polyakov, Saraswathy R.V., Kurt Rohloff, Jonathan Saylor, Dmitriy Suponitsky, Matthew Triplett, Vinod Vaikuntanathan, and Vincent Zucca. OpenFHE: Open-Source Fully Homomorphic Encryption Library. In Proceedings of the 10th Workshop on Encrypted Computing & Applied Homomorphic Cryptography, pages 53–63, New York, NY, USA. 2022. Association for Computing Machinery. DOI: 10.1145/3560827.3563379
[ABPS24]
Shahla Atapoor, Karim Baghery, Hilder V. L. Pereira, and Jannik Spiessens. Verifiable FHE via Lattice-based SNARKs. IACR Communications in Cryptology, 1(1), 2024. DOI: 10.62056/a6ksdkp10
[ACGS24]
Diego F. Aranha, Anamaria Costache, Antonio Guimarães, and Eduardo Soria-Vazquez. HELIOPOLIS: Verifiable Computation over Homomorphically Encrypted Data from Interactive Oracle Proofs is Practical. In Kai-Min Chung and Yu Sasaki, editors, ASIACRYPT 2024, Part V, volume 15488 of LNCS, pages 302–334. December 2024. Springer, Singapore. DOI: 10.1007/978-981-96-0935-2_10
[AGH+23]
Carlos Aguilar-Melchor, Nicolas Gama, James Howe, Andreas Hülsing, David Joseph, and Dongze Yue. The Return of the SDitH. In Carmit Hazay and Martijn Stam, editors, EUROCRYPT 2023, Part V, volume 14008 of LNCS, pages 564–596. April 2023. Springer, Cham. DOI: 10.1007/978-3-031-30589-4_20
[AGHV22]
Adi Akavia, Craig Gentry, Shai Halevi, and Margarita Vald. Achievable CCA2 Relaxation for Homomorphic Encryption. In Eike Kiltz and Vinod Vaikuntanathan, editors, TCC 2022, Part II, volume 13748 of LNCS, pages 70–99. November 2022. Springer, Cham. DOI: 10.1007/978-3-031-22365-5_3
[AV21]
Adi Akavia and Margarita Vald. On the Privacy of Protocols based on CPA-Secure Homomorphic Encryption. Cryptology ePrint Archive, Report 2021/803. 2021.
[BBD+23]
Carsten Baum, Lennart Braun, Cyprien Delpech de Saint Guilhem, Michael Klooß, Emmanuela Orsini, Lawrence Roy, and Peter Scholl. Publicly Verifiable Zero-Knowledge and Post-Quantum Signatures from VOLE-in-the-Head. In Helena Handschuh and Anna Lysyanskaya, editors, CRYPTO 2023, Part V, volume 14085 of LNCS, pages 581–615. August 2023. Springer, Cham. DOI: 10.1007/978-3-031-38554-4_19
[BCC+24]
Dung Bui, Eliana Carozza, Geoffroy Couteau, Dahmun Goudarzi, and Antoine Joux. Faster Signatures from MPC-in-the-Head. In Kai-Min Chung and Yu Sasaki, editors, ASIACRYPT 2024, Part I, volume 15484 of LNCS, pages 396–428. December 2024. Springer, Singapore. DOI: 10.1007/978-981-96-0875-1_13
[BCFK21]
Alexandre Bois, Ignacio Cascudo, Dario Fiore, and Dongwoo Kim. Flexible and Efficient Verifiable Computation on Encrypted Data. In Juan Garay, editor, PKC 2021, Part II, volume 12711 of LNCS, pages 528–558. May 2021. Springer, Cham. DOI: 10.1007/978-3-030-75248-4_19
[BFG+24]
Loïc Bidoux, Thibauld Feneuil, Philippe Gaborit, Romaric Neveu, and Matthieu Rivain. Dual Support Decomposition in the Head: Shorter Signatures from Rank SD and MinRank. In Kai-Min Chung and Yu Sasaki, editors, ASIACRYPT 2024, Part II, volume 15485 of LNCS, pages 38–69. December 2024. Springer, Singapore. DOI: 10.1007/978-981-96-0888-1_2
[BGV12]
Zvika Brakerski, Craig Gentry, and Vinod Vaikuntanathan. (Leveled) fully homomorphic encryption without bootstrapping. In Shafi Goldwasser, editor, ITCS 2012, pages 309–325. January 2012. ACM. DOI: 10.1145/2090236.2090262
[Bui24]
Dung Bui. Shorter VOLEitH Signature from Multivariate Quadratic. https://eprint.iacr.org/2024/465. Cryptology ePrint Archive, Paper 2024/465. 2024.
[CCC+25]
Ignacio Cascudo, Anamaria Costache, Daniele Cozzo, Dario Fiore, Antonio Guimarães, and Eduardo Soria-Vazquez. Verifiable Computation for Approximate Homomorphic Encryption Schemes. In Yael Tauman Kalai and Seny F. Kamara, editors, CRYPTO 2025, Part VII, volume 16006 of LNCS, pages 643–677. August 2025. Springer, Cham. DOI: 10.1007/978-3-032-01907-3_21
[CCCM22]
Bhuvnesh Chaturvedi, Anirban Chakraborty, Ayantika Chatterjee, and Debdeep Mukhopadhyay. A Practical Full Key Recovery Attack on TFHE and FHEW by Inducing Decryption Errors. Cryptology ePrint Archive, Report 2022/1563. 2022.
[CCP+24]
Jung Hee Cheon, Hyeongmin Choe, Alain Passelègue, Damien Stehlé, and Elias Suvanto. Attacks Against the IND-CPA$^{\text{D}}$ Security of Exact FHE Schemes. In Bo Luo, Xiaojing Liao, Jun Xu, Engin Kirda, and David Lie, editors, ACM CCS 2024, pages 2505–2519. October 2024. ACM Press. DOI: 10.1145/3658644.3690341
[CF13]
Dario Catalano and Dario Fiore. Practical Homomorphic MACs for Arithmetic Circuits. In Thomas Johansson and Phong Q. Nguyen, editors, EUROCRYPT 2013, volume 7881 of LNCS, pages 336–352. May 2013. Springer, Berlin, Heidelberg. DOI: 10.1007/978-3-642-38348-9_21
[CGG16]
Ilaria Chillotti, Nicolas Gama, and Louis Goubin. Attacking FHE-based applications by software fault injections. Cryptology ePrint Archive, Report 2016/1164. 2016.
[CGGI20]
Ilaria Chillotti, Nicolas Gama, Mariya Georgieva, and Malika Izabachène. TFHE: Fast Fully Homomorphic Encryption Over the Torus. Journal of Cryptology, 33(1):34–91, January 2020. DOI: 10.1007/s00145-019-09319-x
[CKP+24]
Sylvain Chatel, Christian Knabenhans, Apostolos Pyrgelis, Carmela Troncoso, and Jean-Pierre Hubaux. VERITAS: Plaintext Encoders for Practical Verifiable Homomorphic Encryption. In Bo Luo, Xiaojing Liao, Jun Xu, Engin Kirda, and David Lie, editors, ACM CCS 2024, pages 2520–2534. October 2024. ACM Press. DOI: 10.1145/3658644.3670282
[CLY+24]
Hongrui Cui, Hanlin Liu, Di Yan, Kang Yang, Yu Yu, and Kaiyi Zhang. $\mathsf{ReSolveD}$: Shorter Signatures from Regular Syndrome Decoding and VOLE-in-the-Head. In Qiang Tang and Vanessa Teague, editors, PKC 2024, Part I, volume 14601 of LNCS, pages 229–258. April 2024. Springer, Cham. DOI: 10.1007/978-3-031-57718-5_8
[CSBB24]
Marina Checri, Renaud Sirdey, Aymen Boudguiga, and Jean-Paul Bultel. On the Practical $\text{CPA}^{D}$ Security of “exact” and Threshold FHE Schemes and Libraries. In Leonid Reyzin and Douglas Stebila, editors, CRYPTO 2024, Part III, volume 14922 of LNCS, pages 3–33. August 2024. Springer, Cham. DOI: 10.1007/978-3-031-68382-4_1
[DD22]
Nico Döttling and Jesko Dujmovic. Maliciously Circuit-Private FHE from Information-Theoretic Principles. In Dana Dachman-Soled, editor, ITC 2022, volume 230 of LIPIcs, pages 4:1–4:21. July 2022. Schloss Dagstuhl. DOI: 10.4230/LIPIcs.ITC.2022.4
[DDA13]
Angsuman Das, Sabyasachi Dutta, and Avishek Adhikari. Indistinguishability against Chosen Ciphertext Verification Attack Revisited: The Complete Picture. In Willy Susilo and Reza Reyhanitabar, editors, ProvSec 2013, volume 8209 of LNCS, pages 104–120. October 2013. Springer, Berlin, Heidelberg. DOI: 10.1007/978-3-642-41227-1_6
[DM15]
Léo Ducas and Daniele Micciancio. FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second. In Elisabeth Oswald and Marc Fischlin, editors, EUROCRYPT 2015, Part I, volume 9056 of LNCS, pages 617–640. April 2015. Springer, Berlin, Heidelberg. DOI: 10.1007/978-3-662-46800-5_24
[FGP14]
Dario Fiore, Rosario Gennaro, and Valerio Pastro. Efficiently Verifiable Computation on Encrypted Data. In Gail-Joon Ahn, Moti Yung, and Ninghui Li, editors, ACM CCS 2014, pages 844–855. November 2014. ACM Press. DOI: 10.1145/2660267.2660366
[FNP20]
Dario Fiore, Anca Nitulescu, and David Pointcheval. Boosting Verifiable Computation on Encrypted Data. In Aggelos Kiayias, Markulf Kohlweiss, Petros Wallden, and Vassilis Zikas, editors, PKC 2020, Part II, volume 12111 of LNCS, pages 124–154. May 2020. Springer, Cham. DOI: 10.1007/978-3-030-45388-6_5
[FV12]
Junfeng Fan and Frederik Vercauteren. Somewhat Practical Fully Homomorphic Encryption. Cryptology ePrint Archive, Report 2012/144. 2012.
[GBK+24]
Mariana Gama, Emad Heydari Beni, Jiayi Kang, Jannik Spiessens, and Frederik Vercauteren. Blind zkSNARKs for Private Proof Delegation and Verifiable Computation over Encrypted Data. Cryptology ePrint Archive, Paper 2024/1684. 2024.
[GGM86]
Oded Goldreich, Shafi Goldwasser, and Silvio Micali. How to Construct Random Functions. Journal of the ACM, 33(4):792–807, October 1986. DOI: 10.1145/6490.6503
[GGW24]
Sanjam Garg, Aarushi Goel, and Mingyuan Wang. How to Prove Statements Obliviously?. In Leonid Reyzin and Douglas Stebila, editors, CRYPTO 2024, Part X, volume 14929 of LNCS, pages 449–487. August 2024. Springer, Cham. DOI: 10.1007/978-3-031-68403-6_14
[GNS21]
Chaya Ganesh, Anca Nitulescu, and Eduardo Soria-Vazquez. Rinocchio: SNARKs for Ring Arithmetic. Cryptology ePrint Archive, Report 2021/322. 2021.
[GNS23]
Chaya Ganesh, Anca Nitulescu, and Eduardo Soria-Vazquez. Rinocchio: SNARKs for Ring Arithmetic. Journal of Cryptology, 36(4):41, October 2023. DOI: 10.1007/s00145-023-09481-3
[GW13]
Rosario Gennaro and Daniel Wichs. Fully Homomorphic Message Authenticators. In Kazue Sako and Palash Sarkar, editors, ASIACRYPT 2013, Part II, volume 8270 of LNCS, pages 301–320. December 2013. Springer, Berlin, Heidelberg. DOI: 10.1007/978-3-642-42045-0_16
[GYW+23]
Xiaojie Guo, Kang Yang, Xiao Wang, Wenhao Zhang, Xiang Xie, Jiang Zhang, and Zheli Liu. Half-Tree: Halving the Cost of Tree Expansion in COT and DPF. In Carmit Hazay and Martijn Stam, editors, EUROCRYPT 2023, Part I, volume 14004 of LNCS, pages 330–362. April 2023. Springer, Cham. DOI: 10.1007/978-3-031-30545-0_12
[HJ24]
Janik Huth and Antoine Joux. MPC in the Head Using the Subfield Bilinear Collision Problem. In Leonid Reyzin and Douglas Stebila, editors, CRYPTO 2024, Part I, volume 14920 of LNCS, pages 39–70. August 2024. Springer, Cham. DOI: 10.1007/978-3-031-68376-3_2
[HJ25]
Janik Huth and Antoine Joux. VOLE-in-the-Head Signatures from Subfield Bilinear Collisions. In Advances in Cryptology – ASIACRYPT 2025, pages 3–34. 2025. Springer-Verlag. DOI: 10.1007/978-981-95-5113-2_1
[IKOS07]
Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, and Amit Sahai. Zero-knowledge from secure multiparty computation. In David S. Johnson and Uriel Feige, editors, 39th ACM STOC, pages 21–30. June 2007. ACM Press. DOI: 10.1145/1250790.1250794
[LM21]
Baiyu Li and Daniele Micciancio. On the Security of Homomorphic Encryption on Approximate Numbers. In Anne Canteaut and François-Xavier Standaert, editors, EUROCRYPT 2021, Part I, volume 12696 of LNCS, pages 648–677. October 2021. Springer, Cham. DOI: 10.1007/978-3-030-77870-5_23
[LMSV12]
Jake Loftus, Alexander May, Nigel P. Smart, and Frederik Vercauteren. On CCA-Secure Somewhat Homomorphic Encryption. In Ali Miri and Serge Vaudenay, editors, SAC 2011, volume 7118 of LNCS, pages 55–72. August 2012. Springer, Berlin, Heidelberg. DOI: 10.1007/978-3-642-28496-0_4
[MN24]
Mark Manulis and Jérôme Nguyen. Fully Homomorphic Encryption Beyond IND-CCA1 Security: Integrity Through Verifiability. In Marc Joye and Gregor Leander, editors, EUROCRYPT 2024, Part II, volume 14652 of LNCS, pages 63–93. May 2024. Springer, Cham. DOI: 10.1007/978-3-031-58723-8_3
[NLDD23]
Deepika Natarajan, Andrew D. Loveless, Wei Dai, and Ronald G. Dreslinski. Chex-Mix: Combining Homomorphic Encryption with Trusted Execution Environments for Oblivious Inference in the Cloud. In 2023 IEEE European Symposium on Security and Privacy, pages 73–91. July 2023. IEEE Computer Society Press. DOI: 10.1109/EuroSP57164.2023.00014
[OPP14]
Rafail Ostrovsky, Anat Paskin-Cherniavsky, and Beni Paskin-Cherniavsky. Maliciously Circuit-Private FHE. In Juan A. Garay and Rosario Gennaro, editors, CRYPTO 2014, Part I, volume 8616 of LNCS, pages 536–553. August 2014. Springer, Berlin, Heidelberg. DOI: 10.1007/978-3-662-44371-2_30
[Roy22]
Lawrence Roy. SoftSpokenOT: Quieter OT Extension from Small-Field Silent VOLE in the Minicrypt Model. In Yevgeniy Dodis and Thomas Shrimpton, editors, CRYPTO 2022, Part I, volume 13507 of LNCS, pages 657–687. August 2022. Springer, Cham. DOI: 10.1007/978-3-031-15802-5_23
[VKH23]
Alexander Viand, Christian Knabenhans, and Anwar Hithnawi. Verifiable fully homomorphic encryption. arXiv preprint arXiv:2301.07041, 2023.
[ZLW+25]
Zhelei Zhou, Yun Li, Yuchen Wang, Zhaomin Yang, Bingsheng Zhang, Cheng Hong, Tao Wei, and Wenguang Chen. ZHE: Efficient Zero-Knowledge Proofs for HE Evaluations. In Marina Blanton, William Enck, and Cristina Nita-Rotaru, editors, 2025 IEEE Symposium on Security and Privacy, pages 3328–3346. May 2025. IEEE Computer Society Press. DOI: 10.1109/SP61157.2025.00199
[ZPS12]
Zhenfei Zhang, Thomas Plantard, and Willy Susilo. Reaction Attack on Outsourced Computing with Fully Homomorphic Encryption Schemes. In Howon Kim, editor, ICISC 11, volume 7259 of LNCS, pages 419–436. 2012. Springer, Berlin, Heidelberg. DOI: 10.1007/978-3-642-31912-9_28
[ZWL+25]
Xinxuan Zhang, Ruida Wang, Zeyu Liu, Binwu Xiang, Yi Deng, and Xianhui Lu. FHE-SNARK vs. SNARK-FHE: From Analysis to Practical Verifiable Computation. Cryptology ePrint Archive, Paper 2025/302. 2025.
History
Submitted: 2026-01-31
Accepted: 2026-07-08
Published: 2026-08-03
Accepted: 2026-07-08
Published: 2026-08-03
How to cite
Janik Huth, Antoine Joux, and Giacomo Santato, Fherret: Proof of FHE Correct-and-Honest Evaluation with Circuit Privacy from MPCitH. IACR Communications in Cryptology, vol. 3, no. 2, Aug 03, 2026, doi: 10.62056/av4fe0fgx.
License
Copyright is held by the author(s)
This work is licensed under a Creative Commons Attribution (CC BY) license.