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

Lecture notes in computer science

Design and Analysis of Two Efficient Socialist Millionaires’ Protocols for Privacy Protection

Xin Liu, Xiaofen Tu, Xiaofen Tu, Naixue N. Xiong

Published Jan 1, 2023• 0 citations
Publisher
DOI
10.1007/978-3-031-28124-2_14

Related papers

A fair and efficient solution to the socialist millionaires’ problem

Fabrice Boudot, Berry Schoenmakers, Jacques Traoré

Discrete Applied Mathematics•Jul 1, 2001•170 citations

Efficient Card-Based Cryptographic Protocols for Millionaires’ Problem Utilizing Private Permutations

Takeshi Nakai, Yuuki Tokushige, Yuto Misawa +2 more

Lecture notes in computer science•Jan 1, 2016•37 citations

Efficient Quantum‐Secure Protocol for the Socialist Millionaire Problem With Pauli Operators

Min Hou, Qiyuan Zheng, Minghong Yao +1 more

The socialist millionaire problem seeks to determine the equality relationship between the inputs of two users while ensuring that these inputs remain undisclosed to each other and to potential attackers. Current quantum protocols encounter challenges related to practicality and efficiency in addressing this issue. To overcome these challenges, we propose a quantum secure protocol specifically designed to effectively solve the socialist millionaire problem. In this protocol, a semihonest third party (TP) generates and distributes single photons to the participants. After securely receiving the photons, the participants encode their secret data using local quantum operations. The encoded photons are then returned to TP, which extracts the result via quantum measurement. By employing a circular photon transmission mode, the protocol reduces resource redundancy and achieves higher qubit efficiency. Security analysis confirms the protocol’s robustness against external quantum attacks—such as intercept‐resend, measurement‐resend, and entangle‐measure attacks—as well as against the curiosity of semihonest participants. Finally, using accessible quantum components (single photons, Pauli gates, and Bell measurements), we simulate the protocol on IBM Qiskit to verify its feasibility.

Journal of Mathematics•Jan 1, 2026•0 citations

Symmetric cryptographic protocols for extended millionaires’ problem

Li -, Shundong, Wang +3 more

Science China Information Sciences•Jan 1, 2009•2 citations

Single-photon-based quantum secure protocol for the socialist millionaires’ problem

Min Hou, Yue Wu

The socialist millionaires' problem, emanating from the millionaires’ problem, allows two millionaires to determine whether they happen to be equally rich while remaining their riches undisclosed to each other. Most of the current quantum solutions to the socialist millionaires’ problem have lower efficiency and are theoretically feasible. In this paper, we introduce a practical quantum secure protocol for the socialist millionaires’ problem based on single photons, which can be easily implemented and manipulated with current technology. Our protocol necessitates the involvement of a semi-honest third party (TP) responsible for preparing the single-photon sequences and transmitting them to Alice who performs Identity or Hadamard operations on the received quantum sequences via her private inputs and the secret keys, producing new quantum sequences that are subsequently sent to Bob. Similarly, Bob encodes his private inputs into the received quantum sequences to produce new quantum sequences, which are then sent to TP. By conducting single-particle measurements on the quantum sequences received from Bob, TP can ascertain the equality of private inputs between Alice and Bob, and subsequently communicate the comparison result to them. To assess the feasibility, the proposed protocol is simulated on IBM Quantum Cloud Platform. Furthermore, security analysis demonstrates that our protocol can withstand attacks from outsiders, such as eavesdroppers, and from insider participants attempting to grab the private input of another participant.

Frontiers in Physics•Mar 6, 2024•20 citations

Symmetric cryptographic protocols for extended millionaires’ problem

Shundong Li, DaoShun Wang, Yiqi Dai

Science in China Series F Information Sciences•Jun 1, 2009•11 citations
The socialist millionaire problem seeks to determine the equality relationship between the inputs of two users while ensuring that these inputs remain undisclosed to each other and to potential attackers. Current quantum protocols encounter challenges related to practicality and efficiency in addressing this issue. To overcome these challenges, we propose a quantum secure protocol specifically designed to effectively solve the socialist millionaire problem. In this protocol, a semihonest third party (TP) generates and distributes single photons to the participants. After securely receiving the photons, the participants encode their secret data using local quantum operations. The encoded photons are then returned to TP, which extracts the result via quantum measurement. By employing a circular photon transmission mode, the protocol reduces resource redundancy and achieves higher qubit efficiency. Security analysis confirms the protocol’s robustness against external quantum attacks—such as intercept‐resend, measurement‐resend, and entangle‐measure attacks—as well as against the curiosity of semihonest participants. Finally, using accessible quantum components (single photons, Pauli gates, and Bell measurements), we simulate the protocol on IBM Qiskit to verify its feasibility.
The socialist millionaires' problem, emanating from the millionaires’ problem, allows two millionaires to determine whether they happen to be equally rich while remaining their riches undisclosed to each other. Most of the current quantum solutions to the socialist millionaires’ problem have lower efficiency and are theoretically feasible. In this paper, we introduce a practical quantum secure protocol for the socialist millionaires’ problem based on single photons, which can be easily implemented and manipulated with current technology. Our protocol necessitates the involvement of a semi-honest third party (TP) responsible for preparing the single-photon sequences and transmitting them to Alice who performs Identity or Hadamard operations on the received quantum sequences via her private inputs and the secret keys, producing new quantum sequences that are subsequently sent to Bob. Similarly, Bob encodes his private inputs into the received quantum sequences to produce new quantum sequences, which are then sent to TP. By conducting single-particle measurements on the quantum sequences received from Bob, TP can ascertain the equality of private inputs between Alice and Bob, and subsequently communicate the comparison result to them. To assess the feasibility, the proposed protocol is simulated on IBM Quantum Cloud Platform. Furthermore, security analysis demonstrates that our protocol can withstand attacks from outsiders, such as eavesdroppers, and from insider participants attempting to grab the private input of another participant.