Dynamic quantum secret sharing occupies an important position in quantum cryptography. In this paper, an efficient and secure dynamic quantum direct two-secrets sharing scheme is proposed based on the GHZ state. The proposed scheme is a one-time sharing of a determined classic message and quantum states. For recovering the secret messages, the agents only need to have the ability to perform X-basis measurements on the particles without performing any unitary operation. When dynamically deleting agents, our scheme only requires the other agents to announce some information without transmitting any quantum. Moreover, the analysis shows that our scheme is able to resist dishonest revoked agent attack as well as a range of other common attacks. Compared with the existing dynamic quantum direct secret sharing schemes, the proposed scheme is more efficient and more secure.
Dynamic quantum secret sharing occupies an important position in quantum cryptography. In this paper, an efficient and secure dynamic quantum direct two-secrets sharing scheme is proposed based on the GHZ state. The proposed scheme is a one-time sharing of a determined classic message and quantum states. For recovering the secret messages, the agents only need to have the ability to perform X-basis measurements on the particles without performing any unitary operation. When dynamically deleting agents, our scheme only requires the other agents to announce some information without transmitting any quantum. Moreover, the analysis shows that our scheme is able to resist dishonest revoked agent attack as well as a range of other common attacks. Compared with the existing dynamic quantum direct secret sharing schemes, the proposed scheme is more efficient and more secure.
Abstract In this paper, two new efficient multiparty quantum direct secret sharing schemes are proposed via a six-particle GHZ state and Bell measurements. In the first scheme, based on the theory of security cryptanalysis, the secret message of the sender is directly encoded into the transmitted particles, and all the agents can obtain their information by performing bell measurement on the received particles, and then cooperate to recover the information of the sender. In the second scheme, we define a new secret shared coding method by performing local unitary operations on the transmitted particles, then agents perform Bell measurements on their own particles respectively, and feedback the measurement to the dealer. If the agent’s results are matched with the previous coding method, the protocol will work out. In addition, the proposed two schemes have the following common advantages: the sender can send all prepared particles to the receiver, and can send an arbitrary key to the receiver, rather than a random secret key; the proposed schemes do not need to insert any detection sets to detect eavesdropping and can resist both existing attacks and spoofing attacks by dishonest agents. The sender need not to retain any photons, so the sender’s quantum memory could be omitted here.
This paper proposes a dynamic multiparty to multiparty quantum secret sharing scheme, where two distant groups of participants can share the common secrets. In our present scheme, a trusted third party is required to reliably prepare all quantum resources. Each agent only needs to perform the local unitary operations or single-particle measurement completing the process of secret sharing. Secret can be recovered only if all agents cooperate each other. Furthermore, a new agent can be added or deleted from the current scheme with the help of the trusted third party. Finally, security analysis shows that our scheme can resist various common attacks. Compared to former existing researches, our scheme can be more efficient in real application.
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.
Quantum secret sharing occupies an important position in quantum cryptography. In this document, a dynamic (t, n) threshold quantum secret sharing scheme is proposed based on homogeneous LFSR sequences and d-dimensional Bell states. The secret shared among agents in this scheme is determined by the distributor and the scheme enables the update of agents without the help of other agents. More, this paper considers the case when no less than t agents cooperate in secret reconstruction, which makes the proposed scheme more flexible and practical than the existing ones. Finally, our scheme is not only resistant to eavesdropping, collusion, dishonest revoked agent, and in-attacker’s cheating attacks, but also agents can verify for themselves that the shared secrets are correct.
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.
Abstract At present, most quantum secret sharing (QSS) protocols are more or less designed with the incorporation of classical secret sharing schemes. With the increasing maturity of quantum technology, QSS protocols based on pure quantum mechanics are becoming more important. Classical secret sharing schemes cannot achieve absolute security, and their involvement can compromise the security of QSS protocols. This paper proposes a QSS scheme based on Greenberger–Horn–Zeilinger (GHZ) basis measurement and quantum entanglement exchange. In this protocol, the secret sender stores the secret information using Pauli operations. Participants obtain their shares by measuring the product state sequentially. Finally, participants complete the secret reconstruction through quantum entanglement exchange and other related quantum operations. In addition, the particles held by participants in the protocol do not contain any secret information. Each participant’s particles are in a state of maximum entanglement, and no participant can deduce the particle information of other participants through their own particles. At the same time, the protocol is based on pure quantum mechanics and does not involve classical schemes, which avoids the problem of reduced security of the protocol. Security analysis indicates that the protocol is not vulnerable to retransmission interception and collusion attacks. Moreover, it is capable of detecting and terminating the protocol promptly when facing with attacks from dishonest participants.