In the field of multi-party computation,an important problem is how to construct an efficient and secure multi-party computation protocol for certain specific problems.In the present study,we make use of a secret sharing scheme to construct an efficient and secure multi-party computation protocol for sequencing problems.Our protocols are perfectly secure against both a passive adversary that can corrupt at most t (n-1)/2 participants, and an active adversary that can corrupt at most t < n/3 participants.The simplest sequencing problem is the Millionaires’ problem. In the field of multi-party computation, an important problem is how to construct an efficient and secure multi-party computation protocol for certain specific problems. We the use of a secret sharing scheme to construct an efficient and secure multi -party computation protocol for sequencing problems. Our protocols are perfectly secure against both a passive adversary that can corrupt at most t (n-1) / 2 participants, and an active adversary that can corrupt at most t