Verifiable Quantum Secret Research Articles

Verifiable quantum secret sharing scheme using Bell states for a class of special access structures

Verifiable quantum secret sharing scheme using Bell states for a class of special access structures

Verifiable quantum secret sharing scheme based on orthogonal product states

Abstract In the domain of quantum cryptography, the implementation of quantum secret sharing stands as a pivotal element. In this paper, we propose a novel verifiable quantum secret sharing protocol using the d-dimensional product state and Lagrange interpolation techniques. This protocol is initiated by the dealer Alice, who initially prepares a quantum product state, selected from a predefined set of orthogonal product states within the ℂ d ⊗ ℂ d framework. Subsequently, the participants execute unitary operations on this product state to recover the underlying secret. Furthermore, we subject the protocol to a rigorous security analysis, considering both eavesdropping attacks and potential dishonesty from the participants. Finally, we conduct a comparative analysis of our protocol against existing schemes. Our scheme exhibits economies of scale by exclusively employing quantum product states, thereby realizing significant cost-efficiency advantages. In terms of access structure, we adopt a (t,n)-threshold architecture, a strategic choice that augments the protocol’s practicality and suitability for diverse applications. Furthermore, our protocol includes a rigorous integrity verification mechanism to ensure the honesty and reliability of the participants throughout the execution of the protocol.

Verifiable Quantum Secret Sharing Scheme Based on LDPC Codes

Verifiable Quantum Secret Sharing Scheme Based on LDPC Codes

Verifiable quantum secret sharing with multi access structures

In this paper, we propose a verifiable quantum secret sharing scheme. We share multi classical secrets by using the qudit state among the participants based on the different access structures. Moreover, it is possible to check the honesty of participants in the recovery phase. Analyses show that the proposed scheme is secure against internal and external eavesdroppers.

Verifiable Quantum Secret Sharing Based on a Single Qudit

To detect frauds from some internal participants or external attackers, some verifiable threshold quantum secret sharing schemes have been proposed. In this paper, we present a new verifiable threshold structure based on a single qubit using bivariate polynomial. First, Alice chooses an asymmetric bivariate polynomial and sends a pair of values from this polynomial to each participant. Then Alice and participants implement in sequence unitary transformation on the $d$-dimensional quantum state based on unbiased bases, where those unitary transformations are contacted by this polynomial. Finally, security analysis shows that the proposed scheme can detect the fraud from external and internal attacks compared with the exiting schemes and is comparable to the recent schemes.

Verifiable hybrid secret sharing with few qubits

We consider the task of sharing a secret quantum state in a quantum network in a verifiable way. We propose a protocol that achieves this task, while reducing the number of required qubits, as compared to the existing protocols. To achieve this, we combine classical encryption of the quantum secret with an existing verifiable quantum secret sharing scheme based on Calderbank-Shor-Steane quantum error correcting codes. In this way we obtain a verifiable hybrid secret sharing scheme for sharing qubits, which combines the benefits of quantum and classical schemes. Our scheme does not reveal any information to any group of less than half of the $n$ nodes participating in the protocol. Moreover, for sharing a one-qubit state each node needs a quantum memory to store $n$ single-qubit shares, and requires a workspace of at most $3n$ qubits in total to verify the quantum secret. Importantly, in our scheme an individual share is encoded in a single qubit, as opposed to previous schemes requiring $\Omega(\log n)$ qubits per share. Furthermore, we define a ramp verifiable hybrid scheme. We give explicit examples of various verifiable hybrid schemes based on existing quantum error correcting codes.

Verifiable Quantum Secret Sharing Protocols Based on Four-Qubit Entangled States

A new verifiable three-party quantum secret sharing protocol is proposed based on a special four-qubit entangled state which is inequivalent to four-qubit singlet states under stochastic local operations and classical communication (SLOCC). The validity of the reconstructed secret is verifiable based on the method like Byzantine agreement. It is generalized to verifiable multiparty quantum secret sharing based on four-qubit entangled states. It is shown to be secure against common attacks and feasible with present-day technology. PACS number(s): 03.67.Dd, 03.67.Hk, 03.67.Lx.

A Quantum Entanglement Swapping Secret Sharing Agreement Model

A verifiable quantum secret sharing protocol model is proposed based on entanglement swapping. The dealer communicates with the participants one by one. The detection pattern or information pattern are choosed by uniform distribution, until he can make sure the information safe to the participant, and then he communicates with the next participant. This agreement not only is to avoid eavesdropping outside, and it can prevent internal fraud, thus the accuracy and security are ensured for information sharing, the verifiable results are achieved.

Verifiable (t,n) threshold quantum secret sharing using d-dimensional Bell state

A verifiable (t,n) threshold quantum secret sharing scheme is proposed by using the d-dimensional Bell state and the Lagrange interpolation. In the proposed scheme, the dealer distributes the shadows to the participants through the quantum direct communication. In the recovery phase, the dealer generates a two-qudit Bell state in the d-dimensional Hilbert space, and the participants perform the unitary operations on the Bell state to reconstruct the secret. The participants can judge whether the recovered secret is the original one, and check whether some dishonest participants provide the fake shadows in the reconstruction. Compared to the existing verifiable quantum secret sharing schemes, the proposed scheme needs less verification information, and can give more perfect security proof.

Cryptanalysis and improvement of verifiable quantum (k, n) secret sharing

After analyzing Yang's verifiable quantum secret sharing (VQSS) scheme, we show that in their scheme a participant can prepare a false quantum particle sequence corresponding to a forged share, while other any participant cannot trace it. In addition, an attacker or a participant can forge a new quantum sequence by transforming an intercepted quantum sequence; moreover, the forged sequence can pass the verification of other participants. So we propose a new VQSS scheme to improve the existed one. In the improved scheme, we construct an identity-based quantum signature encryption algorithm, which ensures chosen plaintext attack security of the shares and their signatures transmitted in the quantum tunnel. We employ dual quantum signature and one-way function to trace against forgery and repudiation of the deceivers (dealer or participants). Furthermore, we add the reconstruction process of quantum secret and prove the security property against superposition attack in this process.