Quantum protocol for millionaire problem

Jia, Heng-Yue; Wen, Qiaoyan; Song, Ting-Ting; Gao, Fei

doi:10.1016/j.optcom.2010.09.005

Cited by 89 publications

(44 citation statements)

References 36 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…On the other hand, secure multi-party computation (SMC) has also been discussed in the quantum mechanism. Many special SMC problems have been solved in quantum setting, for instance, quantum private comparison (QPC) [10][11][12][13][14][15][16][17][18][19], quantum protocols for millionaire problem [20,21], quantum voting [22,23] and quantum auctions [24,25].…”

mentioning

confidence: 99%

Same Initial States Attack in Yang et al.’s Quantum Private Comparison Protocol and the Improvement

Liu

et al. 2013

Int J Theor Phys

View full text Add to dashboard Cite

In Yang et al. 's literatures [J. Phys. A: Math. 42, 055305, 2009; J. Phys. A: Math. 43, 209801, 2010], a quantum private comparison protocol based on Bell states and hash function is proposed, which aims to securely compare the equality of two participants' information with the help of a dishonest third party (TP). However, this study will point out their protocol cannot resist a special kind of attack, TP's same initial states attack, which is presented in this paper. That is, the dishonest TP can disturb the comparison result without being detected through preparing the same initial states. Finally, a simple improvement is given to avoid the attack.Keywords Quantum cryptography · Quantum computation · Quantum private comparison · Same initial states attack IntroductionThe principles of quantum mechanics, such as no-cloning theorem, uncertainty principle, and entanglement characteristics, provide some interesting ways for cryptography communication and secure computation. During the past thirty years, quantum communication has developed in a variety of directions, including quantum key distribution (QKD) [1,2], quantum secret sharing (QSS) [3,4], quantum direct communication (QDC) [5][6][7], quantum

show abstract

mentioning

confidence: 99%

Same Initial States Attack in Yang et al.’s Quantum Private Comparison Protocol and the Improvement

Liu

et al. 2013

Int J Theor Phys

View full text Add to dashboard Cite

show abstract

“…In 2011, Jia et al [16] proposed a quantum protocol for millionaire problem with d-level entangled GHZ states. Then Lin et al [17] put forward a protocol based on d-level Bell states, in which the secrets are encoded in the shift of the qubit.…”

Section: Introductionmentioning

confidence: 99%

A Quantum Protocol for Secure Manhattan Distance Computation

Wen

Zhang

2020

IEEE Access

View full text Add to dashboard Cite

Secure Manhattan distance computation allows two parties to privately compute the Manhattan distance of their points, which is important and has broad applications. In this paper, we present a protocol for secure Manhattan distance computation based on phase shift operation. Because of quantum mechanics' physical principle, our protocol can also resist outside attacks and don't leak any private information of participants.

show abstract

“…A natural question is how to complete the comparison if all the data are confidential. This problem is called "Tiercé problem" or "socialist millionaires' problem", which is originated from the "millionaires' problem" raised by Yao in 1982 [3][4][5][6]. The solutions to this problem can also solve many problems in real life, such as secret bidding and auctions, secret ballot elections, e-commerce, data mining, and authentication [3][4][5][6][7].…”

Section: Introductionmentioning

confidence: 99%

Greenberger-Horne-Zeilinger-based quantum private comparison protocol with bit-flipping

Ji¹,

Fan²,

Zhang³

et al. 2019

Preprint

View full text Add to dashboard Cite

By introducing a semi-honest third party, we propose in this paper a novel QPC protocol using (n + 1)qubit (n ≥ 2) Greenberger-Horne-Zeilinger (GHZ) states as information carriers. The parameter n not only determines the number of qubits contained in a GHZ state, but also determines the probability that the third party can successfully steal the participants' data and the qubit efficiency. Our protocol uses the keys generated by quantum key distribution and bit-flipping for privacy protection, making both outsider and insider attacks invalid. In addition, our protocol does not employ any other quantum technologies (e.g., entanglement swapping and unitary operation) except necessary technologies such as preparing quantum states and quantum measurement, which can reduce the need for quantum devices. Furthermore, the GHZ states are prepared by participants rather than by the third party, which can reduce potential security risks.

show abstract

Quantum protocol for millionaire problem

Cited by 89 publications

References 36 publications

Same Initial States Attack in Yang et al.’s Quantum Private Comparison Protocol and the Improvement

Same Initial States Attack in Yang et al.’s Quantum Private Comparison Protocol and the Improvement

A Quantum Protocol for Secure Manhattan Distance Computation

Greenberger-Horne-Zeilinger-based quantum private comparison protocol with bit-flipping

Contact Info

Product

Resources

About