An Abstract Approach towards Quantum Secret Sharing

Ken Sasaki, Atsushi Waseda, Masakazu Soshi +1 more

Zhiwei Ma, Jing Li, Xianmin Wang +1 more

Abstract The fundamental concept of secret sharing involves dividing a secret into multiple parts and distributing them among several participants, who collectively safeguard the secret. When it comes to restoring the secret, cooperation among specific participants is necessary to reconstruct the original secret. Quantum secret sharing (QSS) employs quantum methods to address some limitations of classical secret sharing. Semi-QSS, an advancement of quantum methods, requires fewer quantum resources. Previous semi-quantum protocols demanded at least one participant with full quantum capabilities and randomly generated secret information. This paper introduces a protocol allowing three participants lacking complete quantum capabilities to share secret information of specific bits with the assistance of a third party possessing complete quantum capabilities. Unlike previous approaches, this protocol does not require participants to possess full quantum capabilities and shares secret information of specific bits. These characteristics make the protocol more practical and flexible for real-world applications.

Xu Shengwei

Yumin Dong, Yi Luo, Yanying Fu

Abstract Threshold quantum secret sharing is a cryptography technique for dividing and reconstructing secret information. The dealer shares a secret based on quantum mechanics principles, and a subset of participants cooperate to recover that secret. For example, in k , n quantum threshold scheme and n , n quantum threshold scheme, the former can only reconstruct the secret when at least k shares are collected. The latter requires all n shares to be collected to reconstruct the secret. However, in real scenarios, the priority of participant identities may vary. In order to meet the actual needs of participants with different rights, this paper proposes a w , ω , n quantum secret sharing (QSS) scheme. When the sum of participants’ weights w is greater than or equal to a threshold ω, they can cooperate to reconstruct the secret. In order to achieve this, this paper uses the entangled state of single particles and constructs a verifiable QSS scheme based on the Chinese remainder theorem. Significantly, in case of a dishonest participant, the dealer can delete the participant before recovering the secret to ensure the security of the communication. This scheme is more flexible than other threshold protocols. At the same time, it reduces the communication cost of the participants. In addition, security analysis shows that the scheme resists typical external and internal attacks.

Chen‐Ming Bai, Sujuan Zhang, Lu Liu

Feiting Guan, Jiansheng Guo, Lele Li

Abstract Threshold quantum secret sharing is a typical method for quantum secret sharing (QSS) schemes. In this paper, we propose a verifiable t , n threshold QSS scheme based on the d -dimensional Bell state and asymmetric binary polynomial. In this scheme, the dealer encodes the secret using the asymmetric binary polynomial and generates the corresponding secret share for each participant. Then, the dealer prepares the d -dimensional Bell state, and the participants perform corresponding unitary operations on the particles in transmission to recover the secret. With the hash function and the session key pairs, not only the cheating behavior of the dishonest participants can be detected, but also the specific cheaters can be identified. Furthermore, we consider the case when no less than t participants cooperate to recover the secret, which makes the proposed scheme more practical. Analyses show that the scheme can resist forgery attack, collusion attack and other common attacks.