A rational hierarchical (t,n)-threshold quantum secret sharing scheme.

Quantum secret sharing plays a crucial role in quantum cryptography. In this paper, we present a rational hierarchical (t,n)-threshold quantum secret sharing scheme based on Lagrange interpolation. In our scheme, participants possess rational and hierarchical properties, and the secret can be reconstructed when the number of rational participants satisfies the hierarchical (t,n)-threshold structure proposed in this paper. The reconstructed secret can encompass both classical information and quantum state information, enhancing the practicality and flexibility of our scheme compared to existing ones. Additionally, we redefine the utility of participants based on their roles in the secret recovery process. This newly defined utility allows for a more precise analysis of the correctness, fairness, and equilibrium of our scheme. Finally, our scheme not only resists a typical set of external attacks but also incorporates mechanisms to detect forgery and collusion among participants. [ABSTRACT FROM AUTHOR]