A cost-effective quantum protocol for secure multi-party multiplication

The secure multi-party quantum multiplication is one of the primitive operations in quantum cryptography that plays an important role to design complex quantum protocols like comparison, sorting, e-voting, etc. The existing multi-party quantum multiplication protocols are efficient, but they have some security issues as these protocols have approach of (n, n) threshold. In this paper, we propose a quantum protocol for secure multi-party multiplication based on the threshold approach of (t, n), where t out of n participants can execute it efficiently. This protocol can execute efficiently if the number of secrets is more than the the number of participants because the secrets are shared among the players using the secret sharing. Moreover, the proposed protocol is more cost-effective and secure as compared to the existing protocols.