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
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
Quantum Information Processing
Hi-index | 0.00 |
We propose a quantum protocol for the millionaire problem with Bell states, where two distrustful parties can compare the values of their fortune with the help of a semi-dishonest third party. The efficiency of our protocol is higher than that of previous protocols for millionaire problem. In our protocol, any information about the values of their fortune will not be leaked out. The security of our protocol is also discussed.