Abstract
The widespread use of cloud technology allows optimizing the economic costs of maintaining the IT infrastructure of enterprises, but this increases the likelihood of theft of confidential data. One of the mechanisms to protect data from theft is cryptography. Using the classical primitives of symmetric and asymmetric encryption does not allow processing data in encrypted form. Homomorphic encryption is used for processing confidential data. Homomorphic encryption allows performing of arithmetic operations over encrypted text and obtaining an encrypted result that corresponds to the result of operations performed over plaintext. One of the perspective directions for constructing homomorphic ciphers is homomorphic ciphers based on Learning with Errors. In this paper we examine the cryptographic properties of existing homomorphic ciphers (CKKS, BFV) based on Learning with Errors, compare their technical characteristics: cryptographic strength and data redundancy, data encoding and decoding speed, speed of arithmetic operations, such as addition and multiplication, KeySwitching operation speed.
Highlights
For large enterprises of any line of business, for smooth operation, it is necessary to maintain information channels, as well as timely processing and transmission of information
Based on the analysis of the HE [3,4,5,6,7,8] schemes, we chose two for the research: Cheon, Kim, Kim and Song (CKKS) [12] and Brakerski/Fan-Vercauteren (BFV) [9], [10], [11]. Their main feature is the use of the Residue Number System (RNS) for performing operations in schemes
Homomorphic encryption (FHE) is a form of encryption, which has to satisfy the additional requirement of homomorphism with respect to any operations on plaintexts
Summary
For large enterprises of any line of business, for smooth operation, it is necessary to maintain information channels, as well as timely processing and transmission of information. The fact that homomorphic encryption allows performing calculations (changing) of information without having to decrypt it can increase performance and speed up the response time of the entire network, while maintaining a high degree of security. Based on the analysis of the HE [3,4,5,6,7,8] schemes, we chose two for the research: Cheon, Kim, Kim and Song (CKKS) [12] and Brakerski/Fan-Vercauteren (BFV) [9], [10], [11] Their main feature is the use of the Residue Number System (RNS) for performing operations in schemes. 4 sets of parameters are taken, which determine the dependence of performance on the degree of required security
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Proceedings of the Institute for System Programming of the RAS
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
