Efficient multiparty quantum summation protocol in a restricted quantum environment

Efficient multiparty quantum summation protocol in a restricted quantum environment

연구 분야: Cryptography

학회: The Journal of Supercomputing

This paper introduces a multiparty semi-quantum summation protocol that leverages graph states within a restricted quantum environment. The protocol enables n classical participants, with the assistance of a semi-honest third party, to compute the summation result modulo 2 while preserving the privacy of their individual inputs. Classical participants have only two quantum capabilities: performing Hadamard operations and Z-basis measurements. The adoption of one-way qubit transmission eliminates the need for additional quantum devices to prevent quantum Trojan horse attacks and reduces transmission costs. Comprehensive security analysis, comparison, and simulation experiments validate the security, efficiency, and feasibility of the proposed protocol.