With the rapid development of the information technology, it becomes more and more popular that multiparty performs cooperative computation on their private data while preserving their privacy. Secure multiparty computation is a key privacy-preserving technology to address such security issues. The secure vector computation is an active area of secure multiparty computation. At present, there are many researches into secure vector computation such as private scalar product and private vector summation. There are few researches on securely computing the number of equal components of private vectors. These researches focus on secure two-party computation that all the components of vectors are drawn from a restricted range. This study focuses on privately computing the number of equal component of vectors and determining the relationship between the number and a threshold value. To this end, a component-matrix encoding is firstly proposed to encode a component of a vector. Then based on the ElGamal cryptosystem, a simple and efficient secure multiparty protocol is designed to compute number of equal components of vectors. Based on this protocol, an efficient secure multiparty protocol is designed to determine whether the number of equal components of vectors is larger than a threshold. The protocols do not restrict the data range of components. The correctness of the protocols is analyzed and it is proved that they are secure in the semi-honest model. Theoretical efficiency analysis and experimental result show that these protocols are simple and efficient. Finally, these protocols are used as building block to solve some practical secure multiparty computation problems.