Phalanx: An FHE-Friendly SNARK for Verifiable Computation on Encrypted Data
Xinxuan Zhang, Ruida Wang, Zeyu Liu, Binwu Xiang, Yi Deng, Ben Fisch, Xianhui Lu
2025Year
3Top-tier citations
Abstract
Verifiable Computation over encrypted data (VCoed) has two popular paradigms: SNARK-FHE (applying SNARKs to prove FHE operations) and FHE-SNARK (homomorphically evaluating SNARK proofs). For the existing works, FHE-SNARK has a much better efficiency compared to SNARK-FHE.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 7ee63165-0c6b-4fa8-8adc-ada028711f6dCited by top-tier papers3
- HasteBoots: Proving TFHE Programmable Bootstrapping in SecondsFengrun Liu, Haofei Liang, Xiang Xie, Yu Yu et al.USENIX Security 2026
- Relect: Single Secret Leader Election via FHE with Reduced Computation and Communication and Transparent SetupHaofei Liang, Zeyu Liu, Yunhao Wang, Xiang Xie et al.CCS 2026
- UnifOMR: Oblivious Message Retrieval with Near-optimal Concrete EfficiencyBen Fisch, Zeyu Liu, Eran Tromer, Yunhao WangCCS 2026
Builds on22
- GAZELLE: A Low Latency Framework for Secure Neural Network InferenceChiraag Juvekar, Vinod Vaikuntanathan, Anantha P. ChandrakasanUSENIX Security 2018 · 1,075 citations
- Fast Private Set Intersection from Homomorphic EncryptionHao Chen, Kim Laine, Peter RindalCCS 2017 · 446 citations
- PIR with Compressed Queries and Amortized Query ProcessingSebastian Angel, Hao Chen, Kim Laine, Srinath T. V. SettyS&P 2018 · 353 citations
- Ligero: Lightweight Sublinear Arguments Without a Trusted SetupScott Ames, Carmit Hazay, Yuval Ishai, Muthuramakrishnan VenkitasubramaniamCCS 2017 · 338 citations
- Spartan: Efficient and General-Purpose zkSNARKs Without Trusted SetupSrinath T. V. SettyCRYPTO 2020 · 262 citations
Related papers
- Towards Verifiable FHE in Practice: Proving Correct Execution of TFHE's Bootstrapping using plonky2Louis Tremblay Thibault, Michael WalterCCS 2025 · 1 citation
- Garuda and Pari: Faster and Smaller SNARKs via Equifficient Polynomial CommitmentsMichel Dellepere, Pratyush Mishra, Alireza ShirzadUSENIX Security 2026 · 12 citations
- Recursion over Public-Coin Interactive Proof Systems; Faster Hash VerificationAlexandre Belling, Azam Soleimanian, Olivier BégassatCCS 2023 · 5 citations
- PRISM: Efficient zkSNARKs for RNS-Based Homomorphic EncryptionZhelei Zhou, Yun Li, Zhaomin Yang, Cheng Hong et al.CCS 2026
- FxHENN: FPGA-based acceleration framework for homomorphic encrypted CNN inferenceYilan Zhu, Xinyao Wang, Lei Ju, Shanqing GuoHPCA 2023 · 39 citations
