A (<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e1074" altimg="si826.svg"><mml:mi>w</mml:mi></mml:math>, <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e1079" altimg="si827.svg"><mml:mi>t</mml:mi></mml:math>, <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e1084" altimg="si816.svg"><mml:mi>n</mml:mi></mml:math>)-weighted threshold dynamic quantum secret sharing scheme with cheating identification
Fulin Li, Mei Luo, Huihui Zhu, Shixin Zhu, Binbin Pang
Abstract
Quantum secret sharing holds a significant place in quantum cryptography . In this paper, a ( w , t , n )-weighted threshold dynamic quantum secret sharing scheme with cheating identification is constructed based on the CRT for a polynomial ring. In our scheme, on the premise of not altering the private shares of the old participants, the dynamic update of the participants can be realized without other participants’ help, and the shared secret will not be changed. During the secret reconstruction phase, via executing the quantum state digital signature , the proposed scheme not only can timely detect the existence of the cheating behavior, but also once exists, definitely can identify one cheater and eliminate him from the system, making the scheme more secure. Moreover, our scheme enables secret sharing among participants with different authorities, which enhances the practicability of the scheme. Finally, the security analysis shows our scheme not only is resistant to a range of typical external attacks but can detect forgery, collusion, denial and dishonest revoked participant attacks.