Skip to main content
SpringerLink
Log in

Sharing a quantum secret without a trusted party

  • Published:
Quantum Information Processing Aims and scope Submit manuscript

Abstract

In a conventional quantum (k, n) threshold scheme, a trusted party shares a secret quantum state with n participants such that any k of those participants can cooperate to recover the original secret, while fewer than k participants obtain no information about the secret. In this paper we show how to construct a quantum (k, n) threshold scheme without the assistance of a trusted party, who generates and distributes shares among the participants. Instead, each participant chooses his private state and contributes the same to the determination of the final secret quantum state.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Blakley, G.R.: Safeguarding cryptographic keys. In: Proceedings of National Computer Conference, pp. 313–317. AFIPS, New York (1979)

  2. Shamir A.: How to share a secret. Commun. ACM 22, 612–613 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  3. Ingemarsson, I., Simmons, G.J.: A protocol to set up shared secret schemes without the assistance of a mutually trusted party. In: Advances in Cryptology—Proceedings of Eurocrypt’90, pp. 266–282. Springer, Berlin (1991)

  4. Pedersen, T.P.: A threshold cryptosystem without a trusted party. In: Advances in Cryptology— Proceedings of Eurocrypt’91, pp. 522–526. Springer, Berlin (1991)

  5. Jackson, W.-A., Martin, K.M., O’Keefe, C.M.: Efficient secret sharing without a mutually trusted authority. In: Advances in Cryptology—Proceedings of Eurocrypt’95, pp. 183-193. Springer, Berlin (1995)

  6. Hillery M., Bǔzek V., Berthiaume A.: Quantum secret sharing. Phys. Rev. A 59, 1829–1834 (1999)

    Article  CAS  MathSciNet  ADS  Google Scholar 

  7. Karlsson A., Koashi M., Imoto N.: Quantum entanglement for secret sharing and secret splitting. Phys. Rev. A 59, 162–168 (1999)

    Article  CAS  ADS  Google Scholar 

  8. Cleve R., Gottesman D., Lo H.-K.: How to share a quantum secret. Phys. Rev. Lett. 83, 648–651 (1999)

    Article  CAS  ADS  Google Scholar 

  9. Gottesman D.: Theory of quantum secret sharing. Phys. Rev. A 61, 042311 (2000)

    Article  MathSciNet  ADS  Google Scholar 

  10. Bandyopadhyay S.: Teleportation and secret sharing with pure entangled states. Phys. Rev. A 62, 012308 (2000)

    Article  MathSciNet  ADS  Google Scholar 

  11. Nascimento A.C.A., Mueller-Quade J., Imai H.: Improving quantum secret-sharing schemes. Phys. Rev. A 64, 042311 (2001)

    Article  ADS  CAS  Google Scholar 

  12. Guo G.P., Guo G.C.: Quantum secret sharing without entanglement. Phys. Lett. A 310, 247–251 (2003)

    Article  MATH  CAS  MathSciNet  ADS  Google Scholar 

  13. Lance A.M., Symul T., Bowen W.P., Sanders B.C., Lam P.K.: Tripartite quantum state sharing. Phys. Rev. Lett. 92, 177903 (2004)

    Article  ADS  PubMed  CAS  Google Scholar 

  14. Xiao L., Long G.L., Deng F.G., Pan J.W.: Efficient multiparty quantum-secret-sharing schemes. Phys. Rev. A 69, 052307 (2004)

    Article  ADS  CAS  Google Scholar 

  15. Tokunaga Y., Okamoto T., Imoto N.: Threshold quantum cryptography. Phys. Rev. A 71, 012314 (2005)

    Article  ADS  CAS  Google Scholar 

  16. Zhang Z.J., Li Y., Man Z.X.: Multiparty quantum secret sharing. Phys. Rev. A 71, 044301 (2005)

    Article  MathSciNet  ADS  CAS  Google Scholar 

  17. Deng F.G., Zhou H.Y., Long G.L.: Bidirectional quantum secret sharing and secret splitting with polarized single photons. Phys. Lett. A 337, 329–334 (2005)

    Article  MATH  CAS  ADS  Google Scholar 

  18. Takesue H., Inoue K.: Quantum secret sharing based on modulated high-dimensional time-bin entanglement. Phys. Rev. A 74, 012315 (2006)

    Article  ADS  CAS  Google Scholar 

  19. Zhang Z.J.: Multiparty secret sharing of quantum information via cavity QED. Opt. Comm. 261, 199–202 (2006)

    Article  CAS  ADS  Google Scholar 

  20. Yu I.C., Lin F.L., Huang C.Y.: Quantum secret sharing with multilevel mutually (un)biased bases. Phys. Rev. A 78, 012344 (2008)

    Article  ADS  CAS  Google Scholar 

  21. Wootters W.K., Zurek W.H.: A single quantum cannot be cloned. Nature 299, 802–803 (1982)

    Article  CAS  ADS  Google Scholar 

  22. Aigner M., Ziegler G.M.: Proofs from the book, pp. 7–10. Springer, Berlin (2006)

    MATH  Google Scholar 

  23. Crépeau, C., Gottesman, D., Smith, A.: Secure multi-party quantum computation. In: Proceedings of the 34th Annual ACM Symposium on Theory of Computing. pp. 643–652. ACM, New York (2002)

  24. Ben-Or, M., Crépeau, C., Gottesman, D., Hassidim, A., Smith, A.: Secure multiparty quantum computation with (only) a strict honest majority. In: Proceedings of 47th Annual IEEE Symposium on the Foundations of Computer Science, pp. 249–260. IEEE, Los Alamitos (2006)

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Sun Yat-sen University, Guangzhou, 510006, China

    Qin Li, Dong Yang Long & Dao Wen Qiu

  2. Department of Mathematics, Hong Kong Baptist University, Kowloon, Hong Kong, China

    Qin Li & W. H. Chan

Authors
  1. Qin Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dong Yang Long
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. W. H. Chan
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Dao Wen Qiu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Qin Li.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Li, Q., Long, D.Y., Chan, W.H. et al. Sharing a quantum secret without a trusted party. Quantum Inf Process 10, 97–106 (2011). https://doi.org/10.1007/s11128-010-0180-3

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11128-010-0180-3

Keywords

Search

Navigation