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 Transactions on Consumer Electronics

Quantum Secure Multi-party Geometric Area Computation with a Consistency Verification Mechanism for Privacy-preserving Women’s Health Systems

Zhenzhen Li, Ming-Kui Liu, Jing-Tao Wang, Bo Gao

Published Jan 1, 2026• 0 citations
Publisher

Abstract

Secure multi-party geometric area computation (SMGAC) is a fundamental primitive in secure multi-party computation (SMC), with important applications in real-world scenarios, especially in privacy-preserving wearable systems for multi-source physiological data analysis related to women’s health. Existing SMGAC protocols generally rely on computational hardness assumptions, making them difficult to resist emerging quantum attacks. To address this issue, a quantum secure multi-party geometric area computation (QSMGAC) protocol for privacy-preserving women’s health systems is proposed. We provide a detailed description for two cases, namely triangles and polygons, along with illustrative examples. By fully leveraging the advantages of quantum homomorphic encryption (QHE), the quantum circuits required for area computation are delegated to a computation center, which performs coordinate-based operations, thereby enabling secure acquisition of results without decryption. Furthermore, by exploiting the property that redundant qubits remain unchanged without participating in the actual computation, we design a consistency verification mechanism to check the result returned by the computation center. Security analysis shows that the proposed protocol can not only resist typical external attacks but also defend against internal attacks from any participating party. In addition, the proposed framework is applicable to more general geometric structures, such as polyhedrons, showing strong scalability in privacy-preserving women’s health data analytics and other multi-source data fusion scenarios.

DOI
10.1109/tce.2026.3753561

Related papers

A secure two-party polygon intersection area computation protocol based on quantum homomorphic encryption

B Y Liu, Xin-Guo Wang

Abstract Secure Multi-party Geometric Computation(SMGC) is an important field in Secure Multi-party Computation(SMC). It aims to enable multiple mutually distrustful parties to collaboratively perform geometric computation tasks while protecting their respective private information. As an important branch of this field, the secure two-party polygon intersection area computation focuses on enabling two untrusted parties to securely compute the overlapping area between their polygons without revealing their private coordinate information. This paper introduces a semi-honest third party and leverages quantum homomorphic encryption technology to first achieve secure two-party segment intersection computation. Subsequently, by integrating a quantum protocol for point inclusion verification within arbitrary regions, it proposes an exact method for calculating the intersection area of polygons. Finally, through comprehensive analysis, it has been demonstrated that this protocol is secure and reliable, offering new insights for future regional collaborative computing in quantum environments.

Chinese Physics B•May 26, 2026•0 citations

An efficient and secure multi-party convex hull protocol using quantum secret commitment

Wen-Jie Liu, Solomon Danquah Danso

Convex hull computation is a fundamental problem in secure multi-party computational geometry (SMCG), classified under secure multi-party computation (SMC) for finding the convex hull of a set of points. Existing quantum solutions largely depend on quantum homomorphic encryption (QHE), which introduces significant computational overhead due to frequent key updates by a trusted third party (TTP). Furthermore, most current protocols lack a mechanism for input commitment, making them vulnerable to post-computation input tampering or denial by the TTP. To overcome these limitations, we propose an efficient convex hull protocol that utilizes quantum secret commitment (QSC) as a more secure alternative to QHE. Our protocol enables a designated party (the committer) to securely commit to input values in a manner that guarantees both binding (no post-hoc alteration) and hiding (input secrecy). We introduce a novel value comparison protocol within an Ideal Quantum K-Party model, ensuring privacy-preserving convex hull computation without reliance on QHE. Rigorous security analysis demonstrates significant improvements in computational efficiency and resilience against quantum adversaries. Our protocol represents a pivotal advancement for quantum-secure multi-party computations and lays the groundwork for scalable, future-proof privacy-preserving geometry in quantum computing contexts.

EPJ Quantum Technology•Feb 23, 2026•0 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 Computing•Jan 1, 2022•17 citations

Quantum private set computing protocol based on measurement device independence

WANG QingLe, CHENG WenChuan, Guodong Li +3 more

Secure multi-party computation (SMC) is an important privacy-preserving technology with broad applications in fields such as data mining and cloud computing. As a significant branch of SMC, private set computation (PSC) allows the computation of the intersection or union of private datasets from two or more participants while protecting their data privacy. Quantum private set computation (QPSC) is a new direction that combines PSC with quantum mechanics and has recently garnered widespread attention. Most existing QPSC protocols rely on quantum measurements performed by participants or third parties, but the measurement devices used in practice may be vulnerable to side-channel attacks. To address this issue, this paper proposes a measurement-device-independent QPSC protocol. In this protocol, participants can utilize post-selected Greenberger-Horne-Zeilinger (GHZ) state entanglement to compute the private intersection and union of their datasets securely. Analysis shows that this protocol is correct and can resist potential external and internal attacks. Finally, the protocol's feasibility is verified through simulation on the HIQ quantum computing cloud platform using the MindSpore Quantum framework.

Zhongguo kexue. Wulixue Lixue Tianwenxue•Jul 29, 2024•1 citation

A spatial crowdsourced single-point collaborative convex hull computation protocol based on quantum homomorphic encryption

Bai Liu, Xinguo Wang, Run-Hua SHI +1 more

Abstract With the growing demand for location privacy protection and collaborative computing in spatial crowdsourcing (SC) tasks, traditional encryption methods based on computational complexity face threats from quantum computing and efficiency bottlenecks. To address this, this paper proposes a secure multi-party quantum comparison (SMQC) protocol based on quantum homomorphic encryption. By utilizing a quantum comparator and a key update mechanism, this protocol enables secure comparison of numerical values among multiple parties while maintaining encryption. Building on this foundation, the SMQC protocol is further applied to the SC environment to construct a single-point collaborative convex hull computation protocol. Through extreme point determination and convex hull boundary verification, this protocol efficiently performs multi-party collaborative convex hull computation while protecting the location privacy of participants. Analysis indicates that the convex hull computation framework built on this protocol is reliable and secure, further expanding the application of quantum-secure solutions in SC scenarios such as single-point collaborative obstacle avoidance and collaborative spatial protection.

Physica Scripta•Aug 6, 2026•0 citations

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 Scripta•Aug 21, 2026•0 citations
Secure multi-party geometric area computation (SMGAC) is a fundamental primitive in secure multi-party computation (SMC), with important applications in real-world scenarios, especially in privacy-preserving wearable systems for multi-source physiological data analysis related to women’s health. Existing SMGAC protocols generally rely on computational hardness assumptions, making them difficult to resist emerging quantum attacks. To address this issue, a quantum secure multi-party geometric area computation (QSMGAC) protocol for privacy-preserving women’s health systems is proposed. We provide a detailed description for two cases, namely triangles and polygons, along with illustrative examples. By fully leveraging the advantages of quantum homomorphic encryption (QHE), the quantum circuits required for area computation are delegated to a computation center, which performs coordinate-based operations, thereby enabling secure acquisition of results without decryption. Furthermore, by exploiting the property that redundant qubits remain unchanged without participating in the actual computation, we design a consistency verification mechanism to check the result returned by the computation center. Security analysis shows that the proposed protocol can not only resist typical external attacks but also defend against internal attacks from any participating party. In addition, the proposed framework is applicable to more general geometric structures, such as polyhedrons, showing strong scalability in privacy-preserving women’s health data analytics and other multi-source data fusion scenarios.
Abstract Secure Multi-party Geometric Computation(SMGC) is an important field in Secure Multi-party Computation(SMC). It aims to enable multiple mutually distrustful parties to collaboratively perform geometric computation tasks while protecting their respective private information. As an important branch of this field, the secure two-party polygon intersection area computation focuses on enabling two untrusted parties to securely compute the overlapping area between their polygons without revealing their private coordinate information. This paper introduces a semi-honest third party and leverages quantum homomorphic encryption technology to first achieve secure two-party segment intersection computation. Subsequently, by integrating a quantum protocol for point inclusion verification within arbitrary regions, it proposes an exact method for calculating the intersection area of polygons. Finally, through comprehensive analysis, it has been demonstrated that this protocol is secure and reliable, offering new insights for future regional collaborative computing in quantum environments.
Convex hull computation is a fundamental problem in secure multi-party computational geometry (SMCG), classified under secure multi-party computation (SMC) for finding the convex hull of a set of points. Existing quantum solutions largely depend on quantum homomorphic encryption (QHE), which introduces significant computational overhead due to frequent key updates by a trusted third party (TTP). Furthermore, most current protocols lack a mechanism for input commitment, making them vulnerable to post-computation input tampering or denial by the TTP. To overcome these limitations, we propose an efficient convex hull protocol that utilizes quantum secret commitment (QSC) as a more secure alternative to QHE. Our protocol enables a designated party (the committer) to securely commit to input values in a manner that guarantees both binding (no post-hoc alteration) and hiding (input secrecy). We introduce a novel value comparison protocol within an Ideal Quantum K-Party model, ensuring privacy-preserving convex hull computation without reliance on QHE. Rigorous security analysis demonstrates significant improvements in computational efficiency and resilience against quantum adversaries. Our protocol represents a pivotal advancement for quantum-secure multi-party computations and lays the groundwork for scalable, future-proof privacy-preserving geometry in quantum computing contexts.
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.
Secure multi-party computation (SMC) is an important privacy-preserving technology with broad applications in fields such as data mining and cloud computing. As a significant branch of SMC, private set computation (PSC) allows the computation of the intersection or union of private datasets from two or more participants while protecting their data privacy. Quantum private set computation (QPSC) is a new direction that combines PSC with quantum mechanics and has recently garnered widespread attention. Most existing QPSC protocols rely on quantum measurements performed by participants or third parties, but the measurement devices used in practice may be vulnerable to side-channel attacks. To address this issue, this paper proposes a measurement-device-independent QPSC protocol. In this protocol, participants can utilize post-selected Greenberger-Horne-Zeilinger (GHZ) state entanglement to compute the private intersection and union of their datasets securely. Analysis shows that this protocol is correct and can resist potential external and internal attacks. Finally, the protocol's feasibility is verified through simulation on the HIQ quantum computing cloud platform using the MindSpore Quantum framework.
Abstract With the growing demand for location privacy protection and collaborative computing in spatial crowdsourcing (SC) tasks, traditional encryption methods based on computational complexity face threats from quantum computing and efficiency bottlenecks. To address this, this paper proposes a secure multi-party quantum comparison (SMQC) protocol based on quantum homomorphic encryption. By utilizing a quantum comparator and a key update mechanism, this protocol enables secure comparison of numerical values among multiple parties while maintaining encryption. Building on this foundation, the SMQC protocol is further applied to the SC environment to construct a single-point collaborative convex hull computation protocol. Through extreme point determination and convex hull boundary verification, this protocol efficiently performs multi-party collaborative convex hull computation while protecting the location privacy of participants. Analysis indicates that the convex hull computation framework built on this protocol is reliable and secure, further expanding the application of quantum-secure solutions in SC scenarios such as single-point collaborative obstacle avoidance and collaborative spatial protection.
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.