{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,29]],"date-time":"2025-12-29T15:02:38Z","timestamp":1767020558151,"version":"3.48.0"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2025,11,24]],"date-time":"2025-11-24T00:00:00Z","timestamp":1763942400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,11,24]],"date-time":"2025-11-24T00:00:00Z","timestamp":1763942400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["No.1247011241"],"award-info":[{"award-number":["No.1247011241"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["No.1247011241"],"award-info":[{"award-number":["No.1247011241"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["No.1247011241"],"award-info":[{"award-number":["No.1247011241"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Quantum Inf Process"],"DOI":"10.1007\/s11128-025-05006-y","type":"journal-article","created":{"date-parts":[[2025,11,24]],"date-time":"2025-11-24T10:59:03Z","timestamp":1763981943000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A new and efficient fair quantum secret sharing scheme"],"prefix":"10.1007","volume":"24","author":[{"given":"Jiayu","family":"Gu","sequence":"first","affiliation":[]},{"given":"Fulin","family":"Li","sequence":"additional","affiliation":[]},{"given":"Shixin","family":"Zhu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,11,24]]},"reference":[{"issue":"11","key":"5006_CR1","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A Shamir","year":"1979","unstructured":"Shamir, A.: How to share a secret. Commun. ACM 22(11), 612\u2013613 (1979)","journal-title":"Commun. ACM"},{"issue":"9","key":"5006_CR2","doi-asserted-by":"publisher","first-page":"1893","DOI":"10.1109\/TC.2012.251","volume":"62","author":"L Harn","year":"2012","unstructured":"Harn, L.: Group authentication. IEEE Trans. Comput. 62(9), 1893\u20131898 (2012)","journal-title":"IEEE Trans. Comput."},{"key":"5006_CR3","doi-asserted-by":"crossref","unstructured":"Patel, K.: Secure multiparty computation using secret sharing. In: 2016 International Conference on Signal Processing, Communication, Power and Embedded System (SCOPES), IEEE, pp. 863\u2013866 (2016)","DOI":"10.1109\/SCOPES.2016.7955564"},{"issue":"2","key":"5006_CR4","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1109\/LCOMM.2018.2886016","volume":"23","author":"Y Kim","year":"2018","unstructured":"Kim, Y., Raman, R.K., Kim, Y.-S., Varshney, L.R., Shanbhag, N.R.: Efficient local secret sharing for distributed blockchain systems. IEEE Commun. Lett. 23(2), 282\u2013285 (2018)","journal-title":"IEEE Commun. Lett."},{"key":"5006_CR5","doi-asserted-by":"crossref","unstructured":"Shor, P.W.: Algorithms for quantum computation: discrete logarithms and factoring. In: Proceedings 35th Annual Symposium on Foundations of Computer Science, IEEE, pp. 124\u2013134 (1994)","DOI":"10.1109\/SFCS.1994.365700"},{"key":"5006_CR6","doi-asserted-by":"crossref","unstructured":"Grover, L.K.: A fast quantum mechanical algorithm for database search. In: Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, pp. 212\u2013219 (1996)","DOI":"10.1145\/237814.237866"},{"issue":"5410","key":"5006_CR7","doi-asserted-by":"publisher","first-page":"2050","DOI":"10.1126\/science.283.5410.2050","volume":"283","author":"H.-K Lo","year":"1999","unstructured":"Lo, H..-K., Chau, H..F.: Unconditional security of quantum key distribution over arbitrarily long distances. Science 283(5410), 2050\u20132056 (1999)","journal-title":"Science"},{"issue":"3","key":"5006_CR8","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1145\/382780.382781","volume":"48","author":"D Mayers","year":"2001","unstructured":"Mayers, D.: Unconditional security in quantum cryptography. J. ACM (JACM) 48(3), 351\u2013406 (2001)","journal-title":"J. ACM (JACM)"},{"issue":"3","key":"5006_CR9","doi-asserted-by":"publisher","first-page":"1829","DOI":"10.1103\/PhysRevA.59.1829","volume":"59","author":"M Hillery","year":"1999","unstructured":"Hillery, M., Bu\u017eek, V., Berthiaume, A.: Quantum secret sharing. Phys. Rev. A 59(3), 1829 (1999)","journal-title":"Phys. Rev. A"},{"issue":"3","key":"5006_CR10","doi-asserted-by":"publisher","first-page":"648","DOI":"10.1103\/PhysRevLett.83.648","volume":"83","author":"R Cleve","year":"1999","unstructured":"Cleve, R., Gottesman, D., Lo, H.-K.: How to share a quantum secret. Phys. Rev. Lett. 83(3), 648 (1999)","journal-title":"Phys. Rev. Lett."},{"key":"5006_CR11","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijleo.2022.169896","volume":"270","author":"S Mashhadi","year":"2022","unstructured":"Mashhadi, S.: Verifiable quantum secret sharing with multi access structures. Optik 270, 169896 (2022)","journal-title":"Optik"},{"key":"5006_CR12","doi-asserted-by":"crossref","unstructured":"Li, F., Chen, T., Li, M., Lin, C.: Efficient and verifiable general quantum secret sharing based on special entangled state. IEEE Internet Things J. (2023)","DOI":"10.1109\/JIOT.2023.3339715"},{"issue":"7","key":"5006_CR13","doi-asserted-by":"publisher","DOI":"10.1088\/0031-8949\/89\/7\/075104","volume":"89","author":"F Liu","year":"2014","unstructured":"Liu, F., Qin, S.-J., Wen, Q.-Y.: A quantum secret-sharing protocol with fairness. Phys. Scr. 89(7), 075104 (2014)","journal-title":"Phys. Scr."},{"key":"5006_CR14","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2021.126673","volume":"589","author":"C-M Bai","year":"2022","unstructured":"Bai, C.-M., Zhang, S., Liu, L.: Fair quantum secret sharing based on symmetric bivariate polynomial. Physica A 589, 126673 (2022)","journal-title":"Physica A"},{"issue":"6","key":"5006_CR15","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/s10773-023-05383-z","volume":"62","author":"F Li","year":"2023","unstructured":"Li, F., Chen, T., Zhu, S.: A (t, n) threshold quantum secret sharing scheme with fairness. Int. J. Theor. Phys. 62(6), 119 (2023)","journal-title":"Int. J. Theor. Phys."},{"issue":"4","key":"5006_CR16","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/s11128-019-2233-6","volume":"18","author":"S Mashhadi","year":"2019","unstructured":"Mashhadi, S.: General secret sharing based on quantum Fourier transform. Quantum Inf. Process. 18(4), 114 (2019)","journal-title":"Quantum Inf. Process."},{"key":"5006_CR17","doi-asserted-by":"crossref","unstructured":"Zhi, D.-L., Li, Z.-H., Liu, L.-J., Han, Z.-W.: A hybrid quantum secret sharing scheme based on mutually unbiased bases. In: Frontiers in Cyber Security: Third International Conference, FCS 2020, Tianjin, China, November 15\u201317, 2020, Proceedings 3, Springer, pp. 595\u2013607 (2020)","DOI":"10.1007\/978-981-15-9739-8_44"},{"issue":"5","key":"5006_CR18","doi-asserted-by":"publisher","first-page":"827","DOI":"10.3390\/e25050827","volume":"25","author":"D Meng","year":"2023","unstructured":"Meng, D., Li, Z., Luo, S., Han, Z.: A kind of ($$t, n$$) threshold quantum secret sharing with identity authentication. Entropy 25(5), 827 (2023)","journal-title":"Entropy"},{"issue":"10","key":"5006_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11128-024-04532-5","volume":"23","author":"P Mawlia","year":"2024","unstructured":"Mawlia, P., Siwach, V., Bijaranian, P., Singh, D.: Quantum secret sharing with ($$m, n$$) threshold: Qft and identity authentication. Quantum Inf. Process. 23(10), 1\u201320 (2024)","journal-title":"Quantum Inf. Process."},{"issue":"10","key":"5006_CR20","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1007\/s11128-024-04535-2","volume":"23","author":"D Rathi","year":"2024","unstructured":"Rathi, D., Kumar, S.: Verifiable dynamic quantum secret sharing based on generalized Hadamard gate. Quantum Inf. Process. 23(10), 328 (2024)","journal-title":"Quantum Inf. Process."},{"key":"5006_CR21","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48969-X_8","volume-title":"The State of Cryptographic Hash Functions","author":"B Preneel","year":"1999","unstructured":"Preneel, B.: The State of Cryptographic Hash Functions. Springer, Berlin (1999)"},{"issue":"5","key":"5006_CR22","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1016\/j.ipl.2016.01.005","volume":"116","author":"H Qin","year":"2016","unstructured":"Qin, H., Dai, Y.: Verifiable ($$t, n$$) threshold quantum secret sharing using d-dimensional bell state. Inf. Process. Lett. 116(5), 351\u2013355 (2016)","journal-title":"Inf. Process. Lett."},{"key":"5006_CR23","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2022.128122","volume":"606","author":"F Li","year":"2022","unstructured":"Li, F., Chen, T., Zhu, S.: Dynamic ($$t, n$$) threshold quantum secret sharing based on d-dimensional bell state. Physica A 606, 128122 (2022)","journal-title":"Physica A"},{"issue":"12","key":"5006_CR24","doi-asserted-by":"publisher","DOI":"10.1088\/1555-6611\/ad04c2","volume":"33","author":"F Guan","year":"2023","unstructured":"Guan, F., Guo, J., Li, L.: A verifiable ($$t, n$$) threshold quantum secret sharing scheme based on asymmetric binary polynomial. Laser Phys. 33(12), 125202 (2023)","journal-title":"Laser Phys."},{"issue":"1","key":"5006_CR25","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/s11128-019-2509-x","volume":"19","author":"C Lu","year":"2020","unstructured":"Lu, C., Miao, F., Hou, J., Huang, W., Xiong, Y.: A verifiable framework of entanglement-free quantum secret sharing with information-theoretical security. Quantum Inf. Process. 19(1), 24 (2020)","journal-title":"Quantum Inf. Process."},{"issue":"3","key":"5006_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/JSTQE.2020.2975600","volume":"26","author":"H Qin","year":"2020","unstructured":"Qin, H., Tang, W.K., Tso, R.: Hierarchical quantum secret sharing based on special high-dimensional entangled state. IEEE J. Sel. Top. Quantum Electron. 26(3), 1\u20136 (2020)","journal-title":"IEEE J. Sel. Top. Quantum Electron."},{"key":"5006_CR27","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2023.128494","volume":"612","author":"F Li","year":"2023","unstructured":"Li, F., Luo, M., Zhu, H., Zhu, S., Pang, B.: A ($$w, t, n$$)-weighted threshold dynamic quantum secret sharing scheme with cheating identification. Physica A 612, 128494 (2023)","journal-title":"Physica A"},{"issue":"3","key":"5006_CR28","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/BF02252871","volume":"1","author":"M Tompa","year":"1989","unstructured":"Tompa, M., Woll, H.: How to share a secret with cheaters. J. Cryptol. 1(3), 133\u2013138 (1989)","journal-title":"J. Cryptol."},{"key":"5006_CR29","doi-asserted-by":"crossref","unstructured":"Tseng, K.-C., Lee, W.-L., Chen, C.-Y., Tsai, C.-W.: Quantum secret sharing via Lagrange interpolation: from static to conditional dynamic threshold. Physica Scripta (2025)","DOI":"10.1088\/1402-4896\/ade2a5"},{"issue":"3","key":"5006_CR30","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1093\/comjnl\/bxae109","volume":"68","author":"A Voudouris","year":"2025","unstructured":"Voudouris, A., Tressos, A., Zarras, A., Xenakis, C.: Game on: a performance comparison of interpolation techniques applied to Shamir\u2019s secret sharing. Comput. J. 68(3), 261\u2013272 (2025)","journal-title":"Comput. J."},{"key":"5006_CR31","first-page":"5","volume":"2","author":"M Borovcnik","year":"2012","unstructured":"Borovcnik, M.: Multiple perspectives on the concept of conditional probability. Adv. Investig. Educ. Mat. 2, 5\u201327 (2012)","journal-title":"Adv. Investig. Educ. Mat."},{"issue":"13","key":"5006_CR32","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.109.130501","volume":"109","author":"A Kent","year":"2012","unstructured":"Kent, A.: Unconditionally secure bit commitment by transmitting measurement outcomes. Phys. Rev. Lett. 109(13), 130501 (2012)","journal-title":"Phys. Rev. Lett."},{"issue":"20","key":"5006_CR33","doi-asserted-by":"publisher","first-page":"2005","DOI":"10.1080\/09500340.2016.1148212","volume":"63","author":"K Heshami","year":"2016","unstructured":"Heshami, K., England, D.G., Humphreys, P.C., Bustard, P.J., Acosta, V.M., Nunn, J., Sussman, B.J.: Quantum memories: emerging applications and recent advances. J. Mod. Opt. 63(20), 2005\u20132028 (2016)","journal-title":"J. Mod. Opt."}],"container-title":["Quantum Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-025-05006-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11128-025-05006-y","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-025-05006-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,29]],"date-time":"2025-12-29T14:58:06Z","timestamp":1767020286000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11128-025-05006-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,24]]},"references-count":33,"journal-issue":{"issue":"12","published-online":{"date-parts":[[2025,12]]}},"alternative-id":["5006"],"URL":"https:\/\/doi.org\/10.1007\/s11128-025-05006-y","relation":{},"ISSN":["1573-1332"],"issn-type":[{"type":"electronic","value":"1573-1332"}],"subject":[],"published":{"date-parts":[[2025,11,24]]},"assertion":[{"value":"16 May 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 November 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 November 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"381"}}