Study On Multiparty Sercurity Computation Protocol Based On RSA Distributed Computation

After more than 30 years reaserch,RSA public key cryptosystem became one of the most useful and spreaded public key cryptosystems.To satisfy the needs of threadhold signature,a lot of protocols which shared generation of RSA keys were developed.It will be observed valuable for the Sercure Multi-Party Computation.Sercure Multi-Party Computation became more and more important in cryptography.It was proposed by A.C.Yao in 1982.Nowadays,there are still some area to be explored.The Sercure Multi-Party Ranking problem is one of these areas.By combining the result of protocols which shared generation of RSA keys and Sercure Multi-Party Ranking protocol existed yet,this paper developed a new protocol for Secure Multi-party Ranking Problem based on RSA Cryptosystem.This paper is divided to five chapers.The first chaper introduces the backgrund and target of the reaserch of Sercure Multi-Party Computation,which derived Sercure Multi-Party Ranking problem. Continuely,It introduces the history of the cryptography,analyses the treatment and sercure need of cryptography and derived RSA cryptosystem.Finally,illustraes the main contents and the result of the writer's reaserch.The second chapter describes the basic theory and concept of the Sercure Multi-Party Computation and Cryptography.The third chapter explain the protocols for Sercure Multi-Party Ranking problem and shared generation of RSA keys,and concludes the history of the development of these protocols.The forth chapter introduces the work of writer,a new protocol for Secure Multi-party Ranking Problem based on RSA Cryptosystem and a new type of Secure Multi-party Ranking protocols which base on the Euler's theorem.The fifth chapter concludes all of the paper and illustates the future work of the the interaction between applications of the protocol for shared generation of RSA keys and Sercure Multi-Party Computation.The rearult of the paper is:(1)Conclude the]protocol for shared generation of RSA keys.(2)introduce the history of the development of Secure Multi-party Ranking protocols. Make a new protocol for Secure Multi-party Ranking problem.(3)Simplify the process of the protocol for Secure Multi-party Ranking base on RSA, Make a new protocol base on Euler's theorem.This protocol provide a new way to thinking of the Secure Multi-party Ranking problem.Protocol for shared generation of RSA keys provided a convenient tool for Sercure MultiParty Computation problem.As the develop of relative field,It will be greater help for the Sercure Multi-Party Computation problem bisides the Sercure Multi-Party Computation...