Quantum multi-secret sharing scheme with access structures and cheat identification

• URL: http://arxiv.org/abs/2309.06458v2
• Date: Fri, 20 Oct 2023 06:30:02 GMT
• Title: Quantum multi-secret sharing scheme with access structures and cheat identification
• Authors: Deepa Rathi, Sanjeev Kumar
• Abstract summary: This work proposes a $d$-dimensional quantum multi-secret sharing scheme with a cheat detection mechanism. The dealer creates multiple secrets and distributes the shares of these secrets using multi-access structures and a monotone span program. The proposed protocol is reliable in preventing attacks from eavesdroppers and participants.
• Score: 3.0821115746307663
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: This work proposes a $d$-dimensional quantum multi-secret sharing scheme with a cheat detection mechanism. The dealer creates multiple secrets and distributes the shares of these secrets using multi-access structures and a monotone span program. The dealer detects the cheating of each participant using the Black box's cheat detection mechanism. To detect the participants' deceit, the dealer distributes secret shares' shadows derived from a randomly invertible matrix $X$ to the participants, stored in the black box. The Black box identifies the participant's deceitful behavior during the secret recovery phase. Only honest participants authenticated by the Black box acquire their secret shares to recover the multiple secrets. After the Black box cheating verification, the participants reconstruct the secrets by utilizing the unitary operations and quantum Fourier transform. The proposed protocol is reliable in preventing attacks from eavesdroppers and participants. The scheme's efficiency is demonstrated in different noise environments: dit-flip noise, $d$-phase-flip noise, and amplitude-damping noise, indicating its robustness in practical scenarios. The proposed protocol provides greater versatility, security, and practicality.

Related papers

• Optimal Computational Secret Sharing [51.599517747577266]
  In $(t, n)$-threshold secret sharing, a secret $S$ is distributed among $n$ participants. We present a construction achieving a share size of $tfrac|S|t + |K|t$.
  arXiv  Detail & Related papers  (2025-02-04T23:37:16Z)
• Threshold Quantum Secret Sharing [1.3597551064547502]
  A quantum secret sharing protocol with a $(t,n)$ threshold approach and modulo d was recently discussed by Song et al. Without the information of other participants, the secret in Song em et al.'sprotocol cannot be reconstructed. We address a protocol that solves this issue in this paper.
  arXiv  Detail & Related papers  (2025-01-16T14:21:24Z)
• Security and Fairness in Multi-Party Quantum Secret Sharing Protocol [0.0]
  Quantum secret sharing (QSS) is a cryptographic protocol that leverages quantum mechanics to distribute a secret among multiple parties. We introduce a new concept of QSS which leans on a generic distributed quantum-network, based on a threshold scheme. We show the effectiveness and performance of the proposed protocol by testing it against the main classical and quantum attacks.
  arXiv  Detail & Related papers  (2024-12-16T11:18:52Z)
• Experimental anonymous quantum conferencing [72.27323884094953]
  We experimentally implement the AQCKA task in a six-user quantum network using Greenberger-Horne-Zeilinger (GHZ)-state entanglement. We also demonstrate that the protocol retains an advantage in a four-user scenario with finite key effects taken into account.
  arXiv  Detail & Related papers  (2023-11-23T19:00:01Z)
• Efficient Quantum Secret Sharing Scheme Based On Monotone Span Program [4.228814879921276]
  The scheme is based on a monotone span program, and its access structure is more general than the access structure (t,n) threshold. Compared with other schemes, our proposed scheme is more efficient, less computational cost.
  arXiv  Detail & Related papers  (2023-03-01T04:30:59Z)
• Revocable Cryptography from Learning with Errors [61.470151825577034]
  We build on the no-cloning principle of quantum mechanics and design cryptographic schemes with key-revocation capabilities. We consider schemes where secret keys are represented as quantum states with the guarantee that, once the secret key is successfully revoked from a user, they no longer have the ability to perform the same functionality as before.
  arXiv  Detail & Related papers  (2023-02-28T18:58:11Z)
• Hiding Images in Deep Probabilistic Models [58.23127414572098]
  We describe a different computational framework to hide images in deep probabilistic models. Specifically, we use a DNN to model the probability density of cover images, and hide a secret image in one particular location of the learned distribution. We demonstrate the feasibility of our SinGAN approach in terms of extraction accuracy and model security.
  arXiv  Detail & Related papers  (2022-10-05T13:33:25Z)
• Efficient Bipartite Entanglement Detection Scheme with a Quantum Adversarial Solver [89.80359585967642]
  Proposal reformulates the bipartite entanglement detection as a two-player zero-sum game completed by parameterized quantum circuits. We experimentally implement our protocol on a linear optical network and exhibit its effectiveness to accomplish the bipartite entanglement detection for 5-qubit quantum pure states and 2-qubit quantum mixed states.
  arXiv  Detail & Related papers  (2022-03-15T09:46:45Z)
• Quantum Proofs of Deletion for Learning with Errors [91.3755431537592]
  We construct the first fully homomorphic encryption scheme with certified deletion. Our main technical ingredient is an interactive protocol by which a quantum prover can convince a classical verifier that a sample from the Learning with Errors distribution in the form of a quantum state was deleted.
  arXiv  Detail & Related papers  (2022-03-03T10:07:32Z)
• A novel three party Quantum secret sharing scheme based on Bell state sequential measurements with application in quantum image sharing [4.378411442784295]
  We present a quantum secret sharing scheme based on Bell state entanglement and sequential projection measurements. The protocol verifies the $n$ out of $n$ scheme and supports the aborting of the protocol in case all the parties do not divulge in their valid measurement outcomes.
  arXiv  Detail & Related papers  (2020-08-14T07:50:35Z)
• A Hybrid Quantum Secret Sharing Scheme based on Mutually Unbiased Bases [6.42717893572633]
  We propose a hybrid quantum secret sharing scheme based on mutually unbiased bases and monotone span program. The correctness and security of the scheme are proved and our scheme is secure against the general eavesdropper attacks.
  arXiv  Detail & Related papers  (2020-06-23T06:59:03Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.