Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callSimilar Papers
More From: Journal of the Korean Physical Society
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
