Abstract
The quantum secure multiparty computation is one of the important properties of secure quantum communication. In this paper, we propose a quantum secure multiparty summation (QSMS) protocol based on (t, n) threshold approach, which can be used in many complex quantum operations. To make this protocol secure and realistic, we combine both the classical and quantum phenomena. The existing protocols have some security and efficiency issues because they use (n, n) threshold approach, where all the honest players need to perform the quantum multiparty summation protocol. We however use a (t, n) threshold approach, where only t honest players need to compute the quantum summation protocol. Compared to other protocols our proposed protocol is more cost-effective, realistic, and secure. We also simulate it using the IBM corporation’s online quantum computer, or quantum experience.
Highlights
The quantum secure multiparty computation is one of the important properties of secure quantum communication
The proposed protocol is more secure against the participant attack and it has the threshold approach of (t, n), in which only the t honest players can securely compute the multiparty quantum summation
In secure multiparty classical computation, there exist many summation protocols, but they are unable to provide secure communications; whereas, the quantum secure multiparty summation (QSMS) is unconditional secure as it uses the concepts of quantum mechanics
Summary
The quantum secure multiparty computation is one of the important properties of secure quantum communication. We propose a quantum secure multiparty summation (QSMS) protocol based on (t, n) threshold approach, which can be used in many complex quantum operations. The existing protocols have some security and efficiency issues because they use (n, n) threshold approach, where all the honest players need to perform the quantum multiparty summation protocol. We use a (t, n) threshold approach, where only t honest players need to compute the quantum summation protocol. The proposed protocol is more secure against the participant attack and it has the threshold approach of (t, n), in which only the t honest players can securely compute the multiparty quantum summation. These protocols are based on a threshold approach of (n, n), where all players need to perform the secure multiparty quantum summation. These protocols are not cost-efficient because they have bit-by-bit operations. These protocols have some security issues because their modulo is too small
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
