HOW TO SHARE A QUANTUM SECRET

@article{Cleve1999HOWTS,
  title={HOW TO SHARE A QUANTUM SECRET},
  author={R. Cleve and D. Gottesman and H. Lo},
  journal={Physical Review Letters},
  year={1999},
  volume={83},
  pages={648-651}
}
  • R. Cleve, D. Gottesman, H. Lo
  • Published 1999
  • Physics
  • Physical Review Letters
  • We investigate the concept of quantum secret sharing. In a (k,thinspn) threshold scheme, a secret quantum state is divided into n shares such that any k of those shares can be used to reconstruct the secret, but any set of k{minus}1 or fewer shares contains absolutely no information about the secret. We show that the only constraint on the existence of threshold schemes comes from the quantum {open_quotes}no-cloning theorem,{close_quotes} which requires that n{lt}2k , and we give efficient… CONTINUE READING
    Quantum strongly secure ramp secret sharing
    9
    Verifiable quantum (k, n)-threshold secret sharing
    42
    Communication Efficient Quantum Secret Sharing
    3
    Quantum secret sharing based on local distinguishability
    48
    Rational Quantum Secret Sharing
    Universal Communication Efficient Quantum Threshold Secret Sharing Schemes
    Efficient Quantum Secret Sharing
    Theory of quantum secret sharing
    398

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 21 REFERENCES
    QUANTUM SECRET SHARING
    1965
    Mixed-state entanglement and quantum error correction.
    3188
    Class of quantum error-correcting codes saturating the quantum Hamming bound.
    783
    Fault-tolerant quantum computation with constant error
    512
    Perfect Quantum Error Correcting Code.
    568
    Quantum cryptography without Bell's theorem.
    1471
    Good quantum error-correcting codes exist.
    1452
    Theory of quantum error-correcting codes
    682
    Codes for the quantum erasure channel
    187