This paper presents a simple and novel quantum secret sharing scheme using GHZ-like state. The characteristics of the GHZ-like state are used to develop the quantum secret sharing scheme. In contrast with the other GHZ-based QSS protocols with the same assumptions, the proposed protocol provides the best quantum bit efficiency.
With the rapid progress of quantum cryptography, secret sharing has been developed in the quantum setting for achieving a high level of security, which is known as quantum secret sharing (QSS). The first QSS scheme was proposed by Hillery et al. in 1999 [Phys. Rev. A, Vol. 59, p.1829 (1999)] based on entangled Greenberger-Horne-Zeilinger (GHZ) states. However, only 50% of the entangled quantum states are effective for eavesdropping detection and secret splitting in the original scheme. In this paper, we introduce a possible method, called measurement-delay strategy, to improve the qubit efficiency of the GHZ-based QSS scheme. By using this method, the qubit efficiency of the improved QSS scheme can reach 100% for both security detection and secret distribution. The improved QSS scheme can be implemented experimentally based on current technologies.
With the rapid progress of quantum cryptography, secret sharing has been developed in the quantum setting for achieving a high level of security, which is known as quantum secret sharing (QSS). The first QSS scheme was proposed by Hillery et al. in 1999 [Phys. Rev. A, Vol. 59, p.1829 (1999)] based on entangled Greenberger-Horne-Zeilinger (GHZ) states. However, only 50% of the entangled quantum states are effective for eavesdropping detection and secret splitting in the original scheme. In this paper, we introduce a possible method, called measurement-delay strategy, to improve the qubit efficiency of the GHZ-based QSS scheme. By using this method, the qubit efficiency of the improved QSS scheme can reach 100% for both security detection and secret distribution. The improved QSS scheme can be implemented experimentally based on current technologies.
Quantum secret sharing (QSS) is a crucial quantum cryptographic method that provides unconditional secu-rity through the principles of quantum mechanics and enables practical applications in information security and distributed computing. Many QSS protocols have been proposed based on various quantum properties and operations. In this study, we propose a new and efficient multiparty quantum secret sharing protocol that utilizes entanglement swapping with the Greenberger-Horne-Zeilinger (GHZ) state and introduces a novel structure to efficiently and securely distribute and recover secrets. Due to entanglement swapping, participants can entangle systems without directly interacting with each other, enhancing practical usage. Through GHZ entanglement swapping, initial particle states cannot be directly inferred. The proposed QSS protocol leverages this property to encode information among participants. To decode the secret, participants only require measuring particles on a GHZ basis to get the corresponding information without performing operations. Through security analysis, it is shown that any eavesdropper or dishonest participant will be detected. Efficiency analysis indicates that the proposed protocol substantially reduces costs and significantly enhances efficiency. As the number of participants increases, the resource consumption of the proposed protocol becomes much lower than that of other QSS protocols. In summary, the proposed protocol efficiently achieves unconditional security in QSS, ensuring the secure transmission and sharing of quantum information.
In this paper, we propose an efficient multi-party quantum secret sharing scheme based on GHZ entangled state. The participants in this scheme are divided into two groups, and share secrets as a group. There is no need to exchange any measurement information between the two groups, reducing the security problems caused by the communication process. Each participant holds one particle from each GHZ state; it can be found that the particles of each GHZ state are related after measuring them, and the eavesdropping detection can detect external attacks based on this characteristic. Furthermore, since the participants within the two groups encode the measured particles, they can recover the same secrets. Security analysis shows that the protocol can resist the intercept-and-resend attack and entanglement measurement attack, and the simulation results show that the probability of an external attacker being detected is proportional to the amount of information he can obtain. Compared with the existing protocols, this proposed protocol is more secure, has less quantum resources and is more practical.
The characteristics of W state are introduced.The coefficients of W state used for quantum key distribution and secret sharing are proved to be uniform in symmetrical form.The corresponding quantum key distribution scheme via W state is proposed.To insure the security of the proposed quantum key distribution protocol, the receiver switches randomly the message mode to control mode asymmetrically.The security of the protocol is discussed.Quantum secret sharing scheme is accordingly proposed.And the security of the schemes is also discussed.Compared with the quantum key distribution and secret sharing schemes with Greenberger-Horne-Zeilinger(GHZ) states,the efficiency of the proposed schemes is low. The purpose of this paper is just to prove that some states except for GHZ states can be used for quantum key distribution and secret sharing.
Since the first quantum secret sharing protocol based on Greenberger–Horne–Zeilinger (GHZ) states was presented by Hillery et al, dozens of quantum secret sharing protocols based on different entangled states (e.g. Bell states, d-level Bell states and GHZ states, etc) and product states have been developed. In this paper, we present a quantum secret sharing protocol, in which the genuinely maximally entangled six-qubit states, which was found recently by Borras et al, are used. An ordinary entangled state such as a Bell state or a GHZ state, etc can be used to share at most only one bit. However, according to our protocol, Alice can share three bits among three parties by a six-qubit state, which shows that our protocol is more efficient than any previous protocol.