Related papers: Advance sharing for stabilizer-based quantum secret sharing schemes

Advance sharing for stabilizer-based quantum secret sharing schemes

URL: http://arxiv.org/abs/2502.06247v1
Date: Mon, 10 Feb 2025 08:24:36 GMT
Title: Advance sharing for stabilizer-based quantum secret sharing schemes
Authors: Mamoru Shibata,
Abstract summary: In stabilizer-based quantum secret sharing schemes, some shares can be distributed to participants before a secret is given to the dealer. It is already known that a set of shares is advance shareable only if it is a forbidden set. We propose a quantum secret sharing scheme for quantum secrets such that any forbidden set is advance shareable.
Score: 0.0
License:
Abstract: In stabilizer-based quantum secret sharing schemes, it is known that some shares can be distributed to participants before a secret is given to the dealer. This distribution is known as advance sharing. It is already known that a set of shares is advance shareable only if it is a forbidden set. However, it was not known whether any forbidden set is advance shareable. We provide an example of a set of shares such that it is a forbidden set but is not advance shareable in the previous scheme. Furthermore, we propose a quantum secret sharing scheme for quantum secrets such that any forbidden set is advance shareable.

Related papers

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. We propose procedures to distribute some shares before a secret is given in those 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)
An Improved Quantum Private Set Intersection Protocol Based on Hadamard Gates [22.0983572289132]
We find the participant can deduce the other party's private information, which violates the security requirement of private set computation. In order to solve this problem, an improved private set intersection protocol based on Hadamard gate is proposed.
arXiv Detail & Related papers (2023-10-01T16:21:44Z)
Private Product Computation using Quantum Entanglement [41.129633382222366]
We show that a pair of entangled qubits can be used to compute a product privately. We give a concrete way to realize this product for arbitrary finite fields of prime order.
arXiv Detail & Related papers (2023-05-10T09:01:38Z)
Neural Auctions Compromise Bidder Information [43.82512707595423]
Single-shot auctions are commonly used as a means to sell goods, for example when selling ad space or allocating radio frequencies. It has been shown that neural networks can be used to approximate optimal mechanisms while satisfying the constraints that an auction be strategyproof and individually rational. We show that despite such auctions maximizing revenue, they do so at the cost of revealing private bidder information.
arXiv Detail & Related papers (2023-02-28T22:36:00Z)
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)
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)
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)

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