Research On Several Application Protocols Of Secure Multi-Party Computation

A Secure Multi-party Computation problem (SMC) refers to the problem that two or more parties want to jointly compute a promissory function under the condition of their privacy-preservation, after that each of the participants know the output of the function while no one knows any information entered. Special SMC, that is, SMC in the context of different applications, is to find efficient and practical solutions for specific SMC problem. It is the current hot research on SMC. SMC should satisfy two basic requirements:First is to ensure the correctness of output, and the other is to ensure the confidentiality of input. This problem that was first proposed by Yao is creative problem in the SMC. Later scholars have done this in-depth research. SMC has generated a lot of research directions, such as secret sharing, computational geometry, on-line negotiations, electronic voting and so on. Although SMC has just begun in real life, but it will certainly become an indispensable part of Information Security.This thesis mainly studies the applications of SMC in some special fields. At present, research on SMC are of great interest and have already got good results. The main work of this article as follow:At first, two protocols for privacy-preserving multi-rank. Two protocols are proposed which are used to solve the problem of multi-ranking under the condition of privacy-preservation. The first protocol use Data Perturbation Assumption and special vector data to achieve the result through the XOR and replacement operation. Based on public key cryptography the second one gets the same result. In semi-honest model, two Protocols are both get better result as mentioned above.Secondly, security scheme for statistics of data query. T has an n-stored datas in public databases DB. It was provided for the n registered users to search. These users want to query information from the DB, but do not want to reveal it. At the same time, the public database would also like to conduct a research about statistical analysis in order to provide better service. Based on oblivious transfer protocol, we give a solution to the problem.Thirdly, privacy-preserving line-divide-polygon's area protocol. A new problem is proposed, that is, in the same plane, Alice has a convex polygon and Bob has a straight line. The straight line intersect with the convex polygon so convex polygon is divided into two parts. Both of them do not want to tell each other their private information, but Alice want to know the two divided areas. Based on scalar product protocol and Monte Carlo Method, author gives a solution to the new problem.At last, a coercion-resistant electronic voting scheme. A new coercion-resistant electronic voting scheme is proposed which has employed these security techniques above. The scheme meets the essential requirements of e-voting scheme. Furthermore, it solves the problem on forcing voter to vote and buying vote. It is infeasible for the coercer to determine if a coerced voter complies with the demands, so it improves coercion-resistance of electronic voting scheme.