International Conference on Information Science, Computer Technology and Transportation (ISCTT)

Secure Two-Party Euclidean Distance Algorithm Based on Quantum Entanglement

Shuoying Zhang, Zhongzhu Liu, Zhihong Wu, Sufang Yin, Xingbang Deng, Jianwei Zhang

Published Jun 13, 2025• 0 citations

Abstract

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.

DOI: 10.1109/isctt66403.2025.11137896

Related papers

Lightweight multi-party quantum secure scalar product protocol for privacy-preserving collaborative computing

Can Wang, Runhua Shi, Jiang-Yuan Lian +1 more

Abstract With the rapid development of distributed collaborative computing, privacy leakage risks in multi-source data joint analysis are increasing, and classical secure scalar product (SSP) protocols are vulnerable to quantum attacks. Existing quantum secure scalar product schemes mostly rely on complex quantum resources or third parties, only support two-party computation, and have poor scalability. To address these issues, this paper proposes a secure multi-party quantum scalar product protocol based on single-photon resources without a third party. The protocol adopts a two-layer architectural design, integrating pairwise secure product operation and privacy-preserving aggregation mechanism. It realizes result blinding via data splitting and reconstruction to fully guarantee data confidentiality. By adopting ring interaction structure and lightweight secure computing modes, it completes collaborative computation of multi-party private data and effectively prevents information leakage in interactive processes. Performance analysis shows that the protocol requires no more than single-photon and single-particle measurements, with complexity within a reasonable range, making it feasible with current quantum technology. This protocol provides an efficient and secure primitive for multi-party privacy-preserving collaborative computing in quantum-resistant scenarios.

Physica ScriptaAug 21, 20260 citations

Secure Multi-Party Quantum Summation Based on Quantum Homomorphic Encryption

Gang Xu, Fan Yun, Xiu‐Bo Chen +5 more

Secure multi-party computation has been playing a fundamental role in terms of classical cryptography. Quantum homomorphic encryption (QHE) could compute the encrypted data without decryption. At present, most protocols use a semi-honest third party (TP) to protect participants’ secrets. We use a quantum homomorphic encryption scheme instead of TP to protect the privacy of parties. Based on quantum homomorphic encryption, a secure multi-party quantum summation scheme is proposed in which N participants can delegate a server with strong quantum computing power to assist computation. By delegating the computation and key update processes to a server and a semi-honest key center, participants encrypt their private information data using Pauli operators to get the sum. Besides, the server can design and optimize the summation lines itself, and the correct results can be obtained even if the secret information is negative. The correctness analysis showed that the participants could correctly obtain the results of the calculation. The security analysis proves the scheme is resistant to both outside attack and participant’s attack, and is secure against collusive attack by up to N-2 participants. From the theoretical point of view, our protocol can extend to other secure multi-party computing problems.

Intelligent Automation & Soft ComputingJan 1, 202217 citations

Multiparty private summation protocol based on two-state quantum-mechanical system

Jason Lin, Shao-Lun Huang, Chun‐Wei Yang +1 more

With the rapid advancement of information technology, data sharing has become increasingly accessible, leading to a heightened need for robust personal data protection. One important application in privacy-preserving computing is the aggregation of information when collaboratively establishing AI models through public distributed networks. To counter the threat posed by quantum computing to encrypted data, various quantum private summation (QPS) protocols have been proposed thus far. However, some of these existing protocols operate solely under modulo 2, while other approaches for modulo d often rely on impractically high-dimensional qudits. Therefore, this study proposes an innovative multiparty QPS method that balances participant data sharing and privacy without requiring high-dimensional photons. The proposed QPS protocol enables participants to contribute aggregated information to third parties without disclosing individual data. A security analysis further demonstrates that the proposed QPS effectively counters common eavesdropping attacks, ensuring reliable protection of personal data.

Scientific ReportsJul 2, 20252 citations

Quantum Network Security: A Multi-Party Computation Protocol Leveraging Quantum Key Distribution and Quantum State Secure Computation

Jincheng Zhang

This paper presents a novel protocol for secure multi-party computation (MPC) within a quantum network, integrating Quantum Key Distribution (QKD) and quantum state secure computation techniques. The core objective is to enable multiple parties to collaboratively perform computations without revealing their individual inputs. The proposed protocol establishes a secure communication channel using QKD, guaranteeing the exchange of secret keys. Subsequently, a quantum state secure multi-party computation algorithm is employed, ensuring the confidentiality and integrity of the computation process. The utilization of quantum key distribution significantly enhances the security of the entire system, mitigating vulnerabilities associated with traditional MPC schemes. The theoretical analysis demonstrates the protocol's resilience against various attacks, providing a foundation for building robust and secure quantum network applications. The protocol's effectiveness hinges on the ability to maintain quantum coherence during the computational steps and accurately manage the quantum key distribution process. This research contributes to the advancement of secure quantum computing and communication technologies.

Aug 31, 20260 citations

Two-party quantum private comparison protocol with maximally entangled seven-qubit state

Zhaoxu Ji, Huanguo Zhang, Peiru Fan

Quantum private comparison (QPC), whose security is based on some laws of quantum mechanics (e.g. quantum noncloning theorem and Heisenbergs uncertainty principle), allows [Formula: see text] parties who do not trust each other to judge whether their secret data are the same while maintaining data privacy. In this paper, we investigate the utility of the maximally entangled seven-qubit state for QPC, and we propose a new protocol which enables two parties to compare their secret data with each other for equality without disclosing their secret data. In our protocol, single particle measurements and Bell-basis measurements are employed, both of which can be implemented with current technologies. In addition to quantum measurements, our protocol does not use other quantum technologies such as entanglement swapping and unitary operations. A semi-honest third-party who assists two parties in implementing the protocol is assumed in our protocol. Furthermore, we use the entanglement correlations of the maximally entangled seven-qubit state and collaborative computing between parties for privacy protection, and we use quantum key distribution (QKD) to ensure the security of the cooperative computing when two parties are in different locations. What is more, we show that the security towards both outsider and insider attacks can be guaranteed.

Modern Physics Letters AJul 9, 201950 citations

Quantum Security Multi-Party Computation Based on Quantum Coherence

Jincheng Zhang

This paper explores the application of quantum coherence, specifically quantum coherence, to enhance the security of hardware multi-party computation (MPC). Traditional MPC protocols often rely on computational assumptions that are increasingly vulnerable to advancements in classical computing power. Quantum coherence presents a fundamentally different approach to security, leveraging the ephemeral nature of quantum states to mitigate information leakage. We propose a novel MPC protocol that utilizes quantum coherence to create a secure environment where participants can collaboratively compute a function without revealing their individual inputs. The core of the protocol lies in carefully designed quantum operations and measurement strategies that exploit the inherent fragility of quantum coherence. This approach offers a promising path towards building robust and secure MPC systems suitable for applications requiring high levels of confidentiality, particularly in scenarios where classical computational attacks are a significant concern. We detail the protocol's structure, outlining the key elements and providing a mathematical framework for analyzing its security properties. The paper concludes with a discussion of potential challenges and future research directions in this emerging area.

Sep 2, 20260 citations