The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
Theory of quantum secret sharing
Open accessAbstract
I present a variety of results on the theory of quantum secret sharing. I show that any mixed state quantum secret sharing scheme can be derived by discarding a share from a pure state scheme, and that the size of each share in a quantum secret sharing scheme must be at least as large as the size of the secret. I show that the only constraints on the existence of quantum secret sharing schemes with general access structures are monotonicity (if a set is authorized, so are larger sets) and the no-cloning theorem. I also discuss some aspects of sharing classical secrets using quantum states. In this situation, the size of each share can sometimes be half the size of the classical secret.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Shamir, A. (1979) · Communications of the ACM · doi:10.1145/359168.359176 · Cited by 13,756
The Theory of Error-Correcting Codes
(1977) · North-Holland Mathematical Library · doi:10.1016/s0924-6509(08)x7030-8 · Cited by 10,760
Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states
Bennett, C. H., & Wiesner, S. J. (1992) · Physical Review Letters · doi:10.1103/physrevlett.69.2881 · Cited by 5,470
A single quantum cannot be cloned
Wootters, W. K., & Zurek, W. H. (1982) · Nature · doi:10.1038/299802a0 · Cited by 5,406 · cited 1×
“As we shall see in section III, the only other constraint on quantum secret sharing schemes is the no-cloning theorem [9,10].”
BackgroundSafeguarding cryptographic keys
BLAKLEY, G. R. (1979) · 1979 International Workshop on Managing Requirements Knowledge (MARK) · doi:10.1109/mark.1979.8817296 · Cited by 3,499
Hillery, M., Bužek, V., & Berthiaume, A. (1999) · Physical Review A · doi:10.1103/physreva.59.1829 · Cited by 3,347
Good quantum error-correcting codes exist
Calderbank, A. R., & Shor, P. W. (1996) · Physical Review A · doi:10.1103/physreva.54.1098 · Cited by 2,516 · cited 1×
“There is a standard construction, known as the CSS construction [21,22], which takes two binary classical error-correcting codes and produces a quantum code.”
BackgroundGottesman, D., & Chuang, I. L. (1999) · Nature · doi:10.1038/46503 · Cited by 1,860
Self-citationWiesner, S. (1983) · ACM SIGACT News · doi:10.1145/1008908.1008920 · Cited by 1,520
Dieks, D. (1982) · Physics Letters A · doi:10.1016/0375-9601(82)90084-6 · Cited by 1,461
Cited by
Efficient multiparty quantum-secret-sharing schemes
Xiao, L., Lu Long, G., Deng, F.-G., & Pan, J.-W. (2004) · Physical Review A · doi:10.1103/physreva.69.052307 · Cited by 838
Deng, F.-G., Li, X.-H., Li, C.-Y., Zhou, P., & Zhou, H.-Y. (2005) · Physical Review A · doi:10.1103/physreva.72.044301 · Cited by 462
Graph states for quantum secret sharing
Markham, D., & Sanders, B. C. (2008) · Physical Review A · doi:10.1103/physreva.78.042309 · Cited by 451
Multiparty quantum secret sharing of classical messages based on entanglement swapping
Zhang, Z.-J., & Man, Z.-X. (2005) · Physical Review A · doi:10.1103/physreva.72.022303 · Cited by 416
Cryptanalysis of the Hillery-Bužek-Berthiaume quantum secret-sharing protocol
Qin, S.-J., Gao, F., Wen, Q.-Y., & Zhu, F.-C. (2007) · Physical Review A · doi:10.1103/physreva.76.062324 · Cited by 363
Metadata
- Authors
- Gottesman, D.
- Venue
- Physical Review A
- Publisher
- American Physical Society (APS)
- Published
- 2000-03-16
- Volume
- 61
- Issue
- 4
- ISSN
- 0556-2791 (ISSN-L)
- 1050-2947
- 1094-1622
- OpenAlex
- W1503645968
- Cited by
- 618
- References
- 24
- FWCI
- 7.08
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Theory of quantum secret sharing. https://app.cochat.ai/papers/10.1103/physreva.61.042311
- The paper
- Gottesman, D. (2000). Theory of quantum secret sharing. Physical Review A. https://doi.org/10.1103/physreva.61.042311
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.