Verifiable quantum protocol for dynamic secure multiparty summation based on homomorphic encryption ^*

Abstract

The research of quantum secure multiparty computation is a subject of great importance in modern cryptography. In this study, we construct a verifiable quantum protocol for dynamic secure multiparty summation based on the cyclic property of d-level MUBs. Our protocol can realize dynamic parameter update in the aspect of members and secret inputs, improving the practicality of the protocol. Moreover, a verification mechanism for result checking by applying ElGamal homomorphic encryption is given, and further enables the detectability of cheating behaviors, making our protocol safer. The security analysis proves the proposed protocol not only can resist a range of typical attacks from outside and inside, but also is secure against dishonest revoked participant attack which has been neglected in previous dynamic quantum summation protocols. From a theoretical perspective, compared with existing summation protocols, the protocol provides better practicability, higher privacy protection, and higher efficiency.

Multi-party semi-quantum secret sharing protocol based on measure-flip and reflect operations

“…Moreover, due to its ability to satisfy the requirements of multi-user secret sharing, QSS can be applied to scenarios of quantum secure multiparty computation. Serving as a foundational module, QSS can facilitate the construction of secure multiparty computation protocols with various functions, such as quantum sealed-bid auction [11][12][13] and quantum summation [14][15][16][17].…”