Quantum Secret Sharing Research Articles

Semi-quantum secret sharing protocol with specific bits based on third party

Abstract The fundamental concept of secret sharing involves dividing a secret into multiple parts and distributing them among several participants, who collectively safeguard the secret. When it comes to restoring the secret, cooperation among specific participants is necessary to reconstruct the original secret. Quantum secret sharing (QSS) employs quantum methods to address some limitations of classical secret sharing. Semi-QSS, an advancement of quantum methods, requires fewer quantum resources. Previous semi-quantum protocols demanded at least one participant with full quantum capabilities and randomly generated secret information. This paper introduces a protocol allowing three participants lacking complete quantum capabilities to share secret information of specific bits with the assistance of a third party possessing complete quantum capabilities. Unlike previous approaches, this protocol does not require participants to possess full quantum capabilities and shares secret information of specific bits. These characteristics make the protocol more practical and flexible for real-world applications.

Efficient multi-party quantum secret-sharing protocol

ContextQuantum secret sharing allows one secret dealer to divide his/her secret among different participants. Only when all the participants pool their secret pieces together can the secret be reconstructed. Quantum secret-sharing protocol can provide high security for users who need to share some secret information among some partners. It is also a useful tool in many applications such as secure operations of joint sharing of quantum money, sharing ancilla states, and distributed quantum computation. ObjectiveWe propose a novel multi-party quantum secret-sharing protocol (MPQSSP). MethodsIn our protocol, the dealer mixes the particle sequence of the Bell states and sends the sequence to the participants. The participants encode their secret pieces into Pauli operators, which are applied to the received particle sequence. After annularly transmitting and operating the particle sequence, the participants return the particle sequence to the dealer, who can share a secret with the partners by measuring the returned sequence with the Bell basis. ResultsThe proposed MPQSSP has the merits as follows. First, its qubit efficiency can be 100% when the sample bits of the secret and the corresponding sample qubits are ignored (In our protocol when the qubit efficiency is computed, the sample bits and the corresponding Bell states used to check eavesdropping are ignored). Second, it can protect participants' privacy and interests, since the dealer cannot derive the secret piece of any participant although he/she masters the secret. Third, the participants need not perform many quantum operations and measurements to check the eavesdropping, which helps improve the efficiency of the protocol. Fourth, compared with most of the similar MPQSSPs, the quantum resources of the proposed one are relatively easier to prepare. At last, the proposed protocol has the security against various eavesdropping attacks. ConclusionThe merits above show that Our MPQSSP is relatively more practical and efficient than similar ones.

Source-independent quantum secret sharing with entangled photon pair networks.

The large-scale deployment of quantum secret sharing (QSS) in quantum networks is currently challenging due to the requirements for the generation and distribution of multipartite entanglement states. Here we present an efficient source-independent QSS protocol utilizing entangled photon pairs in quantum networks. Through the post-matching method, which means the measurement events in the same basis are matched, the key rate is almost independent of the number of participants. In addition, the unconditional security of our QSS against internal and external eavesdroppers can be proved by introducing an equivalent virtual protocol. Our protocol has great performance and technical advantages in future quantum networks.

Efficient and secure quantum secret sharing for eight users

Quantum secret sharing (QSS) has emerged as a promising avenue for storing secret with quantum-enhanced security. However, practical applications are hindered by the challenge for simultaneously implementing high-efficiency, high-security, and high-flexibility QSS with multiple users. Here we present an efficient, secure, and flexible QSS involving eight users with a continuous-variable eight-partite bound entanglement (BE) state, where only two nondegenerated optical parameter amplifiers are required. Such abilities are attributed to the generation of the eight-partite BE state with precise phase controlling systems and a large entanglement network, and fiber distribution with polarization-division multiplexing. In the QSS, a higher key rate can be demonstrated, when a secret is extracted through flexible combinations of more collaborative users. Our system may pave the way for the spatially separated multiuser quantum communications, while minimizing quantum hardware. Published by the American Physical Society 2024

Efficient and Verifiable General Quantum Secret Sharing Based on Special Entangled State

Efficient and Verifiable General Quantum Secret Sharing Based on Special Entangled State

Performance Comparison of the Two Reconstruction Methods for Stabilizer-Based Quantum Secret Sharing

Performance Comparison of the Two Reconstruction Methods for Stabilizer-Based Quantum Secret Sharing

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.

Verifiable Quantum Secret Sharing Scheme Based on LDPC Codes

Verifiable Quantum Secret Sharing Scheme Based on LDPC Codes

Dynamic and scalable secret sharing schemes based on matrix product compressed states

<sec>Currently, quantum secret sharing (QSS) schemes based on entangled states have not yet fully utilized the potential of the probability amplitude of entangled states. However, the probability amplitude is a key characteristic of quantum information science and possesses significant application prospects in the fields of quantum computing and quantum communication. It is worth noting that entangled states can be effectively represented by matrix product states (MPSs). The representation of entangled states using MPS can precisely reveal the entanglement characteristics closely related to the probability amplitude.</sec><sec>This study first focuses on the representation of the <i>W</i> state by using MPS, an approach that allows us to determine the key conditions for <i>W</i> state to achieve quantum advantage in QSS. Subsequently, this research demonstrates that by representing entangled states with MPS, a <i>W</i> state can be compressed into a single photon state and a simplified matrix form, presenting an innovative technical path.</sec><sec>Moreover, one of the most attractive features of our proposed QSS scheme is its ability to compress multiple different quantum states (represented by photons) into a unified state represented by a single photon. This characteristic endows our scheme with scalability and flexibility, meaning that the group of participants can be easily expanded or reduced according to their specific needs. The addition of new participants is managed by Alice, who is responsible for the distribution of quantum state shares. On the other hand, when a participant leaves the group, their old quantum state share can be simply ignored in the process of recovering the secret's quantum state, thereby simplifying the management process.</sec><sec>Through this strategy, we can not only make effective use of entangled resources but also meet the various requirements of the system, including but not limited to communication security, data transfer rates, and system scalability. This research provides new perspectives and possibilities for the field of quantum information science and may have a significant influence on the development of the field.</sec>

Symbolic model checking quantum circuits in Maude.

This article presents a symbolic approach to model checking quantum circuits using a set of laws from quantum mechanics and basic matrix operations with Dirac notation. We use Maude, a high-level specification/programming language based on rewriting logic, to implement our symbolic approach. As case studies, we use the approach to formally specify several quantum communication protocols in the early work of quantum communication and formally verify their correctness: Superdense Coding, Quantum Teleportation, Quantum Secret Sharing, Entanglement Swapping, Quantum Gate Teleportation, Two Mirror-image Teleportation, and Quantum Network Coding. We demonstrate that our approach/implementation can be a first step toward a general framework to formally specify and verify quantum circuits in Maude. The proposed way to formally specify a quantum circuit makes it possible to describe the quantum circuit in Maude such that the formal specification can be regarded as a series of quantum gate/measurement applications. Once a quantum circuit has been formally specified in the proposed way together with an initial state and a desired property expressed in linear temporal logic (LTL), the proposed model checking technique utilizes a built-in Maude LTL model checker to automatically conduct formal verification that the quantum circuit enjoys the property starting from the initial state.

Quantum Secret Sharing with Identity Authentication Based on GHZ States Entanglement Swapping

Quantum Secret Sharing with Identity Authentication Based on GHZ States Entanglement Swapping

A verifiable (t,n) threshold quantum secret sharing scheme based on asymmetric binary polynomial

Threshold quantum secret sharing is a typical method for quantum secret sharing (QSS) schemes. In this paper, we propose a verifiable threshold QSS scheme based on the -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 -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 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.

Efficient Mediated Quantum Secret Sharing Protocol in a Restricted Quantum Environment

AbstractThe multiparty‐mediated quantum secret sharing (MQSS) protocol proposed by Tsai et al. [Quantum Inf. Process., 2022, 21, 63] allows n restricted users with limited quantum capabilities to share secret information using a dishonest third party with full quantum capabilities. Although the MQSS protocol allows restricted users to achieve secret sharing with lightweight quantum capabilities, the qubit efficiency of this protocol can be further improved. Therefore, this study proposes a measurement property of the graph state to design an efficient mediated quantum secret‐sharing protocol in the same quantum environment as that of Tsai et al.’s protocol. The proposed MQSS protocol not only inherits the lightweight property of Tsai et al.’s protocol but also improves the qubit efficiency of Tsai et al.’s protocol by times. Security analysis is performed to show that the proposed MQSS protocol can avoid collective, collusion, and Trojan horse attacks. Furthermore, this study uses quantum network simulation software to implement Tsai et al.’s protocol and the proposed protocol to prove the feasibility of the proposed MQSS protocol and show that it is more efficient than Tsai et al.’s protocol.

Continuous-Variable Quantum Secret Sharing Based on Multi-Ring Discrete Modulation

Continuous-Variable Quantum Secret Sharing Based on Multi-Ring Discrete Modulation

Quantum secret sharing protocol through noisy channel with application in visual cryptography

SummaryThis study presents a quantum secret sharing (QSS) protocol designed using Grover's search algorithm in a noisy environment. The proposed protocol utilizes Grover's three‐particle quantum state. The proposed scheme is divided into secret information sharing and eavesdropping checking. The dealer prepares an encoded state by encoding the classical information as a marked state and shares the states' qubits between three participants. Using the amplitude‐damping noise and the phase‐damping noise as conventional noisy channels, it can be demonstrated that secret information can be conveyed between participants with some information lost. The security analysis shows the scheme is stringent against malicious participants or eavesdroppers. The simulation analysis is done on the cloud platform IBM‐QE thereby showing the practical feasibility of the scheme. Finally, an application of the proposed scheme is demonstrated in visual cryptography using the GNEQR representation of images.

Experimental demonstration of multiparty quantum secret sharing and conference key agreement

Quantum secret sharing (QSS) and conference key agreement (CKA) provide efficient encryption approaches for realizing multi-party secure communication, which are essential components of quantum networks. In this work, a practical, scalable, verifiable (k, n) threshold continuous variable QSS protocol secure against eavesdroppers and dishonest players are proposed and demonstrated. The protocol does not require preparing the laser source by each player and phase locking of independent lasers. The parameter evaluation and key extraction can be accomplished by only the dealer and the corresponding player. By using the multiple sideband modulation, a single heterodyne detector can extract the information of multiple players. The practical security of the system is considered. The system is versatile, it can support the CKA protocol by only modifying the classic post-processing and requiring no changes to the underlying hardware architecture. By implementing the QSS and CKA protocols with five parties over 25 km (55 km) single-mode fibers, a key rate of 0.0061 (7.14 × 10−4) bits per pulse is observed. The results significantly reduces the system complexity and paves the way for the practical applications of QSS and CKA with efficient utilization of resources and telecom technologies.

Efficient multiparty quantum secret sharing based on a novel structure and single qubits

Quantum secret sharing (QSS) is a significant branch of quantum cryptography and can be widely used in various applications. Quantum secret sharing schemes can be developed by utilizing different features of quantum mechanics, and quantum secure direct communication (QSDC) is an effective way to achieve secret sharing using single qubits. The utilization of QSDC offers certain benefits, such as low cost, high security, and great potential for implementation with current technologies. However, the purpose of QSDC is different from that of QSS, which causes some vulnerabilities, such as dishonest participant attacks. We discover two critical factors that affect the security of traditional protocols. Firstly, they skip a few steps from the QSDC protocol to the QSS protocol. Secondly, the participants have different privileges. This can lead to participants with more privileges engaging in potential attack behavior. In light of these issues, this study proposes a new multiparty QSS scheme to address these vulnerabilities. The proposed protocol ensures the independence of each participant and grants them equal privileges. Analysis results demonstrate that it can defend against malicious attackers, retain the advantages of the QSDC protocol, and further reduce transmission costs. It achieves an excellent balance between security and performance.

Quantitative security analysis of three-level unitary operations in quantum secret sharing without entanglement

Quantum secret sharing (QSS) protocols without entanglement have showed high security by virtue of the characteristics of quantum mechanics. However, it is still a challenge to compare the security of such protocols depending on quantitative security analysis. Based on our previous security analysis work on protocols using single qubits and two-level unitary operations, QSS protocols with single qutrits and three-level unitary operations are considered in this paper. Under the Bell-state attack we propose, the quantitative security analyses according to different three-level unitary operations are provided respectively in the one-step and two-step situations. Finally, important conclusions are drawn for designing and implementing such QSS protocols. The method and results may also contribute to analyze the security of other high-level quantum cryptography schemes based on unitary operations.

A (t, n) Threshold Quantum Secret Sharing Scheme with Fairness

A (t, n) Threshold Quantum Secret Sharing Scheme with Fairness

A Kind of (t, n) Threshold Quantum Secret Sharing with Identity Authentication.

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.