Abstract: Secure multi-party computation based on secret sharing is an important technique in privacy-preserving computation, and the performance bottlenecks of it are non-linear function protocols. Comparison protocol is the most widely used non-linear function protocol. Current designs of comparison protocol need multiple interactions and thus have poor performance. In order to solve those problems, we propose a new design of comparison protocol, which can support any number of parties and guarantee security under semi-honest and malicious security model. In our protocol, we used random bit shares to significantly decrease the communication rounds. The experiment result shows that our design can improve 25%~33% running efficiency at most, compared with previous designs.