Verifiable and Collusion-Resistant Dynamic Multi-Party Quantum Private Comparison Protocol
Wang Qi, LI Shuai
Abstract
ObjectiveThis paper aims to address the issues of existing Multi-Party Quantum Private Comparison (MQPC) protocols-namely, their reliance on entangled states, weak collusion resistance, poor dynamic scalability, and low qubit efficiency-while realizing a high-security, low-overhead, and dynamically scalable MQPC solution.MethodsA quantum-classical hybrid architecture is adopted in this paper. Global random masks are generated through ring public key encryption. Information-theoretically secure distribution of masks is achieved based on locally indistinguishable Orthogonal Product States (OPS). Private information is encoded via hash obfuscation. Chain-based differential verification is designed to implement private comparison. Dynamic member management is realized relying on Quantum Key Distribution (QKD) and ring structure reconstruction.ResultsUnder the semi-honest model, the protocol can resist external attacks, internal malicious attacks, and collusion attacks by n-1 nodes. Its qubit efficiency reaches a constant level of O (1), which is improved by approximately 50% compared with contrast schemes using entangled states. It supports real-time addition and deletion of participants without interrupting the core process.ConclusionWithout the need for a fully trusted third party or joint measurements, the protocol achieves the unification of security, efficiency, and dynamicity. It breaks through the core limitations of existing MQPC protocols and provides a practical technical solution for Quantum Private Comparison (QPC) in large-scale dynamic distributed scenarios.