Dynamic Quantum Secret Research Articles

Dynamic quantum secret sharing with identity verification based on quantum walks

Abstract A dynamic quantum secret sharing protocol with authentication is proposed based on quantum walks. The protocol can share specific secrets and also update the secret information periodically based on the existing quantum walks structure. Participants can be added or removed while keeping the original secret unchanged. This is more flexible in practical applications. Before the secrets are shared, each participant is authenticated to ensure the legitimacy of all participants' identities. In addition, the protocol uses single photons as quantum resources, avoiding the complex preparation of entangled states, which makes the protocol more advantageous and potential in practical applications. Security analyses show that the protocol is resistant to collusion attack and other common attacks.

A threshold changeable dynamic quantum secret sharing scheme with cheating identification

A threshold changeable dynamic quantum secret sharing scheme with cheating identification

Verifiable dynamic quantum secret sharing based on generalized Hadamard gate

Verifiable dynamic quantum secret sharing based on generalized Hadamard gate

Efficient dynamic quantum secret sharing in pre-measurement and post-measurement phases

This study introduces a novel dynamic quantum secret sharing (DQSS) protocol that utilizes entanglement swapping, Bell measurements, and single-particle measurements to enable agent addition and revocation in both the pre-measurement and post-measurement phases. Since the dealer is only required to prepare Bell states for execution, the proposed DQSS offers greater flexibility and practicality compared to other existing protocols that rely on multiparticle entangled states and are limited to agent modifications in one phase. Furthermore, the proposed DQSS not only exhibits superior qubit efficiency to other related protocols but also demonstrates resilience against several notable attack methods, including Trojan horse and collusion attacks.

Dynamic hierarchical quantum secret sharing with general access structure

Dynamic hierarchical quantum secret sharing with general access structure

An efficient and secure dynamic quantum direct two-secrets sharing scheme

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 between multiparty and multiparty based on single photons

We propose a dynamic quantum secret sharing protocol between multiparty (m agents in group 1) and multiparty (n agents in group 2) based on single photons with the help of a third party. Compared with previous ones, our protocol has several improvements. Firstly, the quantum resources used in the protocol are merely single photons and local unitary operations, making it convenient to be implemented. Secondly, we do not need to verify the secret shares when adding agents, which simplifies the procedures. Finally, the security of the proposed protocol is improved. The attackers cannot get any effective information even if they have intercepted the sequences. At the same time, both two groups of agents could hold their own secret shares in privacy, which means they are not able to get each other’s secret shares.

A ([formula omitted], [formula omitted], [formula omitted])-weighted threshold dynamic quantum secret sharing scheme with cheating identification

Quantum secret sharing holds a significant place in quantum cryptography. In this paper, a (w, t, n)-weighted threshold dynamic quantum secret sharing scheme with cheating identification is constructed based on the CRT for a polynomial ring. In our scheme, on the premise of not altering the private shares of the old participants, the dynamic update of the participants can be realized without other participants’ help, and the shared secret will not be changed. During the secret reconstruction phase, via executing the quantum state digital signature, the proposed scheme not only can timely detect the existence of the cheating behavior, but also once exists, definitely can identify one cheater and eliminate him from the system, making the scheme more secure. Moreover, our scheme enables secret sharing among participants with different authorities, which enhances the practicability of the scheme. Finally, the security analysis shows our scheme not only is resistant to a range of typical external attacks but can detect forgery, collusion, denial and dishonest revoked participant attacks.

Dynamic hierarchical quantum secret sharing based on the multiscale entanglement renormalization ansatz

Tensor networks offer a novel and powerful tool for solving a variety of problems in mathematics, data science, and engineering. One such network is the multiscale entanglement renormalization ansatz (MERA). The MERA exhibits a hierarchical structure of layers, where each layer corresponds to a particular length (or energy) scale. The structure can be easily constructed using isometric and disentangler transformations. The following question arises: Is it possible to use the MERA to build hierarchical quantum secret sharing (HQSS)? The paper answers the question in the affirmative. In particular, it shows how a hierarchy of participant trust and authority relates to a MERA structure. The structure consists of binary and ternary MERA modules, which generate secret shares for participants. Because a binary MERA can be replaced by its ternary sibling and vice versa, our HQSS scheme is dynamic, allowing promotion and demotion of participants from the different layers but also enrollment of new ones and disenrollment of old ones from the same layer. The correctness and security of our dynamic hierarchical quantum secret sharing scheme are discussed.

Dynamic [formula omitted] threshold quantum secret sharing based on [formula omitted]-dimensional Bell state

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.

A novel dynamic quantum secret sharing in high-dimensional quantum system

This paper proposed a novel dynamic quantum secret sharing protocol in high-dimensional quantum system. Via transmitting the particles circularly and local unitary operations, the dealer and all agents can share the multi-particle entangled GHZ state in high-dimensional quantum system. The proposed protocol allows a dealer to share the predetermined dits without directly distributing any piece of shares to agents. To recover the secrets, dealer and all agents only need to perform the single-particle measurement operation and then implement the simple modular arithmetic operation according to their corresponding measurement results. Besides, in the proposed protocol, only a little fraction of entangled GHZ states are employed for eavesdropping check instead of lots of decoy (or detecting) particles used in previous protocols. Since the protocol is designed in the high-dimensional quantum system, it makes our protocol have higher resource capacity and better security in detecting the illegal eavesdropper than former protocols designed in two-dimensional quantum system. Security analyses indicate that the proposed protocol is immune to general attacks of intercept-and-resend, entangle-and-measure, collusion, and revoked a dishonest agent. Furthermore, the efficiency of proposed DQSS protocol in noise environment is deduced through quantum fidelity. The obtained results indicate that the efficiency of proposed protocol decreases with the increase in channel noise parameter and it has a quite different efficiency in four types of noise, i.e., dit-flip, d-phase-flip, amplitude-damping and depolarizing.

Analysis of efficient and secure dynamic quantum secret sharing protocol based on Bell states

Dynamic secret sharing can deal with the problems of both adding agents and revoking ones, which makes it more practical and flexible compared with general secret sharing. In this work, we analyze an efficient and secure dynamic quantum secret sharing protocol based on Bell states, and find that there is an unnoticed problem that it does not satisfy the requirement for dynamic secret sharing in the sense that if the access structure has been completed, then both adding an agent and revoking one become impossible by the way in this protocol; or else if adding an agent or revoking one can be realized, then the previous access structure has not been implemented in fact. Furthermore, we discuss how to solve this problem and give a possible way to improve this protocol.

Efficient and secure dynamic quantum secret sharing protocol based on bell states

This study proposes a dynamic quantum secret sharing (DQSS) protocol based on the measurement property of Bell states and the Greenberger–Horne–Zeilinger (GHZ) state. In the existing DQSS protocols, the dealer requires the revoked agent to resend the shadow of the secret key and check the correctness of the shadow key. However, in the proposed DQSS protocol, the agents do not need to generate photons or perform any local unitary operation that can obtain the shadow of the secret key by performing an X-basis measurement on single photons. The proposed DQSS protocol is more efficient and practical than the existing DQSS protocols, because it only generates two-particle quantum entanglements, which are simpler than multi-particle quantum entanglements. Moreover, in the proposed DQSS protocol, if an agent needs to be revoked from the system, the dealer only needs to perform the GHZ measurement on the sequences of the remaining agents. Further, the proposed DQSS protocol is immune to eavesdropping, collusion, and dishonest revoked agent attacks.

An asymmetric dynamic multiparty quantum secret sharing against active attacks

We propose a dynamic quantum secret sharing (DQSS) protocol based on traveling single-qubits where any number of players can join or leave the protocol according to the dealer’s and players’ will. The protocol can resist collusion attacks of dishonest players by using an honesty test based on some unambiguous unitary operations. Specifically, the proposed protocol is secure against active attacks from dishonest players, which is different from existing protocols that consider only passive attacks based on the assumption that players are honest but curious. By using the asymmetric strategy, the efficiency of our DQSS protocol can be made asymptotically close to 100%. Compared with previous DQSS protocols, our protocol is securer, more efficient and more practical.

Participant attack and improving dynamic quantum secret sharing using d-dimensional GHZ state

In 2017, Qin and Dai [Quantum Inf. Process. 16, 64 (2017). https://doi.org/10.1007/s11128-017-1525-y ], proposed a dynamic quantum secret sharing (DQSS) scheme based on the d-dimensional state. However, as shown in this study, a malicious participant can reveal the secret key of other participants without being detected. Furthermore, this study identifies a security issue in Qin and Dai’s DQSS protocol pertaining to the honesty of a revoked participant. Without considering these security issues, the DQSS protocol could fail at providing secret-sharing function. Therefore, two improvements are proposed to circumvent these problems.

Cryptanalysis and improvement of dynamic quantum secret sharing protocol based on two-particle transform of Bell states

In this paper [Chin. Phys. B 27 (2018) 080304], Du and Bao proposed a quantum secret sharing protocol based on two-particle transform of Bell states. We study the security of the proposed protocol and find that it is not secure, that is, the two dishonest agents, Bob and Zach, can collude to obtain Alice's secret messages without the help of the other agents. Finally, we give a possible improvement of the proposed protocol.

Dynamic quantum secret sharing protocol based on two-particle transform of Bell states**Project supported by the National Basic Research Program of China (Grant No. 2013CB338002).

To solve the problems of updating sub-secrets or secrets as well as adding or deleting agents in the quantum secret sharing protocol, we propose a two-particle transform of Bell states, and consequently present a novel dynamic quantum secret sharing protocol. The new protocol can not only resist some typical attacks, but also be more efficient than the existing protocols. Furthermore, we take advantage of the protocol to establish the dynamic secret sharing of a quantum state protocol for two-particle maximum entangled states.

Dynamic quantum secret sharing by using d-dimensional GHZ state

Through generating the d-dimensional GHZ state in the Z-basis and measuring it in the X-basis, a dynamic quantum secret sharing scheme is proposed. In the proposed scheme, multiple participants can be added or deleted in one update period, and the shared secret does not need to be changed. The participants can be added or deleted by themselves, and the dealer does not need to be online. Compared to the existing schemes, the proposed scheme is more efficient and more practical.

Multi-group dynamic quantum secret sharing with single photons

In this letter, we propose a novel scheme for the realization of single-photon dynamic quantum secret sharing between a boss and three dynamic agent groups. In our system, the boss can not only choose one of these three groups to share the secret with, but also can share two sets of independent keys with two groups without redistribution. Furthermore, the security of communication is enhanced by using a control mode. Compared with previous schemes, our scheme is more flexible and will contribute to a practical application.

Dynamic (2, 3) Threshold Quantum Secret Sharing of Secure Direct Communication* *Supported in part by an International Macquarie University Research Excellence Scholarship (iMQRES), Australian Research Council Grant DP0987734. This work is also supported by the National Basic Research Program of China (973 Program) under Grant No. 2010CB923200, the National Natural Science Foundation of China under No. 61377067, Fund of State

In this paper, we show that a (2, 3) discrete variable threshold quantum secret sharing scheme of secure direct communication can be achieved based on recurrence using the same devices as in BB84. The scheme is devised by first placing the shares of smaller secret pieces into the shares of the largest secret piece, converting the shares of the largest secret piece into corresponding quantum state sequences, inserting nonorthogonal state particles into the quantum state sequences with the purpose of detecting eavesdropping, and finally sending the new quantum state sequences to the three participants respectively. Consequently, every particle can on average carry up to 1.5-bit messages due to the use of recurrence. The control codes are randomly prepared using the way to generate fountain codes with pre-shared source codes between Alice and Bob, making three participants can detect eavesdropping by themselves without sending classical messages to Alice. Due to the flexible encoding, our scheme is also dynamic, which means that it allows the participants to join and leave freely.