A Hybrid Quantum Secret Sharing Scheme based on Mutually Unbiased Bases

• URL: http://arxiv.org/abs/2006.12790v1
• Date: Tue, 23 Jun 2020 06:59:03 GMT
• Title: A Hybrid Quantum Secret Sharing Scheme based on Mutually Unbiased Bases
• Authors: Dan-Li Zhi, Zhu-Hui Li, Li-juan Liu, Zhao-Wei Han
• Abstract summary: 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.
• Score: 6.42717893572633
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: With the advantages of both classical and quantum secret sharing, many practical hybrid quantum secret sharing have been proposed. In this paper, we propose a hybrid quantum secret sharing scheme based on mutually unbiased bases and monotone span program. First, the dealer sends the shares in the linear secret sharing to the participants in the authorization set via a secure channel. Then, the dealer and participants perform unitary transformation on a d-dimensional quantum state sequentially, and the dealer publishes the measurement result confidentially to the participants in the authorization set to recover the secret. The verifiability of the scheme is guaranteed by the Hash function. Next, the correctness and security of the scheme are proved and our scheme is secure against the general eavesdropper attacks. Finally, a specific example is employed to further clarify the exibility of the scheme and the detailed comparison of similar quantum secret sharing schemes also shows the superiority of our proposed scheme.

Related papers

• Collaboration Encouraging Quantum Secret Sharing Scheme with Seal Property [0.069060054915724]
  A new concept of quantum secret sharing is introduced, in which collaboration among participants are encourage. The first one is unconditional secure and achieve the optimal bound of a seal scheme. The second one improve the optimal bound of seal by introducing post-quantum secure computational assumption.
  arXiv  Detail & Related papers  (2024-09-12T09:17:21Z)
• Advance Sharing Procedures for the Ramp Quantum Secret Sharing Schemes With the Highest Coding Rate [0.5439020425818999]
  We propose methods to distribute some shares before a secret is given in ramp quantum secret sharing schemes. We prove that our new encoding procedures retain the correspondences between quantum secrets and quantum shares in the original schemes.
  arXiv  Detail & Related papers  (2024-07-30T08:54:44Z)
• Advance Sharing with Ogawa et al.'s Ramp Quantum Secret Sharing Scheme [0.4604003661048266]
  We propose a method to distribute some shares before a secret is given in Ogawa et al.'s scheme. We then determine a necessary and sufficient condition on sets of shares that can be distributed before a given secret.
  arXiv  Detail & Related papers  (2024-04-24T04:58:31Z)
• Coding-Based Hybrid Post-Quantum Cryptosystem for Non-Uniform Information [53.85237314348328]
  We introduce for non-uniform messages a novel hybrid universal network coding cryptosystem (NU-HUNCC) We show that NU-HUNCC is information-theoretic individually secured against an eavesdropper with access to any subset of the links.
  arXiv  Detail & Related papers  (2024-02-13T12:12:39Z)
• 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)
• Quantum Secret Reconstruction [2.8233507229238177]
  This paper proposes the first quantum secret reconstruction protocol based on cluster states. It is shown that the proposed protocol is secure against several common attacks.
  arXiv  Detail & Related papers  (2023-06-15T05:24:29Z)
• 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)
• Unified Approach to Secret Sharing and Symmetric Private Information Retrieval with Colluding Servers in Quantum Systems [71.78056556634196]
  This paper unifiedly addresses two kinds of key quantum secure tasks, i.e., quantum versions of secret sharing (SS) and symmetric private information retrieval (SPIR) In particular, two kinds of quantum extensions of SS are known; One is the classical-quantum (CQ) setting, in which the secret to be sent is classical information and the shares are quantum systems. We newly introduce the third setting, i.e., the entanglement-assisted (EA) setting, which is defined by modifying the CQ setting with allowing prior entanglement between the dealer and the end-user who recovers the secret by
  arXiv  Detail & Related papers  (2022-05-29T10:28:04Z)
• 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)
• Single-Shot Secure Quantum Network Coding for General Multiple Unicast Network with Free One-Way Public Communication [56.678354403278206]
  We propose a canonical method to derive a secure quantum network code over a multiple unicast quantum network. Our code correctly transmits quantum states when there is no attack. It also guarantees the secrecy of the transmitted quantum state even with the existence of an attack.
  arXiv  Detail & Related papers  (2020-03-30T09:25:13Z)

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.