Secure Multi-Party Computation Protocol for Sorting Problem

In order to solve multi-party participating secure sort problem,schemes based on privacy-preserving are proposed,in which that all participants of a secure computation are semi-honest is first assumed,i.e.each participant will execute the protocol loyally,but he(or she) keeps a record of all his(her) intermediate computing results and might try to derive other participant's private inputs from the record.Afterwards,given a corresponding collective relation between participants and their data,and using the discrete logarithm method the array is calculated to obtain permutation result,such that a participant knows and only knows the position of his and her data in the permutation array.It is proved,by simulation paradigm,that the proposed schemes are secure,and particularly suitable for solving privacy preserving problems in network.