Advance Sharing with Ogawa et al.'s Ramp Quantum Secret Sharing Scheme

• URL: http://arxiv.org/abs/2404.15646v1
• Date: Wed, 24 Apr 2024 04:58:31 GMT
• Title: Advance Sharing with Ogawa et al.'s Ramp Quantum Secret Sharing Scheme
• Authors: Satoshi Masumori, Ryutaroh Matsumoto,
• Abstract summary: 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.
• Score: 0.4604003661048266
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The ramp quantum secret sharing proposed by Ogawa et al. has the highest possible coding rate given a threshold type access structure. On the other hand, 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 Ogawa et al.'s scheme. In this paper, we propose a method to distribute some shares before a secret is given in Ogawa et al.'s scheme, then determine a necessary and sufficient condition on sets of shares that can be distributed 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)
• The Latency Price of Threshold Cryptosystem in Blockchains [52.359230560289745]
  We study the interplay between threshold cryptography and a class of blockchains that use Byzantine-fault tolerant (BFT) consensus protocols. Existing approaches for threshold cryptosystems introduce a latency overhead of at least one message delay for running the threshold cryptographic protocol. We propose a mechanism to eliminate this overhead for blockchain-native threshold cryptosystems with tight thresholds.
  arXiv  Detail & Related papers  (2024-07-16T20:53:04Z)
• Secret Sharing with Certified Deletion [4.082216579462796]
  Secret sharing allows a user to split a secret into many shares so that the secret can be recovered if, and only if, an authorized set of shares is collected. In secret sharing with certified deletion, a (classical) secret is split into quantum shares which can be verifiably destroyed. We show how to construct (i) a secret sharing scheme with no-signaling certified deletion for any monotone access structure, and (ii) a threshold secret sharing scheme with adaptive certified deletion.
  arXiv  Detail & Related papers  (2024-05-13T19:01:08Z)
• A Construction of Evolving $k$-threshold Secret Sharing Scheme over A Polynomial Ring [55.17220687298207]
  The threshold secret sharing scheme allows the dealer to distribute the share to every participant that the secret is correctly recovered from a certain amount of shares. We propose a brand-new construction of evolving $k$-threshold secret sharing scheme for an $ell$-bit secret over a ring, with correctness and perfect security.
  arXiv  Detail & Related papers  (2024-02-02T05:04:01Z)
• 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)
• Hiding Images in Deep Probabilistic Models [58.23127414572098]
  We describe a different computational framework to hide images in deep probabilistic models. Specifically, we use a DNN to model the probability density of cover images, and hide a secret image in one particular location of the learned distribution. We demonstrate the feasibility of our SinGAN approach in terms of extraction accuracy and model security.
  arXiv  Detail & Related papers  (2022-10-05T13:33:25Z)
• 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)
• Geometry of Banach spaces: a new route towards Position Based Cryptography [65.51757376525798]
  We study Position Based Quantum Cryptography (PBQC) from the perspective of geometric functional analysis and its connections with quantum games. The main question we are interested in asks for the optimal amount of entanglement that a coalition of attackers have to share in order to compromise the security of any PBQC protocol. We show that the understanding of the type properties of some more involved Banach spaces would allow to drop out the assumptions and lead to unconditional lower bounds on the resources used to attack our protocol.
  arXiv  Detail & Related papers  (2021-03-30T13:55:11Z)
• 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)

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.