Abstract Most of Quantum Secret Sharing(QSS) are (n, n) threshold 2-level schemes, in which the 2-level secret cannot be reconstructed until all n shares are collected. In this paper, we propose a (t, n) threshold d-level QSS scheme, in which the d-level secret can be reconstructed only if at least t shares are collected. Compared with (n, n) threshold 2-level QSS, the proposed QSS provides better universality, flexibility, and practicability. Moreover, in this scheme, any one of the participants does not know the other participants’ shares, even the trusted reconstructor Bob1 is no exception. The transformation of the particles includes some simple operations such as d-level CNOT, Quantum Fourier Transform(QFT), Inverse Quantum Fourier Transform(IQFT), and generalized Pauli operator. The transformed particles need not to be transmitted from one participant to another in the quantum channel. Security analysis shows that the proposed scheme can resist intercept-resend attack, entangle-measure attack, collusion attack, and forgery attack. Performance comparison shows that it has lower computation and communication costs than other similar schemes when 2 < t < n − 1.
Abstract Most of Quantum Secret Sharing(QSS) are (n, n) threshold 2-level schemes, in which the 2-level secret cannot be reconstructed until all n shares are collected. In this paper, we propose a (t, n) threshold d-level QSS scheme, in which the d-level secret can be reconstructed only if at least t shares are collected. Compared with (n, n) threshold 2-level QSS, the proposed QSS provides better universality, flexibility, and practicability. Moreover, in this scheme, any one of the participants does not know the other participants’ shares, even the trusted reconstructor Bob1 is no exception. The transformation of the particles includes some simple operations such as d-level CNOT, Quantum Fourier Transform(QFT), Inverse Quantum Fourier Transform(IQFT), and generalized Pauli operator. The transformed particles need not to be transmitted from one participant to another in the quantum channel. Security analysis shows that the proposed scheme can resist intercept-resend attack, entangle-measure attack, collusion attack, and forgery attack. Performance comparison shows that it has lower computation and communication costs than other similar schemes when 2 < t < n − 1.
Quantum secret sharing (QSS) is an important branch of quantum cryptography. Identity authentication is a significant means to achieve information protection, which can effectively confirm the identity information of both communication parties. Due to the importance of information security, more and more communications require identity authentication. We propose a d-level (t,n) threshold QSS scheme in which both sides of the communication use mutually unbiased bases for mutual identity authentication. In the secret recovery phase, the sharing of secrets that only the participant holds will not be disclosed or transmitted. Therefore, external eavesdroppers will not get any information about secrets at this phase. This protocol is more secure, effective, and practical. Security analysis shows that this scheme can effectively resist intercept–resend attacks, entangle–measure attacks, collusion attacks, and forgery attacks.
(t,n) Threshold d-level quantum secret sharing based on quantum Fourier transformation
Quantum secret sharing (QSS) is an important branch of secure multiparty quantum computation. Several schemes for (n,n) threshold QSS based on quantum Fourier transformation (QFT) have been proposed. Inspired by the flexibility of (t,n) threshold schemes, Song {\it et al.} (Scientific Reports, 2017) have proposed a (t,n) threshold QSS utilizing QFT. Later, Kao and Hwang (arXiv:1803.00216) have identified a loophole in the scheme but have not suggested any remedy. In this present study, we have proposed a (t,n) threshold QSS scheme to share a d dimensional classical secret. This scheme can be implemented using local operations (such as QFT, generalized Pauli operators and local measurement) and classical communication. Security of the proposed scheme is described against outsider and participants' eavesdropping.
Quantum secret sharing (QSS) is an important branch of secure multiparty quantum computation. Several schemes for (n, n) threshold QSS based on quantum Fourier transformation (QFT) have been proposed. Inspired by the flexibility of (t, n) threshold schemes, Song {\it et al.} (Scientific Reports, 2017) have proposed a (t, n) threshold QSS utilizing QFT. Later, Kao and Hwang (arXiv:1803.00216) have identified a {loophole} in the scheme but have not suggested any remedy. In this present study, we have proposed a (t, n)threshold QSS scheme to share a d dimensional classical secret. This scheme can be implemented using local operations (such as QFT, generalized Pauli operators and local measurement) and classical communication. Security of the proposed scheme is described against outsider and participants' eavesdropping.
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.
Abstract In the field of quantum cryptography, Quantum Secret Sharing (QSS) holds substantial importance, with identity authentication emerging as a key strategy for safeguarding information. It efficiently certifies the identification of both persons involved in the conversation, which contributes to increased security measures. Our proposal, a (m, n) threshold Quantum Secret Sharing (QSS) scheme introduces a unique approach to mutual identity authentication, utilizing mutually unbiased bases. During the secret recovery phase, the scheme ensures that secrets exclusively held by participants remain undisclosed and are not transmitted, reinforcing the security of the communication process. As a result, external eavesdroppers are left empty-handed in their attempt to access information about secrets during this phase. Our protocol surpasses in terms of security, effectiveness, and practicality, proving its resilience against intercept–resend attacks, collusion attacks, collective attacks, and forgery attacks according to a comprehensive security analysis.
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.