Efficient Semi-Quantum Secure Multi-Party Summation Protocol Based on Cancelable Random Masks and Its Applications

Quantum Secure Multi-party Summation (QSMS) is a fundamental primitive of Quantum Secure Multi-party Computation (QSMC), enabling multiple participants to jointly compute the sum of their private inputs without disclosing individual data. However, most existing QSMS protocols require all participants to possess full quantum capabilities and often rely on pre-shared keys, auxiliary mask transmission, or multiple trusted third parties, resulting in high communication overhead and limited practicality. To address these limitations, we propose an efficient Semi-Quantum Secure Multi-party Summation (SQSMS) protocol based on d-dimensional n-particle entangled states. By exploiting the global correlation properties of high-dimensional entangled states, the proposed protocol generates correlated random masks directly from quantum measurement outcomes. These masks cancel automatically during the aggregation process, eliminating the need for additional mask distribution and transmission. Compared with existing QSMS schemes, the proposed protocol reduces communication overhead, improves quantum efficiency, and avoids reliance on pre-shared keys or multiple trusted third parties. Moreover, only simple measurement operations are required from classical participants, making the protocol more practical for semi-quantum environments. We further provide formal correctness and security analyses of the proposed protocol and conduct quantum circuit simulations using the IBM Qiskit platform to demonstrate its feasibility. Moreover, based on the proposed summation protocol, we design several extended application protocols, including anonymous voting, anonymous auction, and anonymous ranking, which further illustrate the scalability and practical applicability of the proposed scheme.