Efficient Quantum Secret Sharing Scheme Based On Monotone Span Program
- URL: http://arxiv.org/abs/2303.00226v3
- Date: Tue, 21 Mar 2023 04:12:44 GMT
- Title: Efficient Quantum Secret Sharing Scheme Based On Monotone Span Program
- Authors: Shuangshuang Luo, Zhihui Li, Depeng Meng, Jiansheng Guo
- Abstract summary: The scheme is based on a monotone span program, and its access structure is more general than the access structure (t,n) threshold.
Compared with other schemes, our proposed scheme is more efficient, less computational cost.
- Score: 4.228814879921276
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: How to efficiently share secrets among multiple participants is a very
important problem in key management. In this paper, we propose a multi-secret
sharing scheme based on the GHZ state. First, the distributor uses monotone
span program to encode the secrets and generate the corresponding secret shares
to send to the participants. Then, each participant uses the generalized Pauli
operator to embed its own secret share into the transmitted particle. The
participant who wants to get the secrets can get multiple secrets at the same
time by performing a GHZ-state joint measurement. Futhermore, the scheme is
based on a monotone span program, and its access structure is more general than
the access structure (t,n) threshold. Compared with other schemes, our proposed
scheme is more efficient, less computational cost.
Related papers
- Optimal Computational Secret Sharing [51.599517747577266]
In $(t, n)$-threshold secret sharing, a secret $S$ is distributed among $n$ participants.
We present a construction achieving a share size of $tfrac|S|t + |K|t$.
arXiv Detail & Related papers (2025-02-04T23:37: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.
Without the information of other participants, the secret in Song em et al.'sprotocol cannot be reconstructed.
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.
We propose procedures to distribute some shares before a secret is given in those schemes.
arXiv Detail & Related papers (2024-07-30T08:54:44Z) - 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) - Experimental anonymous quantum conferencing [72.27323884094953]
We experimentally implement the AQCKA task in a six-user quantum network using Greenberger-Horne-Zeilinger (GHZ)-state entanglement.
We also demonstrate that the protocol retains an advantage in a four-user scenario with finite key effects taken into account.
arXiv Detail & Related papers (2023-11-23T19:00:01Z) - Quantum multi-secret sharing scheme with access structures and cheat
identification [3.0821115746307663]
This work proposes a $d$-dimensional quantum multi-secret sharing scheme with a cheat detection mechanism.
The dealer creates multiple secrets and distributes the shares of these secrets using multi-access structures and a monotone span program.
The proposed protocol is reliable in preventing attacks from eavesdroppers and participants.
arXiv Detail & Related papers (2023-09-12T16:15:49Z) - 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) - 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) - 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) - Experimental quantum conference key agreement [55.41644538483948]
Quantum networks will provide multi-node entanglement over long distances to enable secure communication on a global scale.
Here we demonstrate quantum conference key agreement, a quantum communication protocol that exploits multi-partite entanglement.
We distribute four-photon Greenberger-Horne-Zeilinger (GHZ) states generated by high-brightness, telecom photon-pair sources across up to 50 km of fibre.
arXiv Detail & Related papers (2020-02-04T19:00:31Z)
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.