A Secure Multi-Party Strings Sorting Protocol Based on National Cryptographic Algorithm
The secure sorting problem is derived from the millionaire problem and is a fundamental problem in secure multi-party computation research.Multi-party string sorting is of great significance for the research of database confidential queries and electronic voting sum problems.The existing research on secure sorting problems mostly focuses on private data sorting or two-party string sorting.Efficient multi-party string sorting schemes are still being explored.Based on the improved SM2 homomorphic encryption algorithm and threshold cryptography algorithm,this paper first proposes a confidentiality multi-party single character sorting protocol in a semi honest model,and then designs a weight-based confidentiality single character sorting protocol and a confidentiality multi-party string sorting protocol.Simulation paradigm is used to demonstrate the security of three protocols.The paper conducts performance analysis and simulation experiments on the three protocols.The results show that the performance of the proposed secure multi-party single character sorting protocol and secure multi-party string sorting protocol is significantly improved compared to existing similar schemes.