Search for collections on FTS Digilib

Integrating Fully Homomorphic Encryption and Zero-Knowledge Proofs for Efficient Verifiable Computation

Qureshi, UmmeAmmara and Doshi, Bhumika and More, Aditya and Joshi, Kashyap and Kumar, Kapil (2026) Integrating Fully Homomorphic Encryption and Zero-Knowledge Proofs for Efficient Verifiable Computation. Journal of Computing Theories and Applications, 3 (3). pp. 274-285. ISSN 3024-9104

[thumbnail of JCTA_14181_publish.pdf]
Preview
Text
JCTA_14181_publish.pdf
Available under License Creative Commons Attribution.

Download (531kB) | Preview

Abstract

Fully Homomorphic Encryption (FHE) enables computation on encrypted data with end-to-end confidentiality; however, its practical adoption remains limited by substantial computational costs, including long encryption and decryption times, high memory consumption, and operational latency. Zero-Knowledge Proofs (ZKPs) complement FHE by enabling correctness verification without revealing sensitive information. This study integrates both techniques to enable encrypted computation with verifiably consistent results. A prototype system is implemented in Python using Microsoft SEAL and PySNARK. Experimental results show that integrating ZKPs introduces a stable runtime overhead of approximately 15–20% while enabling verification without plaintext disclosure. The system demonstrates feasible scalability for datasets up to 1 GB on mid-level hardware.

Keywords: Cryptography; Fully Homomorphic Encryption; Microsoft SEAL; Privacy-Preserving Systems; Python; Secure Computation; Zero-Knowledge Proofs; zk-SNARK.

Item Type: Article
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Depositing User: dl fts
Date Deposited: 27 Dec 2025 13:21
Last Modified: 27 Dec 2025 13:21
URI: https://dl.futuretechsci.org/id/eprint/140

Actions (login required)

View Item
View Item