Semi-Quantum Secure Multiparty Summation and its Applications to Anonymous Auction and Ranking

Semi-quantum secure summation allows multiple parties with limited quantum capabilities to perform collective calculations under the premise of protecting privacy. However, current approaches are confined to low-dimensional quantum states as information carriers and are restricted to scenarios involving two or three parties. This limitation hinders their universality and ability to fulfill the requirements of practical secure multiparty computations. To address these challenges, a novel semi-quantum secure multiparty summation (SQSMS) protocol is proposed based on high-dimensional entangled states and single-particle states. The protocol leverages the entanglement correlation to guarantee the security of the transmission, enabling resistance against various potential attacks. Then, by utilizing the IBM Qiskit platform, corresponding quantum circuits and simulation results are presented to validate the feasibility and correctness of the protocol. Furthermore, building upon the foundation of the SQSMS protocol, semi-quantum anonymous auction and anonymous ranking protocols are further constructed. Compared with previous approaches, the designed protocols cater to the requirements of their respective counterparts. Consequently, the approach may have broad applications in semi-quantum secure multiparty computation scenarios. This study presents a semi-quantum secure multiparty summation protocol based on high-dimensional entangled and single-particle states. The protocol constructs key relationships between different types of users through two different quantum states, offering scalability for applications in anonymous auctions and rankings. The corresponding circuit simulations have been conducted to validate its correctness and feasibility.image