Quantum multi-secret sharing via trap codes and discrete quantum walks

Chaudhury, Shion Samadder; Dutta, Sabyasachi

doi:10.1007/s11128-022-03732-1

Cited by 2 publications

(5 citation statements)

References 56 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Our protocol is simpler and more practical than the existing QMSS protocol, such as Ref. [28]. By comparison, we can find that the experimental implementation of Ref.…”

Section: Application: Quantum Multiple Secrets Sharingmentioning

confidence: 95%

“…By comparison, we can find that the experimental implementation of Ref. [28] is relatively challenging, as it requires the use of trap codes and discrete quantum walk, which are more complicated technologies than cluster states. Specifically, cluster states can be constructed by simply performing controlled‐Z operations CZ among

|+\rangle

states.…”

Section: Application: Quantum Multiple Secrets Sharingmentioning

confidence: 99%

“…In contrast, quantum walk requires a variety of complex quantum circuit techniques such as Quantum Coin Flip gates, Conditional Shift gates, Arc‐Reversal gates and the Fourier coin gates or Grover coin gates that are mentioned in Ref. [28]. At present, these quantum gates cannot be simply simulated at the quantum circuit due to their complexity.…”

Section: Application: Quantum Multiple Secrets Sharingmentioning

confidence: 99%

“…At present, these quantum gates cannot be simply simulated at the quantum circuit due to their complexity. In addition, the QMSS scheme [ 28 ] requires trap codes, while the proposed protocol does not require a coding scheme. Overall, although the authors [ 28 ] provide mathematical descriptions and security analysis of the protocol, there is a lack of actual experimental data to prove its feasibility.…”

Section: Application: Quantum Multiple Secrets Sharingmentioning

confidence: 99%

“…In addition, the QMSS scheme [ 28 ] requires trap codes, while the proposed protocol does not require a coding scheme. Overall, although the authors [ 28 ] provide mathematical descriptions and security analysis of the protocol, there is a lack of actual experimental data to prove its feasibility. Our protocol based on cluster states obviously has more feasibility and already been experimentally demonstrated.…”

Section: Application: Quantum Multiple Secrets Sharingmentioning

confidence: 99%

See 4 more Smart Citations

Quantum Secret Reconstruction

Ma,

Gao,

Cai

et al. 2023

Adv Quantum Tech

View full text Add to dashboard Cite

In addition to secret splitting, secret reconstruction is another important component of secret sharing. In this paper, the first quantum secret reconstruction protocol is proposed to protect the reconstruction process. Before the protocol, a classical secret is divided into multiple shares that are distributed to the shareholds, respectively. In the presented protocol, the dealer utilizes the secret to encrypt a privacy quantum state, and sends the encrypted state to a combiner who is chosen by the dealer within the shareholders. With the help of other shareholders, the combiner utilizes the properties of cluster states to recover the privacy quantum state. It is shown that the proposed protocol is secure against several common attacks, including external and internal attacks. Compared with classical secret reconstruction protocols, this protocol not only achieves information‐theoretic security of all shares, but is also more efficient due to the reduced distribution and computation cost. To demonstrate the feasibility of the protocol, a corresponding simulation quantum experiment is conducted on the IBM Q. Furthermore, in conjunction with quantum fingerprinting, it can be directly applied to achieve the task of quantum multiple secrets sharing, since the classical shares can be reused in the proposed protocol.

show abstract

“…Our protocol is simpler and more practical than the existing QMSS protocol, such as Ref. [28]. By comparison, we can find that the experimental implementation of Ref.…”

Section: Application: Quantum Multiple Secrets Sharingmentioning

confidence: 95%