Design Of FindU Protocol Based On Multi Key Full Homomorphic Encryption

With the development of cloud computing,people can easily perform various calculations on the cloud,but at the same time,there is a risk of data leakage,which has immeasurable consequences.How to conduct secure computing while protecting private data is a hot research topic.Homomorphic encryption provides a good solution to the above problems.Homomorphic encryption is a special encryption scheme that allows anyone to directly calculate the encrypted text,and the decryption result is the same as that of the same calculation on the plaintext.This avoids the risk of data disclosure.This paper proposes a multi-party set intersection size calculation protocol,multi-party comparison protocol,and multi-party set intersection calculation protocol based on multi key homomorphism,as follows:1.The Find U protocol is provided in mobile social networks,which are typically hostile environments and therefore require strict security mechanisms.Based on the Find U protocol,this paper proposes a multi-party set intersection size calculation protocol based on multi key homomorphism,and analyzes the correctness of the protocol.It is proved that the protocol is secure in the semi honest adversary model,and the security is based on the LWE problem and RLWE problem.2.This paper proposes a multi-party comparison protocol and a multi-party set intersection computation protocol based on multi key homomorphism,analyzes the correctness of the multi-party comparison protocol and the multi-party set intersection computation protocol,and proves that they are secure under the semi honest adversary model.Implementing the multi-party set intersection large and small computation protocol,the multi-party comparison protocol,and the multi-party set intersection computation protocol can achieve privacy level 3 in the Find U protocol.