Quantum anonymous ranking and selection with verifiability

Wang, Qingle; Li, Yuancheng; Yu, Chao; He, Hui; Zhang, Kejia

doi:10.1007/s11128-020-02664-y

Cited by 12 publications

(9 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Lin proposed [17] a significant work in this area, which reduces the number of levels required significantly. Finally, Wang [18] introduces the concept of verifiability, where each party encodes its message at a random index, forming a permutation of their values. In the end, each participant can see this random permutation, and they can calculate their ranking by counting elements greater than their data.…”

Section: Literature Surveymentioning

confidence: 99%

Quantum secure ranking based on quantum walks

Joseph,

Ali

2024

Phys. Scr.

View full text Add to dashboard Cite

We propose a quantum secure multiparty multidata ranking (QSMMR) protocol based on quantum walks. Our protocol improves the traditional anonymous ranking protocol to secure ranking, where we ensure the confidentiality of the data. A quantum anonymous ranking protocol exposes all participants' data, which is not ideal for practical scenarios such as personal wealth and health indexes. Hence, we propose the first quantum secure ranking protocol with semi-honest TP, that generates ranking for multiple data of multiple participants by keeping data completely secure. We use quantum resources to assign a random address to all participants, to perform comparison, and for the eavesdropper detection. Finally, we analyze and prove the security of the protocol.

show abstract

Section: Literature Surveymentioning

confidence: 99%

Quantum secure ranking based on quantum walks

Joseph,

Ali

2024

Phys. Scr.

View full text Add to dashboard Cite

show abstract

“…Based on equation (33), a d-level Bell state is shared between P s and P r . Therefore, Protocol I satisfies the requirement of correctness.…”

Section: Protocol Imentioning

confidence: 99%

“…AQC, along with other branches of quantum communication such as quantum key distribution [17][18][19][20], quantum secure direct communication [21][22][23][24][25], and quantum teleportation [26,27], plays a significant role in ensuring secure information transmission. In addition, researchers have proposed various other anonymous quantum cryptographic protocols, such as quantum anonymous voting [28][29][30], quantum anonymous ranking [31][32][33], and so on.…”

Section: Introductionmentioning

confidence: 99%

Verifiable anonymous quantum communication with authentication based on d-level single-particle states

Liu,

Mu,

Wang

et al. 2023

Phys. Scr.

View full text Add to dashboard Cite

Anonymous quantum communication (AQC) enables the secure transmission of classical and quantum messages while preserving the anonymity of the sender, receiver, or both. Qudits, quantum states with more advantages than qubits in terms of information transmission rate and eavesdropping detection, offer promising capabilities. In this paper, we propose a verifiable AQC (VAQC) protocol utilizing $d$-level single-particle states, establishing anonymous entanglement between a public sender and an anonymous receiver. By using quantum teleportation, the public sender can transmit private information to his/her chosen anonymous receiver. The verifiable function of the proposed protocol guarantees the legitimacy of all participants' identities and verifies the correctness of the anonymous entanglement. Furthermore, we demonstrate that the proposed VAQC protocol satisfies the requirements of correctness, anonymity, and security. The proposed VAQC protocol exhibits extensibility and can be extended to enable private communication between an anonymous sender and an anonymous receiver, as well as anonymous entanglement among multiple participants. This work lays the foundation for practical applications in achieving $d$-level anonymous entanglement and anonymous transmission of qudits.

show abstract

“…It can enable n participants to jointly calculate a summation without revealing any participant’s secret to others. Quantum summation can be applied to a variety of fields, such as quantum voting [ 15 , 16 , 17 , 18 ], quantum anonymous ranking [ 19 , 20 ], and quantum private equality comparison [ 21 , 22 , 23 ]. Designing efficient and practical quantum summation protocols is thus significant.…”

Section: Introductionmentioning

confidence: 99%

Quantum Secure Multi-Party Summation Using Single Photons

Xie

2023

Entropy

View full text Add to dashboard Cite

In this paper, we propose a secure multi-party summation based on single photons. With the help of a semi-honest third party, n participants can simultaneously obtain the summation result without revealing their secret inputs. Our protocol uses single photon states as the information carriers. In addition, each participant with secret input only performs simple single-particle operators rather than particle preparation and any complex quantum measurements. These features make our protocol more feasible to implement. We demonstrate the correctness and security of the proposed protocol, which is resistant to participant attack and outside attack. In the end, we compare in detail the performance of the quantum summation protocol in this paper with other schemes in terms of different indicators. By comparison, our protocol is efficient and easy to implement.

show abstract

Quantum anonymous ranking and selection with verifiability

Cited by 12 publications

References 22 publications

Quantum secure ranking based on quantum walks

Quantum secure ranking based on quantum walks

Verifiable anonymous quantum communication with authentication based on d-level single-particle states

Quantum Secure Multi-Party Summation Using Single Photons

Contact Info

Product

Resources

About