Revisiting Fully Homomorphic Encryption Schemes
Nimish Jain, Aswani Kumar Cherukuri

TL;DR
This paper reviews various fully homomorphic encryption schemes, analyzing their features, comparing results, and discussing applications and open-source tools to facilitate secure computations on sensitive data.
Contribution
It provides a comprehensive analysis and comparison of existing fully homomorphic encryption schemes, highlighting their applications and available open-source tools.
Findings
Different schemes vary in efficiency and security
Applications include cloud computing, medical data, and finance
Open-source tools facilitate implementation and testing
Abstract
Homomorphic encryption is a sophisticated encryption technique that allows computations on encrypted data to be done without the requirement for decryption. This trait makes homomorphic encryption appropriate for safe computation in sensitive data scenarios, such as cloud computing, medical data exchange, and financial transactions. The data is encrypted using a public key in homomorphic encryption, and the calculation is conducted on the encrypted data using an algorithm that retains the encryption. The computed result is then decrypted with a private key to acquire the final output. This abstract notion protects data while allowing complicated computations to be done on the encrypted data, resulting in a secure and efficient approach to analysing sensitive information. This article is intended to give a clear idea about the various fully Homomorphic Encryption Schemes present in the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCryptography and Data Security · Coding theory and cryptography · Complexity and Algorithms in Graphs
