Related papers: Advance sharing of quantum shares for classical secrets

Advance sharing of quantum shares for classical secrets

URL: http://arxiv.org/abs/2208.01847v2
Date: Sat, 17 Sep 2022 09:06:29 GMT
Title: Advance sharing of quantum shares for classical secrets
Authors: Rina Miyajima, Ryutaroh Matsumoto
Abstract summary: 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.
Score: 2.2843885788439793
License: http://creativecommons.org/licenses/by/4.0/
Abstract: Secret sharing schemes for classical secrets can be classified into classical secret sharing schemes and quantum secret sharing schemes. Classical secret sharing has been known to be able to distribute some shares before a given secret. On the other hand, quantum mechanics extends the capabilities of secret sharing beyond those of classical secret sharing. We propose quantum secret sharing with the capabilities in designing of access structures more flexibly and realizing higher efficiency beyond those of classical secret sharing, that can distribute some shares before a given secret.

Related papers

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)
Unclonable Secret Sharing [18.564937506648622]
Unclonable cryptography utilizes the principles of quantum mechanics to addresses cryptographic tasks that are impossible classically. We introduce a novel unclonable primitive in the context of secret sharing, called unclonable secret sharing (USS)
arXiv Detail & Related papers (2024-06-16T16:50:15Z)
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)
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)
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)
The Computational and Latency Advantage of Quantum Communication Networks [70.01340727637825]
This article summarises the current status of classical communication networks. It identifies some critical open research challenges that can only be solved by leveraging quantum technologies.
arXiv Detail & Related papers (2021-06-07T06:31:02Z)
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)
Quantum noise protects quantum classifiers against adversaries [120.08771960032033]
Noise in quantum information processing is often viewed as a disruptive and difficult-to-avoid feature, especially in near-term quantum technologies. We show that by taking advantage of depolarisation noise in quantum circuits for classification, a robustness bound against adversaries can be derived. This is the first quantum protocol that can be used against the most general adversaries.
arXiv Detail & Related papers (2020-03-20T17:56:14Z)

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