Efficient Simulation of Quantum Secure Multiparty Computation

TL;DR

This paper introduces a more efficient and secure quantum multiparty summation protocol using a $(t, n)$ threshold approach, reducing the number of honest players needed and improving practicality over existing methods.

Contribution

It proposes a novel quantum secure multiparty summation protocol based on the $(t, n)$ threshold approach, enhancing security and efficiency compared to traditional $(n, n)$ protocols.

Findings

The protocol is more economical and practical.

It maintains security with fewer honest players.

It is applicable to complex quantum operations.

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.