A Verifiable (k,n)-Threshold Quantum Secure Multiparty Summation Protocol

Quantum secure multiparty summation plays an important role in quantum cryptography. In the existing quantum secure multiparty summation protocols, the (n,n)-threshold protocol has been given extensive attention. To increase the applicability of quantum secure multiparty summation protocols, a new quantum secure multiparty summation protocol based on Shamir’s threshold scheme and d-dimensional GHZ state is proposed in this paper. In the proposed protocol, i) it has a (k,n)-threshold approach; ii) in the result output phase, it can not only detect the existence of deceptive behavior but also determine the specific cheaters; iii) compared with the (n,n)-threshold quantum secure multiparty summation protocols, it needs less computation cost when L satisfies L > 4, where L is the length of each participant’s secret. In addition, the security analysis shows that our protocol can resist intercept-resend attack, entangle-measure attack, Trojan horse attack, and participant attack.