Research On Secure Multi-Party Matrix Calculation Protocols And Its Application In E-Voting

Nowadays,with the rapid development of information technology,it is possible for multiple participants to collaborate in computing through the network,But there are a lot of security risks,the problem of information security is becoming more and more serious.In such a complex network environment,most of the participants do not trust each other,so cooperative computing through the network is not safe.In order to protect the information security of each participant,Secure Multi-party Computing appeared.With the rise of emerging technologies such as big data? artificial intelligence,more application scenarios and research directions have been provided for Secure Multi-party Computing.A number of Secure Multi-party Computing protocols have been proposed,but the efficiency of some protocols needs to be improved.For example,some existing secure multi-party matrix product and matrix summation protocols require the frequent invocation of two-party matrix computation protocols and frequent communication between participants is required,But this directly leads to high communication complexity.The continuous communication between participants also makes it difficult for the protocol to be applied in the poor network environment.As one of the main research directions in secure multi-party computing,e-voting protocol is widely used in real life.Some of the electronic voting protocols that are frequently used have some problems that cannot be ignored,such as in the FOO electronic voting protocol,FOO electronic voting protocol is considered to be the most safe and reliable,But there are still some problems,such as the need for third-party counting centers,but it is difficult to have a credible third party in real life.In view of the above problems,the research work of this thesisis as follows:(1)According to the characteristics of matrix multiplication,based on the Paillier encryption algorithm and Paillier threshold encryption algorithm,the secure two-party matrix product protocol and the secure multi-party matrix product protocol with low communication cost and complete resistance to collusion attack are given respectively.(2)Firstly,in the case of low latitude matrix and small matrix components,a secure multi-party matrix summation protocol with low communication cost,high efficiency and complete resistance to collusion is proposed by using Godel coding and ElGamal threshold encryption algorithm.Secondly,a new matrix coding method is proposed,and a secure multi-party matrix summation protocol is designed based on the elliptic curve threshold encryption algorithm.The protocol not only has low communication cost and high efficiency but also can completely resist multi-party collusion.In addition,the protocol has a wide range of application and high practical value.(3)Through the matrix computing protocol designed to construct the electronic voting scheme,combined with digital signature and other technologies,the designed protocol can meet the eight basic characteristics of electronic voting.The scheme does not have a third-party counting center,thus avoiding the insecurity caused by the third-party counting center.