Research On Several Secure Query Protocol Of Database

Secure Multi-Party Computation is first proposed by A.C.Yao in1982,the study that two or more participates want to cooperation compute a promissory function in the distrust of Network environment. any participant can noe disclose any privacy inputs information to any other one, But after the computation, to ensure that each participants can get the results of this function.In the past, Secure Multi-Party Computation research mostly focusing on theoretical studies, and few applied problems have been studied. Later scholars have done this in-depth research, there are a few applied problem of Secure Multi-Party Computation, such as the Private Information Retrieval problem,privacy-preserving statistical database, privacy-preserving data mining and so on.e With the SMC applied in different areas of promotion, it will become an indispensable part of Information Security in real life.Secure multi-party computation usually divided into two research aspects:the general secure multi-party computation and the special secure multi-party computation. Such as the problem of the Secret Sharing and oblivious transfer is a general secure multi-party computation; the problem of special secure multi-party computation has:Secure Multi-party Geometry Computation, Secure Database Query problem. Statistical Analysis problem and so on. Two problems have a large number of research results, but there are still many secure multi-party computation problem is not resolved, and need to study further. This paper study the special secure multi-party computation, that is, the problem of database secure query, mainly study the problems of secure multi-party computation applied in the secure query of database. Specifically focuses on the following four aspects:First, secure query protocol for string approximate matching, the query problem of string approximate matching, It can be applied many fields broadly, such as medicine and commerce field. Research on it has important significance of secure query character data of database information. This paper analyses the progress of currently research and the deficiency of existing protocols on the query of character data.Based on the secure computing edit distance protocols, the oblivious transfer protocols and the homomorphism encryption schemes, a secure query protocol for string approximate matching is proposed. Furthermore, the correctness, the security and the computational complexity of this scheme are as well analyzed.Secondly, the problem of database's secure query. To protect two party privacy of database's query, known solutions are encrypt the entire database and thus the encryption cost is excessively high.To resolve this problem,we construct a new efficient solution to database's query, Based on the assumption of combination commutative encryption and the oblivious transfer protocol. The protocol can safely and efficiently finished database's secure query lack of third-party participation and lack of encrypt entire database. Furthermore, the correctness, the security and the computational complexity of this scheme are as well analyzed. The results of analysis show that compared with known solutions, the proposed scheme has much less computational complexity.