Security And Complexity Analysis Of The Secure Two-party Computing Model Under Convolutional Concealment Techniques

Secure two-party computation refers to two sides distrust participants while protecting the privacy of their participation calculation. The results so that each party can get the correct output and each side can only know their input and output, without knowing about the input and output of others. Secure two-party computation is actually a distributed network protocol between users, which enables the user to complete the cooperation calculated task without leaking their information.The classic security two-party computation problem has focused on the mode of zero information leakage. Although it is the ideal model for the security computation,it is costly and inefficient in the actual calculations. We proposed the security two parties convolution computational problem from the traditional model in this paper.Established a secure of nothing information disclosed calculation model and a secure issue of need some information to disclosure abased on the convolution two-party computation problem, which provided a method for balance between safety and efficiency in the security two-party computation problem. Details as follow:1. Researched on a few basic secure two-party sum and product problems in this paper. Proposed the corresponding protocols and analyzed the security and complexity of it. Then, based on traditional security issues on parties calculated, we proposed the security two parties convolution computation problem which considering the case of the participants' data are sequence of number.2. Based on the calculation of convolution secure two parties established a secure third-party participation model, and constructed two security protocols under different demand. Security and protocol complexity is analyzed, we discussed the feasibility of sacrificing safety improve computational efficiency between participants.3. Proposed a simple quantitative criterion of complexity in this paper. We analyzed the complexity of different protocols about the security two-party convolution computation problem and quantified it, which can provide an approach for parties to choose reasonable protocols according to the participants to the securityrequirements.