Quantum secret sharing (QSS) is a fundamental primitive in quantum cryptography. The existing QSS protocols are either [Formula: see text]-threshold or [Formula: see text]-threshold access structure, where [Formula: see text] denotes the number of players and [Formula: see text] denotes the threshold number of players. Here, we introduce a novel verifiable QSS scheme that executes a restricted hyperstar access structure by using entangled states. Our method involves encoding selected quantum states and their corresponding measurements to yield outcomes of either [Formula: see text] or [Formula: see text]. Furthermore, we give the validation of the scheme through the system of equations derived from the measurements, which then guarantees the honesty of the participants. At last, we also analyze the security of our scheme in two primary quantum attacks, such as external attacks and internal attacks.
Quantum secret sharing (QSS) is a fundamental primitive in quantum cryptography. The existing QSS protocols are either [Formula: see text]-threshold or [Formula: see text]-threshold access structure, where [Formula: see text] denotes the number of players and [Formula: see text] denotes the threshold number of players. Here, we introduce a novel verifiable QSS scheme that executes a restricted hyperstar access structure by using entangled states. Our method involves encoding selected quantum states and their corresponding measurements to yield outcomes of either [Formula: see text] or [Formula: see text]. Furthermore, we give the validation of the scheme through the system of equations derived from the measurements, which then guarantees the honesty of the participants. At last, we also analyze the security of our scheme in two primary quantum attacks, such as external attacks and internal attacks.
In this paper, drawing upon quantum state masking theory, we first propose a method that utilizes d-dimensional orthogonal arrays to encode quantum states into a multi-party quantum system. Building upon this foundation, we then design a quantum secret sharing scheme whose security is rooted in the principles of quantum information masking. This scheme is designed based on the hyperstar structure to define the access structure. Additionally, the protocol enables the transmission of arbitrary d-dimensional quantum states through quantum channels constructed using orthogonal arrays, ensuring that only participants within the access structure can recover the secret. We have thoroughly analyzed the security of this scheme against major quantum attacks, including intercept-resend attacks, entangle-measure attacks, and dishonest participant attack. In conclusion, our analysis examines the impact of four common types of noise on this protocol, confirming its immunity to dit-flip noise. Furthermore, we present a comparative analysis of the proposed scheme against existing quantum secret sharing protocols, highlighting its respective advantages.
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.
Quantum secret sharing is an important branch of quantum cryptography, and secure multi-party quantum key distribution protocols can be constructed using quantum secret sharing. In this paper, we construct a quantum secret sharing scheme built on a constrained (t, n ) threshold access structure, where n is the number of participants and t is the threshold number of participants and the distributor. Participants from two different sets perform the corresponding phase shift operations on two particles in the GHZ state passed to them, and then t−1 participants with the distributor can recover the key, where the participant recovering the key measures the particles received by himself and finally obtains the key through the collaboration of the distributors. Security analysis shows that this protocol can be resistant to direct measurement attacks, interception retransmission attacks, and entanglement measurement attacks. This protocol is more secure, flexible, and efficient compared with similar existing protocols, which can save more quantum resources.
In quantum cryptography, quantum secret sharing (QSS) is a fundamental primitive. QSS can be used to create complex and secure multiparty quantum protocols. Existing QSS protocols are either at the (n,n) threshold 2 level or at the (t,n) threshold d level with a trusted player, where n denotes the number of players and t denotes the threshold number of players. Here, we propose a secure d-level QSS protocol for sharing a secret with efficient simulation. This protocol is more secure, flexible, and practical as compared to the existing QSS protocols: (n,n) threshold 2-level and (t,n) threshold d-level with a trusted player. Further, it does not disclose any information about the secret to players. Its security analysis shows that the intercept-resend, intercept, entangle-measure, forgery, collision and collusion attacks are not possible in this protocol.
Abstract Quantum secret sharing (QSS) has significant potential to improve secure communications. However, conventional QSS protocols, typically based on (n, n) or (t, n) threshold structures, require participants to possess symmetric authority, which is often impractical. To address scenarios with participants holding asymmetric privileges, we propose an innovative QSS scheme that realizes a hypergraph structure. This enables secret recovery only for authorized sets with the appropriate privileges. In detail, a specialized hypergraph structure is investigated to construct d-dimensional multipartite entangled states. Using these states, we develop an authenticated QSS protocol that enables secret recovery by authorized sets. Security analysis confirms the protocol’s resilience against common attacks, including intercept-resend, entangle-measure, dishonest participant and Trojan horse attacks. We further characterize the distinct impacts of dit-flip, phase-flip, dit-phase-flip, and depolarizing noise channels on quantum state transmission within the protocol. This characterization demonstrates that dynamically adapting error probability threshold according to prevailing noise conditions is essential to maintain security. Compared with existing protocols, our scheme improves quantum efficiency and reduces the number of unitary operations, which enhances its experimental feasibility.
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.