Noiseless fully homomorphic public key encryption method based on binary truncated polynomial ring

Abstract

The invention discloses a noiseless fully homomorphic public key encryption method based on a binary truncated polynomial ring and is used for solving the technical problem that in the prior art, keys and ciphertexts are too long and the ciphertext homomorphic computation efficiency is low. The method comprises the realization steps that a user sets parameters, obtaining a decryption private key, an encryption public key and a ciphertext homomorphic computation public key, establishes the binary truncated polynomial ring, carries out probability encryption on a plaintext through adoption of the encryption public key to obtain the ciphertext belonging to the binary truncated polynomial ring, and decrypts the ciphertext through adoption of the decryption private key to obtain the plaintext corresponding to the ciphertext; a cloud server carries out homomorphic computation on the ciphertext through adoption of the ciphertext homomorphic computation public key, thereby obtaining the homomorphic ciphertext belonging to the binary truncated polynomial ring; and the user decrypts the homomorphic ciphertext through adoption of the decryption private key, thereby obtaining a result obtained by carrying out the same computation on the corresponding ciphertexts. According to the method, the lengths of the ciphertexts and the keys are normal levels and the homomorphic computation efficiency is high.

Description

technical field [0001] The present invention relates to a fully homomorphic encryption method, in particular to a noiseless fully homomorphic public key encryption method based on binary truncated polynomial rings, which can be applied to cloud computing, big data and other data entrusted computing services to provide important data Storage, access, statistics, mining and other full confidential privacy protection. Background technique [0002] With the explosive growth of digital information and the increasing dependence of individuals and organizations on such information, large-scale databases have gradually become the center of the entire information system, and data has become the most important asset. For the use of large-scale data, the database is often outsourced to a third party in the form of entrusted computing, but there is a risk of information leakage, which requires encryption of the database to protect the privacy of the data. However, the general data encr...

AI Technical Summary

Problems solved by technology

[0005] The purpose of the present invention is to overcome the defects in the above-mentioned prior art, and propose a noise-free fully homomorphic public key encryption method based on a binary truncated polynomial ring, which is used to solve the key and ciphertext process problems existing in the prior art. Long and low-efficiency ciphertext homomorphic calculation technical problems

Images