A Verifiable $(t, n)$ Threshold Quantum State Sharing Against Denial Attack

Abstract

To detect frauds by a dealer or some participants, researchers have proposed verifiable threshold quantum state sharing (VTQSTS) schemes. However, the existing VTQSTS schemes either have lowcomputation efficiency or weak security. In this paper, a verifiable (t, n) threshold quantum state sharing against denial attack (VTQSTS-ADA) scheme is proposed to overcome the above limitations, in which the dealer Alice encodes the quantum secret sequence into two quantum message sequences and a quantum signature sequence. First, for each participant in the authorization subset, the received quantum signature sequence is validated by a quantum verification algorithm, and then a unitary transformation with a rotation key is performed on the received quantum message sequence; next, a new quantum signature sequence is generated by a quantum signature algorithm with the signature key. Each participant sends the new message sequences and signature sequence to the next participant. The original quantum secret sequence can be reconstructed when t(t ≤ n) participants collaborate. The security analysis shows that the proposed VTQSTS-ADA scheme can detect the fraud instances raised by the dealer and participants and provide stronger security such as resisting denial attacks and man-in-middle attacks compared with the existing schemes. The performance analysis shows that the proposed VTQSTS-ADA scheme outperforms the earlier VTQSTS scheme and is comparable to the recent scheme.INDEX TERMS Threshold quantum state sharing, quantum state digital signature, denial attack, man-in-middle attack.

Perfect secret sharing schemes from combinatorial squares

“…Here we show that the proposed secret sharing scheme is perfect. Following Chaudhry et al 3 and Song et al, 34 let $$$ \mathcal{P}=\left\{{P}_1,{P}_2,\dots, {P}_n\right\} $$$ be a finite set of participants and $$$ \Gamma =\left\{{A}_1,{A}_2,\dots, {A}_t\right\} $$$ be an access structure over $$$ \mathcal{P} $$$, that is, each $$$ {A}_i\left(1\le i\le t\right) $$$ is a subset of $$$ \mathcal{P}. $$$ Let critical set $$$ Q $$$ of a GS r ( v ; k ) be the secret where $$$ 1\le o(Q)<{r}^2 $$$.…”

“…Here we show that the proposed secret sharing scheme is perfect. Following Chaudhry et al 3 and Song et al, 34 let 𝒫 = {P 1 , P 2 , … , P n } be a finite set of participants and Γ = {A 1 , A 2 , … , A t } be an access structure over 𝒫 , that is, each A i (1 ≤ i ≤ t) is a subset of 𝒫 . Let critical set Q of a GS r (v; k) be the secret where 1 ≤ o(Q) < r 2 .…”