Related papers: Advance Sharing Procedures for the Ramp Quantum Secret Sharing Schemes With the Highest Coding Rate

Advance Sharing Procedures for the Ramp Quantum Secret Sharing Schemes With the Highest Coding Rate

URL: http://arxiv.org/abs/2407.20661v1
Date: Tue, 30 Jul 2024 08:54:44 GMT
Title: Advance Sharing Procedures for the Ramp Quantum Secret Sharing Schemes With the Highest Coding Rate
Authors: Ryutaroh Matsumoto,
Abstract summary: 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.
Score: 0.5439020425818999
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Abstract: In some quantum secret sharing schemes, it is known that some shares can be distributed to participants before a secret is given to the dealer. However, it is unclear whether some shares can be distributed before a secret is given in the ramp quantum secret sharing schemes with the highest coding rate. In this paper, we propose methods to distribute some shares before a secret is given in those schemes, then we prove that our new encoding procedures retain the correspondences between quantum secrets and quantum shares in the original schemes.

Related papers

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)
Near-Term Distributed Quantum Computation using Mean-Field Corrections and Auxiliary Qubits [77.04894470683776]
We propose near-term distributed quantum computing that involve limited information transfer and conservative entanglement production. We build upon these concepts to produce an approximate circuit-cutting technique for the fragmented pre-training of variational quantum algorithms.
arXiv Detail & Related papers (2023-09-11T18:00:00Z)
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)
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)
ByzSecAgg: A Byzantine-Resistant Secure Aggregation Scheme for Federated Learning Based on Coded Computing and Vector Commitment [90.60126724503662]
ByzSecAgg is an efficient secure aggregation scheme for federated learning. ByzSecAgg is protected against Byzantine attacks and privacy leakages.
arXiv Detail & Related papers (2023-02-20T11:15:18Z)
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)
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)
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)
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)
Backflash Light as a Security Vulnerability in Quantum Key Distribution Systems [77.34726150561087]
We review the security vulnerabilities of quantum key distribution (QKD) systems. We mainly focus on a particular effect known as backflash light, which can be a source of eavesdropping attacks.
arXiv Detail & Related papers (2020-03-23T18:23:12Z)

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