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

IEEE Access

A Quantum Protocol for Secure Manhattan Distance Computation

Wen Liu, Wei Zhang

Published Jan 1, 2020• 8 citations
Publisher

Abstract

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.

DOI
10.1109/access.2020.2966800

Related papers

Secure Two-Party Euclidean Distance Algorithm Based on Quantum Entanglement

Shuoying Zhang, Zhongzhu Liu, Zhihong Wu +3 more

With the advent of the big data era, crossorganizational collaborative data computing faces challenges in privacy protection. Traditional secure multi-party computation (MPC) protocols suffer from security insufficiency under the threat of quantum computing against classical encryption algorithms. To address this issue, this paper proposes a secure quantum protocol based on mutually unbiased bases (MUBs) in dlevel quantum systems. By leveraging quantum entanglement and quantum measurement techniques, the protocol accurately calculates the Euclidean distance between participants while ensuring privacy protection during the computation. Experimental results demonstrate that the protocol not only enhances computational efficiency but also effectively resists external attacks, participant attacks, and semi-honest third-party attacks, providing a new approach for the application of quantumsafe computing in privacy protection.

International Conference on Information Science, Computer Technology and Transportation (ISCTT)•Jun 13, 2025•0 citations

Semi-Quantum Private Comparison and Hamming Distance Calculation Based on $d$–Dimensional Bell States

Yi Yang, Min Jiang

This paper presents a semi-quantum private comparison and Hamming distance computation protocol based on$d$-dimensional Bell states. The proposed protocol enables two parties, with the assistance of a trusted third party (TP), to determine whether their private information is identical and compute the Hamming distance without disclosing their secrets. In this protocol, the TP prepares$d$-dimensional Bell states and distributes the entangled particles to Alice and Bob. Alice and Bob predetermine specific positions where they will perform REFLECT or MEASURE operations. Based on their measurement results, both parties encode their secret information and transmit the results to the TP via a classical channel. The TP then compares the data by incorporating pre-recorded offsets to determine whether the secrets are equal and to compute the Hamming distance, while ensuring that no private information is directly exposed. Compared to existing protocols, the proposed method demonstrates broader applicability in scenarios with limited quantum resources. To validate the protocol, we provide concrete examples demonstrating its theoretical and practical feasibility. Furthermore, security and efficiency analyses confirm its robustness against various external attacks and potential internal threats, including dishonest TP behavior.

IEEE International Conference on Quantum Control, Computing and Learning (qCCL)•Jun 25, 2025•0 citations

Secure multiparty quantum computation based on Lagrange unitary operator

Xiuli Song, Rui Gou, Aijun Wen

As an important subtopic of classical cryptography, secure multiparty quantum computation allows multiple parties to jointly compute their private inputs without revealing them. Most existing secure multiparty computation protocols have the shortcomings of low computational efficiency and high resource consumption. To remedy these shortcomings, we propose a secure multiparty quantum computation protocol by using the Lagrange unitary operator and the Shamir (t, n) threshold secret sharing, in which the server generates all secret shares and distributes each secret share to the corresponding participant, in addition, he prepares a particle and sends it to the first participant. The first participant performs the Lagrange unitary operation on the received particle, and then sends the transformed particle to the next participant. Until the last participant's computation task is completed, the transformed particle is sent back to the server. The server performs Lagrange unitary operation on the received particle by using a secret message, and then measures the transformed particle to obtain the sum of the calculations of multiple participants. Security analysis shows that the proposed protocol can resist intercept-measurement attack, intercept-resend attack, entanglement-swapping attack, entanglement-measurement attack and collusion attack. Performance comparison shows that it has higher computation efficiency and lower resource consumption than other similar protocols.

Scientific Reports•May 13, 2020•7 citations

Securely Computing the Manhattan Distance under the Malicious Model and Its Applications

Xin Liu, Xiaomeng Liu, Ruiling Zhang +3 more

Manhattan distance is mainly used to calculate the total absolute wheelbase of two points in the standard coordinate system. The secure computation of Manhattan distance is a new geometric problem of secure multi-party computation. At present, the existing research secure computing protocols for Manhattan distance cannot resist the attack of malicious participants. In the real scene, the existence of malicious participants makes it necessary to study a solution that can resist malicious attacks. This paper first analyzes malicious attacks of the semi-honest model protocol of computing Manhattan distance and then designs an advanced protocol under the malicious model by using the Goldwasser–Micali encryption system and Paillier encryption algorithm, and utilizing some cryptographic tools such as the cut-choose method and zero-knowledge proof. Finally, the real/ideal model paradigm method is used to prove the security of the malicious model protocol. Compared with existing protocols, the experimental simulation shows that the proposed protocol can resist malicious participant attacks while maintaining high efficiency. It has practical value.

Applied Sciences•Nov 17, 2022•16 citations

Quantum cryptographic ranging

Vittorio Giovannetti, Seth Lloyd, Lorenzo Maccone

We present a system to measure the distance between two parties that allows only trusted people to access the result. The security of the protocol is guaranteed by the complementarity principle in quantum mechanics. The protocol can be realized with available technology, at least as a proof of principle experiment.

arXiv:quant-ph/0112079•Journal of Optics B Quantum and Semiclassical Optics•Aug 1, 2002•25 citations

Quantum Phase Coding: A Novel Quantum Communication Protocol

Jincheng Zhang

Quantum Phase Coding (QPC) is a rapidly developing quantum communication protocol that leverages the inherent properties of quantum mechanics, specifically the superposition and entanglement of quantum states, to establish secure communication channels. This paper proposes a new QPC protocol, focused on enhancing information security through the manipulation of quantum phase differences. We delve into the fundamental principles of QPC, outlining its core mechanism and highlighting its potential advantages over existing quantum communication methods. The paper presents a detailed explanation of the protocol's architecture, focusing on the crucial role of phase difference measurements in maintaining security and facilitating quantum entanglement. We conclude with a discussion of the challenges and future directions of this promising quantum communication technology.

•Aug 31, 2026•0 citations
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.
With the advent of the big data era, crossorganizational collaborative data computing faces challenges in privacy protection. Traditional secure multi-party computation (MPC) protocols suffer from security insufficiency under the threat of quantum computing against classical encryption algorithms. To address this issue, this paper proposes a secure quantum protocol based on mutually unbiased bases (MUBs) in dlevel quantum systems. By leveraging quantum entanglement and quantum measurement techniques, the protocol accurately calculates the Euclidean distance between participants while ensuring privacy protection during the computation. Experimental results demonstrate that the protocol not only enhances computational efficiency but also effectively resists external attacks, participant attacks, and semi-honest third-party attacks, providing a new approach for the application of quantumsafe computing in privacy protection.
Semi-Quantum Private Comparison and Hamming Distance Calculation Based on ddd–Dimensional Bell States
This paper presents a semi-quantum private comparison and Hamming distance computation protocol based onddd-dimensional Bell states. The proposed protocol enables two parties, with the assistance of a trusted third party (TP), to determine whether their private information is identical and compute the Hamming distance without disclosing their secrets. In this protocol, the TP preparesddd-dimensional Bell states and distributes the entangled particles to Alice and Bob. Alice and Bob predetermine specific positions where they will perform REFLECT or MEASURE operations. Based on their measurement results, both parties encode their secret information and transmit the results to the TP via a classical channel. The TP then compares the data by incorporating pre-recorded offsets to determine whether the secrets are equal and to compute the Hamming distance, while ensuring that no private information is directly exposed. Compared to existing protocols, the proposed method demonstrates broader applicability in scenarios with limited quantum resources. To validate the protocol, we provide concrete examples demonstrating its theoretical and practical feasibility. Furthermore, security and efficiency analyses confirm its robustness against various external attacks and potential internal threats, including dishonest TP behavior.
As an important subtopic of classical cryptography, secure multiparty quantum computation allows multiple parties to jointly compute their private inputs without revealing them. Most existing secure multiparty computation protocols have the shortcomings of low computational efficiency and high resource consumption. To remedy these shortcomings, we propose a secure multiparty quantum computation protocol by using the Lagrange unitary operator and the Shamir (t, n) threshold secret sharing, in which the server generates all secret shares and distributes each secret share to the corresponding participant, in addition, he prepares a particle and sends it to the first participant. The first participant performs the Lagrange unitary operation on the received particle, and then sends the transformed particle to the next participant. Until the last participant's computation task is completed, the transformed particle is sent back to the server. The server performs Lagrange unitary operation on the received particle by using a secret message, and then measures the transformed particle to obtain the sum of the calculations of multiple participants. Security analysis shows that the proposed protocol can resist intercept-measurement attack, intercept-resend attack, entanglement-swapping attack, entanglement-measurement attack and collusion attack. Performance comparison shows that it has higher computation efficiency and lower resource consumption than other similar protocols.
Manhattan distance is mainly used to calculate the total absolute wheelbase of two points in the standard coordinate system. The secure computation of Manhattan distance is a new geometric problem of secure multi-party computation. At present, the existing research secure computing protocols for Manhattan distance cannot resist the attack of malicious participants. In the real scene, the existence of malicious participants makes it necessary to study a solution that can resist malicious attacks. This paper first analyzes malicious attacks of the semi-honest model protocol of computing Manhattan distance and then designs an advanced protocol under the malicious model by using the Goldwasser–Micali encryption system and Paillier encryption algorithm, and utilizing some cryptographic tools such as the cut-choose method and zero-knowledge proof. Finally, the real/ideal model paradigm method is used to prove the security of the malicious model protocol. Compared with existing protocols, the experimental simulation shows that the proposed protocol can resist malicious participant attacks while maintaining high efficiency. It has practical value.
Quantum Phase Coding (QPC) is a rapidly developing quantum communication protocol that leverages the inherent properties of quantum mechanics, specifically the superposition and entanglement of quantum states, to establish secure communication channels. This paper proposes a new QPC protocol, focused on enhancing information security through the manipulation of quantum phase differences. We delve into the fundamental principles of QPC, outlining its core mechanism and highlighting its potential advantages over existing quantum communication methods. The paper presents a detailed explanation of the protocol's architecture, focusing on the crucial role of phase difference measurements in maintaining security and facilitating quantum entanglement. We conclude with a discussion of the challenges and future directions of this promising quantum communication technology.