An NTRU type multi-key fully homomorphic encryption method with a fast homomorphic operation process

Abstract

The invention belongs to the field of information security and privacy protection, and particularly relates to an NTRU type multi-key fully-homomorphic encryption method with a rapid homomorphic operation process, which comprises the following steps of: 1, optimizing a DHS16 scheme, and constructing a single-key fully-homomorphic encryption scheme; 2, converting the efficient single-user fully-homomorphic encryption scheme in the step 1 into a multi-key fully-homomorphic encryption scheme by utilizing a construction method of the multi-key fully-homomorphic encryption scheme in an LATV12 scheme; Step 3, constructing an independent distributed decryption process on the basis of the multi-key full homomorphic encryption scheme in the step 2, and constructing two rounds of MPC protocols on the basis of the independent distributed decryption process; The method can be effectively applied to secure multi-party computing among multiple users in a cloud computing environment, and has the excellent characteristics of confidentiality, ciphertext availability, collusion attack resistance, quantum attack resistance, capability of allowing the users to participate in independent decryption andthe like.

Description

technical field [0001] The invention belongs to the field of information security and privacy protection, and in particular relates to an NTRU type multi-key fully homomorphic encryption method with a fast homomorphic operation process. Background technique [0002] In today's big data environment, people are more and more inclined to store large amounts of data on powerful cloud servers, and entrust the tedious and complicated data calculation process to the cloud; It provides convenience, but it is also vulnerable to snooping and attacks by illegal organizations and users, thus raising a security issue that cannot be ignored: how to protect users' personal privacy and data security? [0003] Fully homomorphic encryption has the dual attributes of data encryption and ciphertext calculation. It can not only encrypt and protect data, but also support any number of calculations in the ciphertext state. It is the solution to privacy protection and security processing in the clo...

AI Technical Summary

Problems solved by technology

[0002] In today's big data environment, people are more and more inclined to store large amounts of data on powerful cloud servers, and entrust the tedious and complicated data calculation process to the cloud; It provides convenience, but it is also vulnerable to snooping and attacks by illegal organizations and users, thus raising a security issue that cannot be ignored: how to protect users' personal privacy and data security?

[0008] Clear and McGoldrick proposed the first GSW-type MKFHE based on the error learning problem, its security can be reduced to the worst-case difficult problem on the ideal lattice, and there is no upper limit on the number of keys in the scheme; Mukherjee and Wichs carried out the CM15 improved and proposed MKFHE based on LWE, which can be used to implement a one-round threshold decryption protocol, and on this basis, a two-round secure multi-party computing MPC protocol is implemented; the defect of CM15 and MW16 schemes is that they need to The number of users for homomorphic computing is set, and new users cannot be added in real time during the calculation process. This type of MKFHE is called single-hop MKFHE in PS16; at the same time, PS16 proposes the concept of multi-hop MKFHE: the original The ciphertext after the homomorphic operation of the participant can be re-calculated with the ciphertext of the newly added participant, that is, any participant can join in the process of ciphertext operation in real time and dynamically; BP16 proposes a fully dynamic The concept of MKFHE, that is, the number of participants does not need to be set in advance

Images