<p>Quantum secret sharing plays an important role in quantum cryptography. When the deception occurs in quantum secret sharing scheme, the dishonest participant may obtain the secret exclusively. To address this, researchers have developed fair quantum secret sharing schemes to ensure the fairness of obtaining the secret among participants. However, we point that existing schemes achieve fairness at the significant cost of both efficiency and practicality. In this work, firstly, we propose a new fairness framework. Using our fairness framework, it is the first time that the scheme achieves fairness independent of the total round number <i>k</i> of reconstruction set in scheme. Compared to existing schemes that require big enough <i>k</i> to ensure fairness, our new method removes the obstacles to reducing rounds of reconstruction and significantly improving the scheme’s efficiency. Furthermore, our fairness framework can be used for all existing fair quantum secret sharing schemes to significantly reduce the rounds of reconstruction and improve the efficiency of the scheme. Secondly, we present an efficient verification mechanism for reconstructed parameters, which reduces computational cost and complexity compared to existing approaches. Lastly, combining fairness framework and efficient verification mechanism, a new and efficient fair quantum secret sharing scheme is proposed. Our scheme achieves fairness in just 2 rounds of reconstruction with less verification cost. Compared with existing fair quantum secret sharing schemes, our scheme has greatly improved the efficiency and enhanced the practicality.</p>