Nothing Special   »   [go: up one dir, main page]
Skip to main content
Springer Nature Link
Log in

A resilient m-qubit quantum secret sharing scheme using quantum error correction code

  • Published:
Quantum Information Processing Aims and scope Submit manuscript

Abstract

Proposed by Hillery et al., Quantum Secret Sharing (QSS) is a technique used to break a quantum secret into multiple pieces (called Shares), such that any proper subset of the pieces does not reveal any information about the original secret. The secret can be reconstructed only when all of the pieces are combined together. However, most of the QSS protocols assume that the shares are untampered, hence fail to regenerate the original secret if some of the shares are damaged due to several reasons like cheating participants, eavesdropping, etc. In order to tackle this practical challenge, Resilient Quantum Secret Sharing (RQSS) protocols are required. In this paper, we propose an RQSS protocol that uses Quantum Error Correcting Codes (QECC) for share generation and secret reconstruction. Our protocol generates n shares of a m-qubit quantum secret, owned by the dealer, and distributes it among n participants; moreover, it can regenerate the original secret even if \(k < n\) shares are damaged. To the best of our knowledge, no such generalized protocol exists in the available literature.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

Data availability

Data sharing is not applicable to this article as no datasets were generated or analysed during the current study.

References

  1. Shamir, A.: How to share a secret. Commun. ACM 22, 612–613 (1979). https://doi.org/10.1145/359168.359176

    Article  MathSciNet  Google Scholar 

  2. Blakley, G.R.: Safeguarding cryptographic keys. Paper presented at the 1979 International Workshop on Managing Requirements Knowledge (MARK) (1979)

  3. Hillery, M., Buzek, V., Berthiaume, A.: Quantum secret sharing. Phys. Rev. A 59, 1829–1834 (1999). https://doi.org/10.1103/PhysRevA.59.1829

    Article  ADS  MathSciNet  CAS  Google Scholar 

  4. LaPierre, R.: Introduction to Quantum Computing. Springer, Switzerland (2021)

    Book  Google Scholar 

  5. Karlsson, A., Koashi, M., Imoto, N.: Quantum entanglement for secret sharing and secret splitting. Phys. Rev. A 59(162) (1999) https://doi.org/10.1103/PhysRevA.59.162

  6. Wang, M.M., Qu, Z.G., Gong, L.M.: Improved quantum secret sharing scheme based on ghz states. Int. J. Comput. Sci. Eng. 21, 355–363 (2020). https://doi.org/10.1504/IJCSE.2020.106060

    Article  Google Scholar 

  7. Han, L.F., Xu, H.F.: Probabilistic and controlled teleportation of an arbitrary two-qubit state via one dimensional five-qubit cluster-class state. Int. J. Theor. Phys. 51, 2540–2545 (2012). https://doi.org/10.1007/s10773-012-1133-7

    Article  Google Scholar 

  8. Nie, Y.Y., Sang, M.H., Li, Y.H., Liu, J.C.: Three-party quantum information splitting of an arbitrary two-qubit state by using six-qubit cluster state. Int. J. Theor. Phys. 50, 1367–1371 (2011). https://doi.org/10.1007/s10773-010-0645-2

    Article  MathSciNet  Google Scholar 

  9. Paul, N., Menon, J.V., Karumnchi, S., Muralidharan, S., Panigrahi, P.K.: Quantum tasks using six qubit cluster states. Quantum Inf Process 10, 619–632 (2011). https://doi.org/10.1007/s11128-010-0217-7

    Article  MathSciNet  Google Scholar 

  10. Zhang, Q.Y., Zhan, Y.B.: Quantum information splitting by using asymmetric multi-particle state. Int. J. Theor. Phys. 51, 3037–3044 (2012). https://doi.org/10.1007/s10773-012-1186-7

    Article  MathSciNet  Google Scholar 

  11. Liu, F., Qin, S.J., Wen, Q.Y.: A quantum secret-sharing protocol with fairness. Phys. Scr. 89(075104) (2014) https://doi.org/10.1088/0031-8949/89/7/075104

  12. Deng, F.G., Li, X.H., Li, C.Y., Zhou, P., Zhou, H.Y.: Multiparty quantum-state sharing of an arbitrary two-particle state with Einstein–Podolsky–Rosen pairs. Phys. Rev. A 72(044301) (2005) https://doi.org/10.1103/PhysRevA.72.044301

  13. Muralidharan, S., Jain, S., Panigrahi, P.K.: Splitting of quantum information using n-qubit linear cluster states. Opt. Commun. 284, 1082–1085 (2011). https://doi.org/10.1016/j.optcom.2010.10.026

    Article  ADS  CAS  Google Scholar 

  14. Tang, J., Ma, S.Y., Li, Q.: Probabilistic hierarchical quantum information splitting of arbitrary multi-qubit states. Entropy 24(1077) (2022). https://doi.org/10.3390/e24081077

  15. Tang, J., Ma, S., Li, Q.: Universal hierarchical quantum information splitting schemes of an arbitrary multi-qubit state. Int. J. Theor. Phys. 61(209) (2022). https://doi.org/10.1007/s10773-022-05180-0

  16. Yuan, L., Xiaoqi, X., Yu, Y., Shunru, J.: Symmetric controlled quantum secret sharing scheme via stabilizer codes. Paper presented at the 2014 2nd International Conference on Systems and Informatics (ICSAI 2014) (2014)

  17. Rong, Z.Z., Tao, L.W., Zu, L.C.: Quantum secret sharing based on quantum error-correcting codes. Chin. Phys. B 20(050309) (2011). https://doi.org/10.1088/1674-1056/20/5/050309

  18. Rietjens, K., Schoenmakers, B., Tuyls, P.: Quantum information theoretical analysis of various constructions for quantum secret sharing. Paper presented at the International Symposium on Information Theory, 2005. ISIT 2005 (2005)

  19. Maitra, A., Paul, G.: A resilient quantum secret sharing scheme. Int. J. Theor. Phys. 54, 398–408 (2015) https://doi.org/10.1007/s10773-014-2233-3

  20. Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information. Cambridge University Press, New York (2000)

    Google Scholar 

  21. Djordjevic, I.B.: Quantum Information Processing, Quantum Computing, and Quantum Error Correction: An Engineering Approach. Academic Press, Cambridge (2012)

    Google Scholar 

Download references

Author information

Author notes

  1. Sachi Gupta, Aman Sinha and Sumit Kumar Pandey have contributed equally to this work.

Authors and Affiliations

  1. Department of CSE, Indian Institute of Technology Jammu, Nagrota, Jammu, Jammu & Kashmir, 181221, India

    Sachi Gupta, Aman Sinha & Sumit Kumar Pandey

Authors
  1. Sachi Gupta
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Aman Sinha
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Sumit Kumar Pandey
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Sachi Gupta.

Ethics declarations

Conflict of interest

The authors have no competing interests to declare that are relevant to the content of this article.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Gupta, S., Sinha, A. & Pandey, S.K. A resilient m-qubit quantum secret sharing scheme using quantum error correction code. Quantum Inf Process 23, 58 (2024). https://doi.org/10.1007/s11128-024-04265-5

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s11128-024-04265-5

Keywords

Search

Navigation