Study On Protocols Of Secure Multiparty Computation

Generally speaking, a secure multiparty computation (SMC) problem deals with computing a function on any input a distributed network where each participant holds one of the inputs, and that no more information is revealed to a participant in the computation than can be inferred from that participant's input and output.Secure multiparty computation protocol is an important area in cryptography. It's the basis of many distributed cryptographic protocols such as threshold cryptosystem, electronic voting and electronic auction, etc. In fact, almost all protocols in distributed environment can be viewed as a special case of secure multiparty computation. It is based on many basic cryptographic protocols and some basic protocols in distributed computation. Although secure multiparty computation protocol is relatively more complex than other cryptography protocols, it has drawn many researchers and institutes' attention in these years. We believe that the field of multiparty computation is today where public-key cryptography was ten years, namely an extremely powerful tool and rich theory whose real-life usage is at this time only beginning but will become in the future an integral part of our computing reality.To sum up, the innovations of this thesis could be summarized as following:1. Research the general secure two-party computation about matrix protocols and give the2. Study the general secure multiparty computation about matrix protocols and discuss the problem like the secure multiparty equation solving problem ect.3. By extending the protocol of matrix production from two-party to multiparty, propose protocols of multiparty inverse matrix computation and analyze the correctness and security of these protocols.4. Detail survey on current electric voting protocols in the last twenty years.5. Propose the protocols about electric voting when there is a secure third party and no secure third party.