Secure Quantum Protocol for Multiparty Computation

With the recent development in quantum computers, the classical cryptographic tools may need to be upgraded and ensure that they must be quantum resistant. Secure multiparty is one of the important cryptographic protocols, with this a team of n-players can jointly compute a function, in such a way that the input of the function will be anonymous. In this paper, we have proposed a secure multiparty summation protocol for multiparty computation in a distributed environment. In this protocol out of n, the initiator selects k players, which will compute partial summation and send these partial results to the initiator. Here the initiator plays an important role and members elect the initiator by a voting function.