Quantum Secret Sharing Research Articles

Measurement‐Device‐Independent Continuous‐Variable Quantum Secret Sharing

AbstractAlthough continuous‐variable quantum secret sharing (CVQSS) is theoretically proven to be secure, it may still be subject to various practical attacks due to the imperfections of devices. In this study, measurement‐device‐independent CVQSS (MDI‐CVQSS) is proposed in which measurement is no longer the duty for the dealer but is performed by an untrusted party Charlie, so that all detector side‐channel attacks can be eliminated, greatly enhancing the practical security of CVQSS system. The security bound is derived for the proposed MDI‐CVQSS, and its numerical simulation shows that MDI‐CVQSS outperforms conventional CVQSS in terms of both secret key rate and maximal number of users. It is found that MDI‐CVQSS possesses several unique properties, such as local stability of the secret key rate, low total excess noise and high utilization rate of raw data, which indicate that MDI‐CVQSS has the potential for efficiently building a large‐scale quantum communication network. Moreover, it is also suggested three variations of MDI‐CVQSS to satisfy the requirements of different multi‐point quantum communication scenarios.

(t, m) Threshold quantum secret sharing with group authentication

Abstract Quantum secret sharing plays a key role as a foundational method for distributing a secret to all participants in quantum cryptography. Group authentication plays a significant role in safeguarding information as it confirms the identity of communication parties. This paper presents a d − level t , m threshold quantum secret-sharing scheme combined with group authentication. Group members can simultaneously authenticate their identities through group authentication. Using the Lagrange interpolation polynomial, the group authentication method disperses multiple secret shares to group members and later allows joint verification of some or all members. The complexities of the developed group authentication scheme are much lower than those found in widely recognized existing group authentication methods. This algorithm allows each participant to keep their secret shares secure and undisclosed. By avoiding transmission of these shares, external eavesdroppers are unable to obtain any secret information. This protocol offers security, efficiency, and practicality. Security analysis reveals its ability to resist intercept-resend attacks, entangle-measure attacks, collusion attacks, and forgery attacks. The proposed scheme ensures both confidentiality and integrity.

Experimental demonstration of complete quantum information masking and generalization of quantum secret sharing

Quantum information masking (QIM) allows encoding quantum information in multipartite systems. Complete QIM is of great significance in quantum foundation and application. However, the realization of complete QIM, even for single-qubit encoded information, is still lacking. Here, we propose to demonstrate complete QIM with 4-qubit entangled states. The proposed QIM can be readily extended to multipartite systems with arbitrary number of subsystems, enabling quantum secret sharing (QSS) and quantum teleportation between multiplayers. In experiment, we build up a 4-qubit hyperentangled state to implement complete QIM. The trace distance of 16 encoded single-qubit states falls within the range of 0.12 ± 0.02 to 0.03 ± 0.02. Furthermore, we implement QSS between six players by expanding the 4-qubit state to a 6-qubit state entangled in hybrid manner, in which we observe an average fidelity 0.85 ± 0.03 of the recovered states. Our results open the door towards QIM-enabled quantum information processing and provide applications in quantum communications.

A pure quantum secret sharing scheme based on GHZ basis measurement and quantum entanglement exchange

Abstract At present, most of the 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, Quantum Secret Sharing (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 quantum secret sharing scheme based on 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 faced with attacks from dishonest participants.

Security and Fairness in Multiparty Quantum Secret Sharing Protocol

Security and Fairness in Multiparty Quantum Secret Sharing Protocol

Advance Sharing Procedures for the Ramp Quantum Secret Sharing Schemes With the Highest Coding Rate

Advance Sharing Procedures for the Ramp Quantum Secret Sharing Schemes With the Highest Coding Rate

A (4, 4) threshold protocol of semi-quantum secret sharing using entangled state

Abstract Quantum secret sharing (QSS) can address the increasing threat of computing power. While semi-QSS protocols alleviate participants’ reliance on quantum devices, ensuring security and lowering the participation difficulty. In this paper, we propose a semi-QSS protocol based on four quantum entangled states within a four-dimensional quantum system. It generates a four-dimensional four-quantum entangled state through a dealer, requiring full quantum capability for the dealer and only partial quantum capability for the participants. Participants perform random operations on the received qubits, and eavesdropping detection is based on these random operations. Then the dealer can choose the correct measurement basis based on the receiver’s specific operations. The security and quantum efficiency of protocol depend on the ratio of information to decoy particles inserted by the dealer. Furthermore, the security analysis shows that the protocol is resistant to common quantum attacks.

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

Efficient multi-party quantum secret-sharing protocol

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

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

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.