Quantum Anonymous Secret Sharing with Permutation Invariant Codes

• URL: http://arxiv.org/abs/2604.27284v1
• Date: Thu, 30 Apr 2026 00:33:20 GMT
• Title: Quantum Anonymous Secret Sharing with Permutation Invariant Codes
• Abstract summary: We describe a protocol that enables sender-anonymity during the secret decoding process.<n>We quantify information leakage in ramp quantum secret sharing schemes via the quantum conditional min-entropy.<n>We evaluate several permutation-invariant codes using this measure to make observations on the information leakage of intermediate shares for each quantum anonymous secret sharing scheme.
• Score: 1.9116784879310027
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum secret sharing schemes are a family of quantum cryptographic protocols which provide secure quantum encodings, mapping one secret to multiple shares of information such that the original secret cannot be accessed without an authorized set of shares present for decoding. In this work, we describe a protocol that enables sender-anonymity during the secret decoding process. By using permutation-invariant QEC codes along with a set of anonymous quantum transmission algorithms, we construct a quantum anonymous secret sharing scheme that achieves sender-anonymity. We quantify information leakage in ramp quantum secret sharing schemes via the quantum conditional min-entropy, justifying it as a valid measure of leaked information by relating it to the Knill-Laflamme quantum error correction conditions. Finally, we evaluate several permutation-invariant codes using this measure to make observations on the information leakage of intermediate shares for each quantum anonymous secret sharing scheme.

Related papers

• Practical quantum tokens: challenges and perspectives [49.583101345036624]
  The concept of quantum tokens dates back alongside quantum cryptography to Stephen Wiesner's seminal work in 1983.<n>We discuss the current state-of-the-art of quantum tokens in the field of quantum information, as well as their future perspectives.
  arXiv  Detail & Related papers  (2026-02-11T08:11:36Z)
• Quantum ramp secret sharing from Haar scrambling [0.0]
  Quantum information scrambling is a powerful tool for studying the dynamics of chaotic quantum many-body benchmarking systems.<n>We show that two protocols, Haar scrambling and quantum secret sharing, are indeed equivalent.<n>We explore potential applications, ranging from security implications for distributed quantum networks to cryptography in the Noisy Intermediate-Scale Quantum (NISQ) era.
  arXiv  Detail & Related papers  (2025-11-30T16:40:25Z)
• Quantum Secret Sharing with Classical and Quantum Shares [38.352346029258385]
  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.
  arXiv  Detail & Related papers  (2025-07-23T09:55:33Z)
• 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)
• 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.<n>Without the information of other participants, the secret in Song em et al.'sprotocol cannot be reconstructed.<n>We address a protocol that solves this issue in this paper.
  arXiv  Detail & Related papers  (2025-01-16T14:21:24Z)
• Advance Sharing Procedures for the Ramp Quantum Secret Sharing Schemes With the Highest Coding Rate [0.5439020425818999]
  In some quantum secret sharing schemes, some shares can be distributed to participants before a secret is given to the dealer.<n>We propose procedures to distribute some shares before a secret is given in those schemes.
  arXiv  Detail & Related papers  (2024-07-30T08:54:44Z)
• 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)
• Approximate reconstructability of quantum states and noisy quantum secret sharing schemes [19.170626575317907]
  We analyse approximate quantum secret sharing in a formal cryptographic setting. In particular, we show that approximate reconstructability of the quantum secret by these players is possible if and only if the information leakage is small.
  arXiv  Detail & Related papers  (2023-02-06T00:32:01Z)
• Gaussian conversion protocol for heralded generation of qunaught states [66.81715281131143]
  bosonic codes map qubit-type quantum information onto the larger bosonic Hilbert space. We convert between two instances of these codes GKP qunaught states and four-foldsymmetric binomial states corresponding to a zero-logical encoded qubit. We obtain GKP qunaught states with a fidelity of over 98% and a probability of approximately 3.14%.
  arXiv  Detail & Related papers  (2023-01-24T14:17:07Z)
• Coherence requirements for quantum communication from hybrid circuit dynamics [29.004178992441336]
  coherent superposition of quantum states is an important resource for quantum information processing. We determine the coherence requirements to communicate quantum information in a broad setting encompassing monitored quantum dynamics and quantum error correction codes.
  arXiv  Detail & Related papers  (2022-10-20T19:28:32Z)
• 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 information spreading in a disordered quantum walk [50.591267188664666]
  We design a quantum probing protocol using Quantum Walks to investigate the Quantum Information spreading pattern. We focus on the coherent static and dynamic disorder to investigate anomalous and classical transport. Our results show that a Quantum Walk can be considered as a readout device of information about defects and perturbations occurring in complex networks.
  arXiv  Detail & Related papers  (2020-10-20T20:03:19Z)
• 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.