Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Quantum Information Processing

A new quantum-inspired solution to blind millionaires’ problem

Yu Zhang, Long Zhang, Kejia Zhang, Weijian Wang, Kunchi Hou

Published Jan 19, 2023• 11 citations
Publisher
DOI
10.1007/s11128-023-03828-2

Related papers

A third-party-free quantum solution to the blind millionaire problem with phase rotation

Fang-Jia Li, Rong-Xue Xu, Dandan Li +4 more

Chinese Journal of Physics•Sep 1, 2026•0 citations

The complete new solutions to the blind millionaires’ problem in d-dimensional quantum system

Yao Yao, Kejia Zhang, Tingting Song +2 more

Physica A Statistical Mechanics and its Applications•Aug 16, 2023•12 citations

Quantum protocol for millionaire problem

Heng-Yue Jia, Qiaoyan Wen, Tingting Song +1 more

Optics Communications•Sep 23, 2010•93 citations

Quantum Protocol for Millionaire Problem

Wen Liu, Yongbin Wang, Aina Sui +1 more

International Journal of Theoretical Physics•Apr 11, 2019•14 citations

A quantum protocol for millionaire problem with Bell states

Weiwei Zhang, Dan Li, Kejia Zhang +1 more

Quantum Information Processing•Jan 4, 2013•35 citations

A new quantum solution to blind millionaires’ problem without an honest third party

Gang Du, Yu Zhang, Xinyue Mao +2 more

Abstract The quantum blind millionaires’ (QBM) problem is an expanded version of the millionaires’ problem in a quantum environment. For any two sets with different members, the QBM problem represents the quantum solution of the private summation in each set and the private comparison of the results simultaneously. During it, the secrets of any participant should be protected. As a new topic in quantum secure multiparty computation (QSMC), current solutions to QBM problems usually require an honest third party to resist some potential attack strategies. However, the assumptions will affect their applicability in practical cooperative security systems. In this paper, we propose a new solution to the quantum blind millionaires’ (QBM) problem without the help of an honest third party for the first time. In our solution, the shift operations are applied to the d -dimensional 2-particle entangled states to encode the secrets of the participants. According to our analysis, the proposed solution can effectively resist typical internal and external attacks by applying the detection methods generated by the participants. We hope that the research will make positive developments for QSMC.

EPJ Quantum Technology•Nov 25, 2024•6 citations
Abstract The quantum blind millionaires’ (QBM) problem is an expanded version of the millionaires’ problem in a quantum environment. For any two sets with different members, the QBM problem represents the quantum solution of the private summation in each set and the private comparison of the results simultaneously. During it, the secrets of any participant should be protected. As a new topic in quantum secure multiparty computation (QSMC), current solutions to QBM problems usually require an honest third party to resist some potential attack strategies. However, the assumptions will affect their applicability in practical cooperative security systems. In this paper, we propose a new solution to the quantum blind millionaires’ (QBM) problem without the help of an honest third party for the first time. In our solution, the shift operations are applied to the d -dimensional 2-particle entangled states to encode the secrets of the participants. According to our analysis, the proposed solution can effectively resist typical internal and external attacks by applying the detection methods generated by the participants. We hope that the research will make positive developments for QSMC.