{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,12]],"date-time":"2026-04-12T01:31:46Z","timestamp":1775957506786,"version":"3.50.1"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,8,12]],"date-time":"2016-08-12T00:00:00Z","timestamp":1470960000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2016,8,12]],"date-time":"2016-08-12T00:00:00Z","timestamp":1470960000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Sci Rep"],"abstract":"<jats:title>Abstract<\/jats:title><jats:p>With prevalent attacks in communication, sharing a secret between communicating parties is an ongoing challenge. Moreover, it is important to integrate quantum solutions with classical secret sharing schemes with low computational cost for the real world use. This paper proposes a novel hybrid threshold adaptable quantum secret sharing scheme, using an <jats:italic>m<\/jats:italic>-bonacci orbital angular momentum (OAM) pump, Lagrange interpolation polynomials, and reverse Huffman-Fibonacci-tree coding. To be exact, we employ entangled states prepared by <jats:italic>m<\/jats:italic>-bonacci sequences to detect eavesdropping. Meanwhile, we encode <jats:italic>m<\/jats:italic>-bonacci sequences in Lagrange interpolation polynomials to generate the shares of a secret with reverse Huffman-Fibonacci-tree coding. The advantages of the proposed scheme is that it can detect eavesdropping without joint quantum operations, and permits secret sharing for an arbitrary but no less than threshold-value number of classical participants with much lower bandwidth. Also, in comparison with existing quantum secret sharing schemes, it still works when there are dynamic changes, such as the unavailability of some quantum channel, the arrival of new participants and the departure of participants. Finally, we provide security analysis of the new hybrid quantum secret sharing scheme and discuss its useful features for modern applications.<\/jats:p>","DOI":"10.1038\/srep31350","type":"journal-article","created":{"date-parts":[[2016,8,12]],"date-time":"2016-08-12T09:25:23Z","timestamp":1470993923000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["Hybrid threshold adaptable quantum secret sharing scheme with reverse Huffman-Fibonacci-tree coding"],"prefix":"10.1038","volume":"6","author":[{"given":"Hong","family":"Lai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jun","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ming-Xing","family":"Luo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lei","family":"Pan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Josef","family":"Pieprzyk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fuyuan","family":"Xiao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mehmet A.","family":"Orgun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,8,12]]},"reference":[{"key":"BFsrep31350_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, 612\u2013613 (1979).","journal-title":"Commun. ACM"},{"key":"BFsrep31350_CR2","doi-asserted-by":"crossref","unstructured":"Blakeley, G. R. Safeguarding cryptographic keys. In: Proc. AFIPS, 313\u2013317 (Arlington VA, USA, 1979).","DOI":"10.1109\/MARK.1979.8817296"},{"key":"BFsrep31350_CR3","doi-asserted-by":"crossref","unstructured":"Chor, B., Goldwasser, S., Micali, S. & Awerbuch, B. Verifiable secret sharing and achieving simultaneity in the presence of faults. In Proc. 26th Annu. IEEE Symp. Found. Comput. Sci. 383\u2013395 (Portland, USA, 1985).","DOI":"10.1109\/SFCS.1985.64"},{"key":"BFsrep31350_CR4","doi-asserted-by":"crossref","unstructured":"Feldman, P. A practical scheme for non-interactive verifiable secret sharing. In Proc. 28th Annu. Symp. Found. Comput. Sci. 427\u2013438 (1987).","DOI":"10.1109\/SFCS.1987.4"},{"key":"BFsrep31350_CR5","first-page":"129","volume":"576","author":"TP Pedersen","year":"1992","unstructured":"Pedersen, T. P. Non-interactive and information-theoretic secure verifiable secret sharing. In: CRYPTO'92, 576, 129\u2013140 (1992).","journal-title":"CRYPTO'92"},{"key":"BFsrep31350_CR6","unstructured":"Iftene, S. Secret sharing schemes with applications in security protocols. Technical report, University Alexandru Ioan Cuza of Iasi, Faculty of Computer Science (2007)."},{"key":"BFsrep31350_CR7","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1109\/TIFS.2014.2384393","volume":"10","author":"FY Miao","year":"2015","unstructured":"Miao, F. Y., Xiong, Y., Wang, X. F. & Moaman, B. Randomized component and its application to (t, m. n)-group oriented secret sharing. IEEE Trans. Inf. Forensics Security 10, 889\u2013898 (2015).","journal-title":"IEEE Trans. Inf. Forensics Security"},{"key":"BFsrep31350_CR8","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, 1829\u20131834 (1999).","journal-title":"Phys. Rev. A"},{"key":"BFsrep31350_CR9","unstructured":"Bennett, C. H. & Brassard, G. Quantum Cryptography: Public Key Distribution and Coin Tossing. Proc. of IEEE Int. Conf. on Computers, Systems and Signal Processing, 175\u2013179 (Bangalore, 1984)."},{"key":"BFsrep31350_CR10","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1103\/PhysRevLett.67.661","volume":"67","author":"AK Ekert","year":"1991","unstructured":"Ekert, A. K. Quantum cryptography based on bell\u2019s theorem. Phys. Rev. Lett. 67, 661\u2013663 (1991).","journal-title":"Phys. Rev. Lett."},{"key":"BFsrep31350_CR11","doi-asserted-by":"publisher","first-page":"19898","DOI":"10.1038\/srep19898","volume":"6","author":"Q Li","year":"2016","unstructured":"Li, Q., Chan, W.-H. & Zhang, S.-Y. Semiquantum key distribution with secure delegated quantum computation. Sci. Rep. 6, 19898 (2016).","journal-title":"Sci. Rep."},{"key":"BFsrep31350_CR12","doi-asserted-by":"publisher","first-page":"7815","DOI":"10.1038\/srep07815","volume":"5","author":"Y-B Sheng","year":"2015","unstructured":"Sheng, Y.-B. & Zhou, L. Deterministic entanglement distillation for secure double-server blind quantum computation. Sci. Rep. 5, 7815 (2015).","journal-title":"Sci. Rep."},{"key":"BFsrep31350_CR13","doi-asserted-by":"publisher","first-page":"802","DOI":"10.1038\/299802a0","volume":"299","author":"WK Wootters","year":"1982","unstructured":"Wootters, W. K. & Zurek, W. H. A single quantum cannot be cloned. Nature 299, 802\u2013803 (1982).","journal-title":"Nature"},{"key":"BFsrep31350_CR14","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 quantunm secret. Phys. Rev. Lett. 83, 648\u2013652 (1999).","journal-title":"Phys. Rev. Lett."},{"key":"BFsrep31350_CR15","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1103\/PhysRevA.59.162","volume":"59","author":"A Karlsson","year":"1999","unstructured":"Karlsson, A., Koashi, M. & Imoto, N. Quantum entanglement for secret sharing and secret splitting. Phys. Rev. A 59, 162\u2013168 (1999).","journal-title":"Phys. Rev. A"},{"key":"BFsrep31350_CR16","doi-asserted-by":"publisher","first-page":"042301","DOI":"10.1103\/PhysRevA.63.042301","volume":"63","author":"W Tittel","year":"2001","unstructured":"Tittel, W., Zbinden, H. & Gisin, N. Experimental demonstration of quantum secret sharing. Phys. Rev. A 63, 042301\u2013042306 (2001).","journal-title":"Phys. Rev. A"},{"key":"BFsrep31350_CR17","doi-asserted-by":"publisher","first-page":"042311","DOI":"10.1103\/PhysRevA.61.042311","volume":"61","author":"D Gottesman","year":"2000","unstructured":"Gottesman, D. Theory of quantum secret sharing. Phys. Rev. A 61, 042311 (2000).","journal-title":"Phys. Rev. A"},{"key":"BFsrep31350_CR18","doi-asserted-by":"crossref","first-page":"052307","DOI":"10.1103\/PhysRevA.69.052307","volume":"69","author":"L Xiao","year":"2004","unstructured":"Xiao, L., Long, G.-L., Deng, F.-G. & Pan, J.-W. Efficient multiparty quantum-secret-sharing schemes. Phys. Rev. A 69, 052307 (2004).","journal-title":"Phys. Rev. A"},{"key":"BFsrep31350_CR19","doi-asserted-by":"publisher","first-page":"030301","DOI":"10.1103\/PhysRevA.92.030301","volume":"92","author":"V Karimipour","year":"2015","unstructured":"Karimipour, V. & Asoudeh, M. Quantum secret sharing and random hopping: Using single states instead of entanglement. Phys. Rev. A 92, 030301 (2015).","journal-title":"Phys. Rev. A"},{"key":"BFsrep31350_CR20","first-page":"16664","volume":"21","author":"K-J Wei","year":"2013","unstructured":"Wei, K.-J., Ma, H.-Q. & Yang, J.-H. Experimental circular quantum secret sharing over telecom fiber network. Opt. Express 21, 16664\u201316669 (2013).","journal-title":"Opt. Express"},{"key":"BFsrep31350_CR21","doi-asserted-by":"publisher","first-page":"14089","DOI":"10.1088\/0305-4470\/39\/45\/018","volume":"39","author":"F-G Deng","year":"2006","unstructured":"Deng, F.-G., Zhou, H.-Y. & Long, G.-L. Circular quantum secret sharing. J. Phys. A: Math Gen. 39, 14089\u201314099 (2006).","journal-title":"J. Phys. A: Math Gen."},{"key":"BFsrep31350_CR22","doi-asserted-by":"publisher","first-page":"16967","DOI":"10.1038\/srep16967","volume":"5","author":"Y-H Yang","year":"2015","unstructured":"Yang, Y.-H. et al. Quantum secret sharing via local operations and classical communication. Sci. Rep. 5, 16967 (2015).","journal-title":"Sci. Rep."},{"key":"BFsrep31350_CR23","doi-asserted-by":"publisher","first-page":"187","DOI":"10.12693\/APhysPolA.93.187","volume":"93","author":"M \u0179ukowski","year":"1998","unstructured":"\u0179ukowski, M., Zeilinger, A., Horne, M. A. & Weinfurter, H. Quest for GHZ states. Acta Phys. Pol. A 93, 187 (1998).","journal-title":"Acta Phys. Pol. A"},{"key":"BFsrep31350_CR24","doi-asserted-by":"publisher","first-page":"6659","DOI":"10.1109\/TIT.2012.2205895","volume":"58","author":"B Fortescue","year":"2012","unstructured":"Fortescue, B. & Gour, G. Reducing the quantum communication cost of quantum secret sharing. IEEE Trans. Inf. Theory 58, 6659\u20136666 (2012).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"BFsrep31350_CR25","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/BF02252871","volume":"1","author":"M Tompa","year":"1988","unstructured":"Tompa, M. & Woll, H. How to share a secret with cheaters. J. Cryptol. 1, 133\u2013138 (1988).","journal-title":"J. Cryptol."},{"key":"BFsrep31350_CR26","doi-asserted-by":"publisher","first-page":"022330","DOI":"10.1103\/PhysRevA.91.022330","volume":"91","author":"R Rahaman","year":"2015","unstructured":"Rahaman, R. & Parker, M. G. Quantum scheme for secret sharing based on local distinguishability. Phys. Rev. A 91, 022330 (2015).","journal-title":"Phys. Rev. A"},{"key":"BFsrep31350_CR27","doi-asserted-by":"publisher","first-page":"04231","DOI":"10.1103\/PhysRevA.88.042313","volume":"88","author":"H-K Lau","year":"2013","unstructured":"Lau, H.-K. & Weedbrook, C. Quantum secret sharing with continuous-variable cluster states. Phys. Rev. A 88, 04231 (2013).","journal-title":"Phys. Rev. A"},{"key":"BFsrep31350_CR28","doi-asserted-by":"publisher","first-page":"1915","DOI":"10.1216\/rmjm\/1181069352","volume":"36","author":"E Kilic","year":"2006","unstructured":"Kilic, E. & Tasci, D. On the Generalized Order-k Fibonacci and Lucas Numbers. Rocky Mountain J. Math. 36, 1915\u20131926 (2006).","journal-title":"Rocky Mountain J. Math."},{"key":"BFsrep31350_CR29","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/0166-218X(93)00116-H","volume":"64","author":"AS Fraenkel","year":"1996","unstructured":"Fraenkel, A. S. & Klein, S. T. Robust universal complete codes for transmission and compression. Discrete. Appl. Math. 64, 31\u201355 (1996).","journal-title":"Discrete. Appl. Math."},{"key":"BFsrep31350_CR30","first-page":"36","volume":"3","author":"P Hilton","year":"1991","unstructured":"Hilton, P. & Pedersen, J. Fibonacci and Lucas Numbers in Teaching and Research. J. Math. Informatique 3, 36\u201357 (1991\u20131992).","journal-title":"J. Math. Informatique"},{"key":"BFsrep31350_CR31","doi-asserted-by":"publisher","first-page":"032312","DOI":"10.1103\/PhysRevA.87.032312","volume":"87","author":"DS Simon","year":"2013","unstructured":"Simon, D. S. et al. High-capacity quantum Fibonacci coding for key distribution. Phys. Rev. A 87, 032312 (2013).","journal-title":"Phys. Rev. A"},{"key":"BFsrep31350_CR32","doi-asserted-by":"publisher","first-page":"043806","DOI":"10.1103\/PhysRevA.91.043806","volume":"91","author":"DS Simon","year":"2015","unstructured":"Simon, D. S., Fitzpatrick, C. A. & Sergienko, A. V. Discrimination and synthesis of recursive quantum states in high-dimensional Hilbert spaces. Phys. Rev. A 91, 043806 (2015).","journal-title":"Phys. Rev. A"},{"key":"BFsrep31350_CR33","doi-asserted-by":"publisher","first-page":"2110","DOI":"10.1364\/OE.20.002110","volume":"20","author":"MPJ Lavery","year":"2012","unstructured":"Lavery, M. P. J., Robertson, D. J., Berkhout, G. C. G., Love, G. D., Padgett, M. J. & Courtial, J. Refractive elements for the measurement of the orbital angular momentum of a single photon. Opt. Express 20, 2110\u20132115 (2012).","journal-title":"Opt. Express"},{"key":"BFsrep31350_CR34","doi-asserted-by":"publisher","first-page":"047902","DOI":"10.1103\/PhysRevLett.90.047902","volume":"4","author":"M Horodecki","year":"2003","unstructured":"Horodecki, M., Sen, A., Sen, U. & Horodecki, K. Local indistinguishability: More nonlocality with less entanglement. Phys. Rev. Lett. 4, 047902 (2003).","journal-title":"Phys. Rev. Lett."},{"key":"BFsrep31350_CR35","unstructured":"Simon, D. S., Fitzpatrick, C. A. & Sergienko, A. V. Security in the multi-dimensional Fibonacci protocol. arXiv:1503.04448. (2015)."},{"key":"BFsrep31350_CR36","doi-asserted-by":"publisher","first-page":"1098","DOI":"10.1109\/JRPROC.1952.273898","volume":"40","author":"D Huffman","year":"1952","unstructured":"Huffman, D. A method for the construction of minimum redundancy codes. Proc. IRE 40, 1098\u20131101 (1952).","journal-title":"Proc. IRE"},{"key":"BFsrep31350_CR37","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/BF01584082","volume":"1","author":"J Edmonds","year":"1971","unstructured":"Edmonds, J. Matroids and the greedy algorithm. Math. Programming 1, 126\u2013136 (1971).","journal-title":"Math. Programming"}],"container-title":["Scientific Reports"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.nature.com\/articles\/srep31350.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.nature.com\/articles\/srep31350","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.nature.com\/articles\/srep31350.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,5]],"date-time":"2023-01-05T05:23:13Z","timestamp":1672896193000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.nature.com\/articles\/srep31350"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,8,12]]},"references-count":37,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2016,8,30]]}},"alternative-id":["BFsrep31350"],"URL":"https:\/\/doi.org\/10.1038\/srep31350","relation":{},"ISSN":["2045-2322"],"issn-type":[{"value":"2045-2322","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,8,12]]},"assertion":[{"value":"4 April 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 July 2016","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 August 2016","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare no competing financial interests.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"31350"}}