DataSeal: Ensuring the Verifiability of Private Computation on Encrypted Data
Muhammad Husni Santriaji, Jiaqi Xue, Yancheng Zhang, Qian Lou, Yan Solihin
摘要
Fully Homomorphic Encryption (FHE) allows computations to be performed directly on encrypted data without needing to decrypt it first. This “encryption-in-use” feature is crucial for securely outsourcing computations in privacy-sensitive areas such as healthcare and finance. Nevertheless, in the context of FHE-based cloud computing, clients often worry about the integrity and accuracy of the outcomes. This concern arises from the potential for a malicious server or server-side vulnerabilities that could result in tampering with the data, computations, and results. Ensuring integrity and verifiability with low overhead remains an open problem, as prior attempts have not yet achieved this goal. To tackle this challenge and ensure the verification of FHE's private computations on encrypted data, we introduce DataSeal, which combines the low overhead of the algorithm-based fault tolerance (ABFT) technique with the confidentiality of FHE, offering high efficiency and verification capability. Through thorough testing in diverse contexts, we demonstrate that DataSeal achieves much lower overheads for providing computation verifiability for FHE than other techniques that include MAC, ZKP, and TEE. DataSeal's space and computation overheads decrease to nearly negligible as the problem size increases.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper5
- DictPFL: Efficient and Private Federated Learning on Encrypted GradientsJiaqi Xue, Mayank Kumar, Yuzhang Shang, Shangqian Gao 等NeurIPS 2025 · 被引用 4 次
- zkVC: Fast Zero-Knowledge Proof for Private and Verifiable ComputingYancheng Zhang, Mengxin Zheng, Xun Chen, Jingtong Hu 等DAC 2025 · 被引用 3 次
- GlitchFHE: Attacking Fully Homomorphic Encryption Using Fault InjectionLakshmi Likhitha Mankali, Mohammed Nabeel, Faiq Raees, Michail Maniatakos 等USENIX Security 2025
- FHE-Coder: Benchmarking Secure Agentic Code Generation for Fully Homomorphic EncryptionMayank Kumar, Jiaqi Xue, Mengxin Zheng, Qian LouICLR 2026
- CipherPrune: Efficient and Scalable Private Transformer InferenceYancheng Zhang, Jiaqi Xue, Mengxin Zheng, Mimi Xie 等ICLR 2025
它引用的顶会 Paper13
- Bulletproofs: Short Proofs for Confidential Transactions and MoreBenedikt Bünz, Jonathan Bootle, Dan Boneh, Andrew Poelstra 等S&P 2018 · 被引用 1,285 次
- GAZELLE: A Low Latency Framework for Secure Neural Network InferenceChiraag Juvekar, Vinod Vaikuntanathan, Anantha P. ChandrakasanUSENIX Security 2018 · 被引用 1,075 次
- Wolverine: Fast, Scalable, and Communication-Efficient Zero-Knowledge Proofs for Boolean and Arithmetic CircuitsChenkai Weng, Kang Yang, Jonathan Katz, Xiao WangS&P 2021 · 被引用 205 次
- CraterLake: a hardware accelerator for efficient unbounded computation on encrypted dataNikola Samardzic, Axel Feldmann, Aleksandar Krastev, Nathan Manohar 等ISCA 2022 · 被引用 205 次
- ARK: Fully Homomorphic Encryption Accelerator with Runtime Data Generation and Inter-Operation Key ReuseJongmin Kim, Gwangho Lee, Sangpyo Kim, Gina Sohn 等MICRO 2022 · 被引用 160 次
相关 Paper
- SHARP: A Short-Word Hierarchical Accelerator for Robust and Practical Fully Homomorphic EncryptionJongmin Kim, Sangpyo Kim, Jaewan Choi, Jaiyoung Park 等ISCA 2023 · 被引用 110 次
- VERITAS: Plaintext Encoders for Practical Verifiable Homomorphic EncryptionSylvain Chatel, Christian Knabenhans, Apostolos Pyrgelis, Carmela Troncoso 等CCS 2024 · 被引用 9 次
- SoK: Fully Homomorphic Encryption CompilersAlexander Viand, Patrick Jattke, Anwar HithnawiS&P 2021 · 被引用 117 次
- Reliable Non-Leveled Homomorphic Encryption for Web ServicesBaigang Chen, Dongfang ZhaoWWW 2026 · 被引用 1 次
- ZHE: Efficient Zero-Knowledge Proofs for HE EvaluationsZhelei Zhou, Yun Li, Yuchen Wang, Zhaomin Yang 等S&P 2025
