Advance Sharing Procedures for the Ramp Quantum Secret Sharing Schemes With the Highest Coding Rate
arXiv:2407.20661 · doi:10.1109/TQE.2025.3530939
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 procedures to distribute some shares before a secret is given in those schemes. The new procedures enhances applicability of the secret sharing schemes to wider scenarios as some participants can be unavailable when the dealer obtains the quantum secret. Then we prove that our new encoding procedures retain the correspondences between quantum secrets and quantum shares in the original schemes, which ensures the highest coding rates of the original schemes are also retained.
arXiv commentieeeaccess.cls, 7 pages, no figure. Version 2 is the accepted-version by IEEE Transactions on Quantum Engineering. This is a full journal paper version of the previous conference paper arXiv:2404.15646. The difference to arXiv:2404.15646 is clearly indicated in the introduction
References in corpus (12)
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- Quantum secret sharing
- How to share a quantum secret
- On the Theory of Quantum Secret Sharing
- The Evolution of Quantum Secure Direct Communication: On the Road to the Qinternet
- Secure Multiparty Quantum Computation with (Only) a Strict Honest Majority
- Secret Sharing for Cloud Data Security
- Quantum Secret Sharing Schemes and Reversibility of Quantum Operations
- Randomness cost of masking quantum information and the information conservation law
- Quantum Strongly Secure Ramp Secret Sharing
- Advance sharing of quantum shares for classical secrets
- Advance sharing of quantum shares for quantum secrets