The Calculation And Application Of Privacy Protection For Rational Interval Problem

With the rapid development of science and technology and the continuous spread of information technology,it has become a universal social phenomenon to share data among entities to perform some joint computation.But in real life,many data include personal private information.If private information is shared with oth-ers without protection,it will result in very serious consequences.Therefore,in an information society,how to share data information with others while preserving the privacy is a major problem we are facing,and is also a huge challenge for in-formation security.Secure multi-party computation(SMC)came into being under this background and has become a powerful tool to preserve data privacy in data sharing.SMC makes multiple distrusted participants with private data cooperate to perform cooperative computation on their private data while preserving the data privacy.After the computation,each participant cannot get any additional infor-mation except what is revealed by the output of the function.SMC has been studied for several decades,and has formed many branches,one of which is secure multi-party scientific computation.Privately determining the relationship between private intervals in is an important problem of the secure multi-party scientific computation.It can be widely used in time negotiation,location search,price negotiation,range query,and database matching etc.Privacy-preserving interval computation includes:privately determining the location relationship between a private number and a private interval and privately determining the relationship between the two intervals.At present,most,works focus on privately determining the location relationship between a private integer and a private integer interval,and between two private integer intervals.A few works study the location relationship between a private number and rational interval,and there hardly is work on the location relationship between two rational intervals.On the basis of previous studies,we make an in-depth research on the private rational interval computation.The main research contents are as follows:1.Based on the Paillier homomorphic encryption algorithm,we propose two secure multiparty computation protocols to privately determine the relationship between a private rational number and a private interval.We prove that these protocols are secure in the semi-honest model.Analysis shows that our protocols outperform the existing protocols for the computational complexity and communi-cation complexity.Secondly,we test the practical efficiency of the protocols on a personal computer.The efficiency shows that our protocols are practical.Finally,we demonstrate some applications of secure multiparty interval computation.2.Based on the secure multiparty computation protocol for the relationship between a rational number and a rational interval in the semi-honest model,we use Goldreich's compiler to transform it into a protocol which is secure in the malicious model.We further analyze its correctness and prove its security.3.We study how to private determining the relationship between two private rational intervals.The research includes:we propose different secure multiparty computation protocols for different scenarios;we analyze the and prove the secu-rity of the protocols;we analyze the computational complexity and communication complexity of the protocols and test the efficiency of these protocols on our personal computer;we show some examples to illustrate the applications of the proposed protocols in secure computational geometry and in real life.