Verifiable dynamic (t, n) threshold quantum secret sharing

Abstract Numerous high-quality quantum secret sharing (QSS) protocols have been proposed as integral components of quantum cryptography. However, only a limited number effectively integrate both dynamic and verifiable characteristics. This paper proposes a verifiable dynamic ( t , n ) QSS protocol based on the asymmetric binary polynomial and the d -dimensional Bell states. In the protocol, the dealer can find out the internal fraudsters by verifying whether an agent has used a correct share. The agents can also verify the correctness of the shares provided by the dealer. Besides, the dealer has the capability to independently adding or revoking of agents without requiring assistance from other agents. Furthermore, the protocol requires at least t agents to recover the secret, which makes the proposed protocol more flexible and practical than existing protocols. Our protocol shows good robustness against the intercept-and-resend, the entangle-and-measure, the internal, and the dishonest revoked agent attacks.