Efficient Simulation of Quantum Secure Multiparty Computation
Kartick Sutradhar
TL;DR
This work addresses efficient secure quantum multiparty computation by introducing a $(t,n)$-threshold quantum secure multiparty summation (QSMS) that combines Shamir secret sharing with quantum operations. The protocol uses polynomials of degree $t-1$, shadow computation $m_u$, $t$-partite entangled states, the $QFT$ and $IQFT$, and modular arithmetic in a prime $d$ to compute $S\equiv (X+Y)\bmod d$ without revealing $X$ or $Y$. Correctness is guaranteed when the selected $t$ participants perform the quantum operations honestly, yielding $S = \sum_{u=1}^{t} m_u \bmod d$. The authors validate practicality via IBM quantum processor simulations with 3 players and 5 qubits (8192 shots), demonstrating feasible resource usage and potential applicability to secure voting, finance, and distributed data analysis.
Abstract
One of the key characteristics of secure quantum communication is quantum secure multiparty computation. In this paper, we propose a quantum secure multiparty summation (QSMS) protocol that can be applied to many complex quantum operations. It is based on the $(t, n)$ threshold approach. We combine the classical and quantum phenomena to make this protocol realistic and secure. Because the current protocols employ the $(n, n)$ threshold approach, which requires all honest players to execute the quantum multiparty summation protocol, they have certain security and efficiency problems. However, we employ a $(t, n)$ threshold approach, which requires the quantum summation protocol to be computed only by $t$ honest players. Our suggested protocol is more economical, practical, and secure than alternative protocols.