A fast verifiable fully homomorphic encryption technique for secret computation on cloud data

A fast verifiable fully homomorphic encryption technique for secret computation on cloud data

연구 분야: Cryptography

학회: International Journal of Information Technology

In the domain of cloud computing, safeguarding the confidentiality and integrity of outsourced sensitive data during computational processes is of utmost importance. This paper introduces a pioneering verifiable homomorphic encryption (VFHE) scheme, combining data encryption with the ability to verify computation integrity through homomorphic operations. The proposed approach leverages a fast lattice-based reduction key generation method, drastically reducing key generation time and resulting in a substantial reduction in key size while maintaining security. By integrating this innovation into a fully homomorphic encryption scheme, cloud data computations are expedited while preserving data security. The efficiency of the proposed scheme is highlighted through analyses of key generation time, encryption, decryption, and verification processes across varying security parameters. Verification time remains minimal, showcasing the practical applicability of our approach. Furthermore, novel metrics such as privacy cost and amortized cost are introduced to evaluate the efficiency and overhead associated with incorporating privacy into the verifiable computation scheme. The proposed VFHE scheme not only ensures data security but also substantially improves computation speed, making it a promising solution for enhancing privacy and efficiency in cloud computing applications.