Reseach Of The Multikey Property On Fully Homomorphic Encryption Scheme Over The Integers

Fully homomorphic encryption allows arbitrary computation on encrypted data. Inother words, fully homomorphic encryption can map arbitrary computation of plaintextto the corresponding specific manipulation of ciphertext, this homogeneity makes itpossible that one can compute encrypted data in the un-trusted terminal encryption.FHE is only suitable in settings where the computations involve a single user, sinceit requires inputs to be encrypted under the same key. However, there are manyscenarios where users who uploaded their data to the cloud in encrypted form indifferent places, then decide to compute some joint function of their data (For example:average). The multiparty scenario is significantly more complex. Here I present a notionof fully homomorphic encryption that we call a multikey FHE.Based on the above characteristics and applications in scenarios of multiparty overthe fully homomorphic encryption, this paper researches the multikey property andpropose a solution to the problem of average pay. The main work is as follows:1. I analyze the developing background, present situation and application of thefully homomorphic.2.I give some basic concepts of FHE, and introduce fully homomorphic encryptionscheme(FHE) over the integers particularly.3.I discuss and research the multikey property of the fully homomorphicencryption scheme over the integers.4.I propose a solution to the problem of average pay based on the multikeyproperty.