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

Journal of Information Security and Applications

Privacy-preserving quantum multi-party computation based on circular structure

Zhiliang Deng, Ying Zhang, Xiaorui Zhang, Lingling Li

Published May 9, 2019• 7 citations
Publisher
DOI
10.1016/j.jisa.2019.04.011

Related papers

Security improvements for privacy-preserving quantum multiparty computation based on circular structure

Hussein Abulkasim, Atefeh Mashatan, Shohini Ghose

Quantum Information Processing•Dec 28, 2021•5 citations

Quantum-Secure Multi-party Computation Models for Privacy-Preserving Decentralized Finance

Maan Hameed, Shahad Salah Abrahim, Aghiad khedr Alkatan +2 more

Communications in computer and information science•Sep 21, 2026•0 citations

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 +1 more

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.

IEEE Transactions on Consumer Electronics•Jan 1, 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 Quantum Computation Based on Blind Quantum Computation

Gui-Ju Qu, Ming‐Ming Wang

International Journal of Theoretical Physics•Jul 12, 2021•11 citations

Privacy-Preserving Quantum Two-Party Geometric Intersection

Wenjie Liu, Yong Xu, James C. N. Yang +2 more

Privacy-preserving computational geometry is the research area on the intersection of the domains of secure multi-party computation (SMC) and computational geometry. As an important field, the privacy-preserving geometric int... | Find, read and cite all the research you need on Tech Science Press

arXiv:2309.12605•Computers, materials & continua/Computers, materials & continua (Print)•Jan 1, 2019•21 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 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.