Research And Application Of Data Comparison And Set Problems For Privacy Protection

With the rapid development of information technology and the advent of the“Internet +” era,big data has been applied to all aspects of people’s social interaction,transactions and shopping.People can complete many operations without leaving their house.But at the same time,a large amount of data is exposed to the network,Valuable private information is constantly being mined,and people’s privacy has suffered unprecedented threats.The protection has become the focus of all sectors of society.Since secure multi-party computing can complete interactive computing without revealing privacy,the research on secure multi-party computing has important scientific research significance and practical application value at the moment when privacy protection is urgently needed.This paper mainly studies the problem of secure multi-party computing under privacy protection.We started with the data comparison problem and the set operation problem,constructed the millionaire protocol and the set intersection protocol,and introduced the constructed protocol into the social network,and designed a solution for the secure multi-party query system in the social network environment.Main tasks as follows:(1)Aiming at the current data comparison problem,the algorithm is redundant and the efficiency is low.The millionaire protocol based on 0-1 encoding is proposed using 0-1 encoding,which combines the properties of homologous encryption.The security of the protocol is proved through simulation examples.The performance of the protocol is analyzed from both theoretical and experimental perspectives.The results show that the overall performance of the protocol Better;At the same time,this issue was extended,two solutions to the socialist millionaire problem were proposed,and the security,correctness and efficiency of the agreement were analyzed,and the result is excellent..(2)In order to meet the needs of the shared data and information of the participants in secure computing in social networks,the intersection of secure multi-party sets and the number of intersections are studied.Taking the millionaire problem as the basic research module,under the semi-honest model,a confidential set intersection potential protocol based on 0-1 encoding is proposed.Prove the correctness and security of the protocol,and select related protocols for comparison.The results show that the designed protocol has lower computational complexity.In addition,we propose two confidential set intersection calculation protocols based on ciphertext comparison,and complete the correctness,security and efficiency analysis of the protocol.(3)In order to protect the privacy of user information in social networks,using the constructed secure multi-party computing protocol,a solution to the secure query system in the social network environment is designed.The solution can effectively solve the problem of security query of friend push,security query of the number of mutual friends and confidential query in the social network system.Under the semi-honest model,the specific execution process and safety analysis of the scheme are given.The analysis proves that the solution can effectively ensure that the private data of the query user is not leaked,and the secure query can be completed even in the presence of an untrusted third party.