Secret Sharing Based Multiparty Quantum Computation for Multiplication

In secure multiparty quantum computation (SMQC), the multiplication is one of the fundamental operations that can be used to assemble the complex quantum protocols. The existing protocols have the approach of either (n, n) threshold or (t, n) threshold, with high cost and low security. In this paper, we propose a secret sharing based quantum protocol for (t, n) threshold secure multiparty multiplication, where t out of n players can compute the multiplication efficiently with low cost. In this protocol, the multiparty quantum multiplication can be performed if the number of secrets are more than the number of players as the secrets are shared using the linear secret sharing. Further, the security analysis shows that it is more secure against the intercept, entangle-measure, collusion, collective, and coherent attacks as compared to the existing protocols.

Automated summary

This paper introduces a secret sharing based quantum protocol for (t, n) threshold secure multiparty multiplication, allowing efficient multiplication computation at low cost. The protocol employs linear secret sharing and provides higher security against intercept, entangle-measure, collusion, collective, and coherent attacks compared to existing protocols.