A Novel and Efficient Quantum Private Comparison Scheme

A quantum private comparison is a primitive protocol of secure multiparty quantum computation that enables two parties to privately decide whether x = y or not, given two integers x and y, that are held as private inputs by the two parties, respectively. However, many existing quantum private comparison schemes may not be efficient enough, especially applied in big-data and large-scale network environments, because of low efficiency bit-by-bit comparisons. In this paper, we present a novel and efficient quantum private comparison scheme. The proposed scheme provides higher communication efficiency because a secret-by-secret comparison instead of a bit-by-bit comparison is used.