Quantum Secret Sharing with Classical and Quantum Shares

• URL: http://arxiv.org/abs/2507.17364v1
• Date: Wed, 23 Jul 2025 09:55:33 GMT
• Title: Quantum Secret Sharing with Classical and Quantum Shares
• Authors: Hua Sun,
• Abstract summary: In quantum secret sharing, a quantum secret state is mapped to multiple shares such that shares from qualified sets can recover the secret state.<n>We show that the quantum secret sharing problem with both classical and quantum shares is feasible if and only if any two qualified sets have some quantum share in common.
• Score: 38.352346029258385
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In quantum secret sharing, a quantum secret state is mapped to multiple shares such that shares from qualified sets can recover the secret state and shares from other forbidden sets reveal nothing about the secret state; we study the setting where there are both classical shares and quantum shares. We show that the quantum secret sharing problem with both classical and quantum shares is feasible if and only if any two qualified sets have some quantum share in common. Next, for threshold quantum secret sharing where there are $N_1$ classical shares, $N_2$ quantum shares and qualified sets consist of any $K_1$ (or more) classical shares and any $K_2 > N_2/2$ (or more) quantum shares, we show that to share $1$ qubit secret, each classical share needs to be at least $2$ bits and each quantum share needs to be at least $1$ qubit. Finally, we characterize the minimum share sizes for quantum secret sharing with at most $2$ classical shares and at most $2$ quantum shares. The converse proofs rely on quantum information inequalities and the achievable schemes use classical secret sharing, (encrypted) quantum secret sharing with only quantum shares, superdense coding, treating quantum digits as classical digits, and their various combinations.

Related papers

• Quantum ($t$,$n$) Threshold Multi-Secret Sharing based on Cluster States [1.2932412290302255]
  The first quantum ($t,n$) threshold multi-secret sharing protocol based on Lagrangian and cluster states is proposed.<n>The protocol exploits the security properties of the cluster state to transmit shared information in two parts, quantum and classical.<n>It is proven to be theoretically secure against external and internal attacks by analyzing the protocol.
  arXiv  Detail & Related papers  (2025-05-14T12:14:16Z)
• Quantum function secret sharing [0.7698425352464362]
  In this primitive, a classical dealer distributes a secret quantum circuit $C$ by providing shares to $p$ quantum parties.<n>The parties on an input state $|psirangle$ and a projection $Pi$, compute values $y_i$ that they then classically communicate back to the dealer.<n>We show that our scheme is only secure against single adversaries, and we show that if two parties collude, then they can break its security.
  arXiv  Detail & Related papers  (2025-01-31T07:16:54Z)
• A Quantum-Classical Collaborative Training Architecture Based on Quantum State Fidelity [50.387179833629254]
  We introduce a collaborative classical-quantum architecture called co-TenQu. Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting. It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
  arXiv  Detail & Related papers  (2024-02-23T14:09:41Z)
• Simple Tests of Quantumness Also Certify Qubits [69.96668065491183]
  A test of quantumness is a protocol that allows a classical verifier to certify (only) that a prover is not classical. We show that tests of quantumness that follow a certain template, which captures recent proposals such as (Kalai et al., 2022) can in fact do much more. Namely, the same protocols can be used for certifying a qubit, a building-block that stands at the heart of applications such as certifiable randomness and classical delegation of quantum computation.
  arXiv  Detail & Related papers  (2023-03-02T14:18:17Z)
• Advance sharing of quantum shares for quantum secrets [2.2843885788439793]
  Secret sharing is a cryptographic scheme to encode a secret to multiple shares being distributed to participants. We propose a quantum secret sharing scheme for quantum secrets that can distribute some shares before a given secret.
  arXiv  Detail & Related papers  (2023-02-28T09:51:57Z)
• Semiquantum secret sharing by using x-type states [4.397981844057195]
  A semiquantum secret sharing protocol based on x-type states is proposed. It can accomplish the goal that only when two classical communicants cooperate together can they extract the shared secret key of a quantum communicant. Detailed security analysis turns out that this protocol is completely robust against an eavesdropper.
  arXiv  Detail & Related papers  (2022-08-03T08:58:45Z)
• Advance sharing of quantum shares for classical secrets [2.2843885788439793]
  Secret sharing schemes for classical secrets can be classified into classical secret sharing schemes and quantum secret sharing schemes. We propose quantum secret sharing with the capabilities in designing of access structures more flexibly.
  arXiv  Detail & Related papers  (2022-08-03T05:25:19Z)
• Conference key agreement in a quantum network [67.410870290301]
  Quantum conference key agreement (QCKA) allows multiple users to establish a secure key from a shared multi-partite entangled state. In a quantum network, this protocol can be efficiently implemented using a single copy of a N-qubit Greenberger-Horne-Zeilinger (GHZ) state to distil a secure N-user conference key bit.
  arXiv  Detail & Related papers  (2022-07-04T18:00:07Z)
• 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)
• Secure Two-Party Quantum Computation Over Classical Channels [63.97763079214294]
  We consider the setting where the two parties (a classical Alice and a quantum Bob) can communicate only via a classical channel. We show that it is in general impossible to realize a two-party quantum functionality with black-box simulation in the case of malicious quantum adversaries. We provide a compiler that takes as input a classical proof of quantum knowledge (PoQK) protocol for a QMA relation R and outputs a zero-knowledge PoQK for R that can be verified by classical parties.
  arXiv  Detail & Related papers  (2020-10-15T17:55:31Z)
• 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.