An efficient simulation for quantum secure multiparty computation

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.

Improved quantum (t, n) threshold group signature

“…In addition, we also compare the quantum (t, n) threshold part of our scheme with the existing (t, n) threshold scheme 090308-7 based on quantum Fourier transform. [18][19][20] In the scheme proposed by Song et al, [18] the dealer uses polynomials to distribute classical secret shares and the secret reconstructors can perform CNOT operation and QFT −1 operation to recover the secret, but they need to obtain information from other participants. The scheme of Mashhadi [19] uses MSP instead of polynomials, and the reconstructor generates entangled states through SUM operation and QFT, and then recovers secrets through QFT and the generalized Pauli operator.…”

“…The scheme of Mashhadi [19] uses MSP instead of polynomials, and the reconstructor generates entangled states through SUM operation and QFT, and then recovers secrets through QFT and the generalized Pauli operator. The scheme proposed by Sutardhar [20] is an improvement of Song et al's scheme, and requires each participant to perform the QFT −1 operation on his own particle during the secret recovery phase.…”

“…In 2018, Mashhadi [19] designed a hybrid secret sharing scheme based on quantum Fourier transform and a monotonic spanning program that implements the features of classical and quantum secret sharing. In 2021, Sutradhar et al [20] improved the scheme of Song et al by increasing the number of quantum Fourier inversions, making the scheme more complex. In this paper we design a threshold scheme based on Shamir secret sharing and the quantum Fourier transform that can be added to quantum signatures.…”

Perfect secret sharing schemes from combinatorial squares

“…For details on secret sharing schemes we refer to Gopalakrishnan and Stinson, 4 Beimel 5 Koukouvinos et al 6 Changyuan, 7 Cramer et al 8 Huaixi et al 9 and Stinson and Wei, 10 among others. The proposed protocol can also be used to build the quantum protocols, see Sutradhar and Om 11‐19 …”

An Efficient Simulation of Quantum Secret Sharing

“…In our protocol, each player knows only his share, even the reconstructor knows only his share. In this protocol, we use some basic operations i.e., protocol-I of Shi et al [51], CN OT gate [37], secure communication [72,6,55,50,61,46,38,75,21,73,64,63,65], entangle state [71,53,54,7,45,52,59,58,57,49,47,42,48,56], Quantum Fourier Transform (QF T ) [19] and Inverse Quantum Fourier Transform (QF T −1 ) [19], to transform the particles. We use a quantum approach in classical secret sharing to combine the benefits of both classical and quantum secret sharing, preventing attacks such as Intercept-Resend (IR), Intercept, Entangle-Measure (EM), Forgery, Collision, and Collusion.…”