A verifiable (k, n)-threshold dynamic quantum secret sharing scheme

Dynamic quantum secret sharing plays an important role in quantum cryptography. A verifiable (k, n)-threshold dynamic quantum secret sharing scheme is proposed. In the proposed scheme, we can determine the honesty of which one of the participants by the one-to-one correspondence between the shadows and its hash values. And the threshold k is realized by constructing a homogeneous linear system of equations corresponding to a non-full rank matrix. In addition, multiple secrets can be shared by combining classical secret sharing with quantum mechanism. Analyses show that the proposed scheme is resistant to the collusion attack, the revoked participant attack and various other common attacks. Moreover, compared with the existing quantum secret sharing scheme, we have the following merits: (1) sharing multiple secrets; (2) more practical.