A (n, n)-threshold scheme of multiparty quantum secret sharing of classical or quantum message is proposed based on the discrete quantum Fourier transform. In our proposed scheme, the secret message, which is encoded by using the forward quantum Fourier transform and decoded by using the reverse, is split and shared in such a way that it can be reconstructed among them only if all the participants work in concert. Furthermore, we also discuss how this protocol must be carefully designed for correcting errors and checking eavesdropping or a dishonest participant. Security analysis shows that our scheme is secure. Also, this scheme has an advantage that it is completely compatible with quantum computation and easier to realize in the distributed quantum secure computation.
Quantum secret sharing (QSS) is an important branch of secure multiparty quantum computation. Several schemes for
(n,n) threshold QSS based on quantum Fourier transformation (QFT) have been proposed. Inspired by the flexibility of
(t,n) threshold schemes, Song {\it et al.} (Scientific Reports, 2017) have proposed a
(t,n) threshold QSS utilizing
QFT. Later, Kao and Hwang (arXiv:1803.00216) have identified a loophole in the scheme but have not suggested any remedy. In this present study, we have proposed a
(t,n) threshold QSS scheme to share a
d dimensional classical secret. This scheme can be implemented using local operations (such as
QFT, generalized Pauli operators and local measurement) and classical communication. Security of the proposed scheme is described against outsider and participants' eavesdropping.