Protocols for secure computations
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
A simple participant attack on the brádler-dušek protocol
Quantum Information & Computation
New quantum private comparison protocol using EPR pairs
Quantum Information Processing
Semi-loss-tolerant strong coin flipping protocol using EPR pairs
Quantum Information & Computation
Quantum private comparison protocol with d-dimensional Bell states
Quantum Information Processing
Comment on quantum private comparison protocols with a semi-honest third party
Quantum Information Processing
Efficient quantum private comparison employing single photons and collective detection
Quantum Information Processing
A watermark strategy for quantum images based on quantum fourier transform
Quantum Information Processing
Symmetric quantum fully homomorphic encryption with perfect security
Quantum Information Processing
Hi-index | 0.00 |
In this paper, we propose a quantum private comparison protocol based on entanglement swapping, where two distrustful parties can compare the values of their secrets with the help of a semi-trusted third party. The protocol can determine not only whether two secrets are equal, but also the size relationship between them. The two parties can deduce the comparison result based on the keys shared between them and the announcement of the third party. Others including the third party will learn nothing about the values of the secrets, as well as the comparison result. The security of our protocol is analyzed. Furthermore, all the particles can be reused in the same protocol model theoretically. So our protocol is efficient and feasible to expand in network service, which in turn gives a solution to the left problem in Lin et al. (Quantum Inf Process, doi: 10.1007/s11128-012-0395-6 , 2012).