{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T03:00:08Z","timestamp":1768532408850,"version":"3.49.0"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,11,26]],"date-time":"2019-11-26T00:00:00Z","timestamp":1574726400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2019,11,26]],"date-time":"2019-11-26T00:00:00Z","timestamp":1574726400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["17K06419"],"award-info":[{"award-number":["17K06419"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Quantum Inf Process"],"published-print":{"date-parts":[[2020,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In this paper, we consider to use the quantum stabilizer codes as secret sharing schemes for classical secrets. We give necessary and sufficient conditions for qualified and forbidden sets in terms of quantum stabilizers. Then, we give a Gilbert\u2013Varshamov-type sufficient condition for existence of secret sharing schemes with given parameters, and by using that sufficient condition, we show that roughly 19% of participants can be made forbidden independently of the size of classical secret, in particular when an <jats:italic>n<\/jats:italic>-bit classical secret is shared among <jats:italic>n<\/jats:italic> participants having 1-qubit share each. We also consider how much information is obtained by an intermediate set and express that amount of information in terms of quantum stabilizers. All the results are stated in terms of linear spaces over finite fields associated with the quantum stabilizers.<\/jats:p>","DOI":"10.1007\/s11128-019-2503-3","type":"journal-article","created":{"date-parts":[[2019,11,26]],"date-time":"2019-11-26T15:03:14Z","timestamp":1574780594000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Classical access structures of ramp secret sharing based on quantum stabilizer codes"],"prefix":"10.1007","volume":"19","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5085-8879","authenticated-orcid":false,"given":"Ryutaroh","family":"Matsumoto","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,11,26]]},"reference":[{"key":"2503_CR1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139175319","volume-title":"Finite Group Theory, Cambridge Studies in Advanced Mathematics","author":"M Aschbacher","year":"2000","unstructured":"Aschbacher, M.: Finite Group Theory, Cambridge Studies in Advanced Mathematics, vol. 10, 2nd edn. Cambridge University Press, Cambridge (2000). https:\/\/doi.org\/10.1017\/CBO9781139175319","edition":"2"},{"issue":"7","key":"2503_CR2","doi-asserted-by":"publisher","first-page":"3065","DOI":"10.1109\/18.959288","volume":"47","author":"A Ashikhmin","year":"2001","unstructured":"Ashikhmin, A., Knill, E.: Nonbinary quantum stabilizer codes. IEEE Trans. Inf. Theory 47(7), 3065\u20133072 (2001). https:\/\/doi.org\/10.1109\/18.959288","journal-title":"IEEE Trans. Inf. Theory"},{"key":"2503_CR3","unstructured":"Bains, T.: Generalized Hamming weights and their applications to secret sharing schemes. Master\u2019s thesis, University of Amsterdam (2008). https:\/\/esc.fnwi.uva.nl\/thesis\/apart\/math\/thesis.php?start=391 (supervised by R. Cramer, G. van der Geer, and R. de Haan)"},{"issue":"3","key":"2503_CR4","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1103\/PhysRevLett.78.405","volume":"78","author":"AR Calderbank","year":"1997","unstructured":"Calderbank, A.R., Rains, E.M., Shor, P.W., Sloane, N.J.A.: Quantum error correction and orthogonal geometry. Phys. Rev. Lett. 78(3), 405\u2013408 (1997). https:\/\/doi.org\/10.1103\/PhysRevLett.78.405","journal-title":"Phys. Rev. Lett."},{"issue":"4","key":"2503_CR5","doi-asserted-by":"publisher","first-page":"1369","DOI":"10.1109\/18.681315","volume":"44","author":"AR Calderbank","year":"1998","unstructured":"Calderbank, A.R., Rains, E.M., Shor, P.W., Sloane, N.J.A.: Quantum error correction via codes over GF(4). IEEE Trans. Inf. Theory 44(4), 1369\u20131387 (1998). https:\/\/doi.org\/10.1109\/18.681315","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"2503_CR6","doi-asserted-by":"publisher","first-page":"1098","DOI":"10.1103\/PhysRevA.54.1098","volume":"54","author":"AR Calderbank","year":"1996","unstructured":"Calderbank, A.R., Shor, P.W.: Good quantum error-correcting codes exist. Phys. Rev. A 54(2), 1098\u20131105 (1996). https:\/\/doi.org\/10.1103\/PhysRevA.54.1098","journal-title":"Phys. Rev. A"},{"key":"2503_CR7","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/978-3-540-72540-4_17","volume-title":"Advances in Cryptology - EUROCRYPT 2007","author":"Hao Chen","year":"2007","unstructured":"Chen, H., Cramer, R., Goldwasser, S., de Haan, R., Vaikuntanathan, V.: Secure computation from random error correccting codes. In: Advances in Cryptology\u2014EUROCRYPT 2007, Lecture Notes in Computer Science, vol. 4515, pp. 291\u2013310. Springer (2007). https:\/\/doi.org\/10.1007\/978-3-540-72540-4_17"},{"issue":"3","key":"2503_CR8","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\u2013651 (1999). https:\/\/doi.org\/10.1103\/PhysRevLett.83.648","journal-title":"Phys. Rev. Lett."},{"key":"2503_CR9","doi-asserted-by":"publisher","DOI":"10.1002\/047174882X","volume-title":"Elements of Information Theory","author":"TM Cover","year":"2006","unstructured":"Cover, T.M., Thomas, J.A.: Elements of Information Theory, 2nd edn. Wiley Interscience, New York (2006). https:\/\/doi.org\/10.1002\/047174882X","edition":"2"},{"key":"2503_CR10","doi-asserted-by":"publisher","unstructured":"dela Cruz, R., Meyer, A., Sol\u00e9, P.: Extension of Massey scheme for secret sharing. In: Proceedings of ITW 2010. Dublin, Ireland (2010). https:\/\/doi.org\/10.1109\/CIG.2010.5592719","DOI":"10.1109\/CIG.2010.5592719"},{"issue":"1","key":"2503_CR11","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/j.ffa.2009.11.006","volume":"16","author":"IM Duursma","year":"2010","unstructured":"Duursma, I.M., Park, S.: Coset bounds for algebraic geometric codes. Finite Fields Appl. 16(1), 36\u201355 (2010). https:\/\/doi.org\/10.1016\/j.ffa.2009.11.006","journal-title":"Finite Fields Appl."},{"issue":"10","key":"2503_CR12","doi-asserted-by":"publisher","first-page":"5938","DOI":"10.1109\/TIT.2014.2345375","volume":"60","author":"O Geil","year":"2014","unstructured":"Geil, O., Martin, S., Matsumoto, R., Ruano, D., Luo, Y.: Relative generalized Hamming weights of one-point algebraic geometric codes. IEEE Trans. Inf. Theory 60(10), 5938\u20135949 (2014). https:\/\/doi.org\/10.1109\/TIT.2014.2345375","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"2503_CR13","doi-asserted-by":"publisher","first-page":"052309","DOI":"10.1103\/PhysRevA.85.052309","volume":"85","author":"V Gheorghiu","year":"2012","unstructured":"Gheorghiu, V.: Generalized semiquantum secret-sharing schemes. Phys. Rev. A 85(5), 052309 (2012). https:\/\/doi.org\/10.1103\/PhysRevA.85.052309","journal-title":"Phys. Rev. A"},{"issue":"3","key":"2503_CR14","doi-asserted-by":"publisher","first-page":"1862","DOI":"10.1103\/PhysRevA.54.1862","volume":"54","author":"D Gottesman","year":"1996","unstructured":"Gottesman, D.: Class of quantum error-correcting codes saturating the quantum Hamming bound. Phys. Rev. A 54(3), 1862\u20131868 (1996). https:\/\/doi.org\/10.1103\/PhysRevA.54.1862","journal-title":"Phys. Rev. A"},{"issue":"4","key":"2503_CR15","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(4), 042311 (2000). https:\/\/doi.org\/10.1103\/PhysRevA.61.042311","journal-title":"Phys. Rev. A"},{"key":"2503_CR16","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). https:\/\/doi.org\/10.1103\/PhysRevA.59.1829","journal-title":"Phys. Rev. A"},{"key":"2503_CR17","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). https:\/\/doi.org\/10.1103\/PhysRevA.59.162","journal-title":"Phys. Rev. A"},{"issue":"11","key":"2503_CR18","doi-asserted-by":"publisher","first-page":"4892","DOI":"10.1109\/TIT.2006.883612","volume":"52","author":"A Ketkar","year":"2006","unstructured":"Ketkar, A., Klappenecker, A., Kumar, S., Sarvepalli, P.K.: Nonbainary stabilizer codes over finite fields. IEEE Trans. Inf. Theory 52(11), 4892\u20134924 (2006). https:\/\/doi.org\/10.1109\/TIT.2006.883612","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"11","key":"2503_CR19","doi-asserted-by":"publisher","first-page":"2067","DOI":"10.1587\/transfun.E95.A.2067","volume":"E95\u2013A","author":"J Kurihara","year":"2012","unstructured":"Kurihara, J., Uyematsu, T., Matsumoto, R.: Secret sharing schemes based on linear codes can be precisely characterized by the relative generalized Hamming weight. IEICE Trans. Fundam. E95\u2013A(11), 2067\u20132075 (2012). https:\/\/doi.org\/10.1587\/transfun.E95.A.2067","journal-title":"IEICE Trans. Fundam."},{"issue":"3","key":"2503_CR20","doi-asserted-by":"publisher","first-page":"1222","DOI":"10.1109\/TIT.2004.842763","volume":"51","author":"Y Luo","year":"2005","unstructured":"Luo, Y., Mitrpant, C., Han Vinck, A.J., Chen, K.: Some new characters on the wire-tap channel of type II. IEEE Trans. Inf. Theory 51(3), 1222\u20131229 (2005). https:\/\/doi.org\/10.1109\/TIT.2004.842763","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"2503_CR21","doi-asserted-by":"publisher","first-page":"042332","DOI":"10.1103\/PhysRevA.88.042332","volume":"88","author":"A Marin","year":"2013","unstructured":"Marin, A., Markham, D.: Equivalence between sharing quantum and classical secrets and error correction. Phys. Rev. A 88(4), 042332 (2013). https:\/\/doi.org\/10.1103\/PhysRevA.88.042332","journal-title":"Phys. Rev. A"},{"issue":"4","key":"2503_CR22","doi-asserted-by":"publisher","first-page":"042309","DOI":"10.1103\/PhysRevA.78.042309","volume":"78","author":"D Markham","year":"2008","unstructured":"Markham, D., Sanders, B.C.: Graph states for quantum secret sharing. Phys. Rev. A 78(4), 042309 (2008). https:\/\/doi.org\/10.1103\/PhysRevA.78.042309","journal-title":"Phys. Rev. A"},{"issue":"7","key":"2503_CR23","doi-asserted-by":"publisher","first-page":"4081","DOI":"10.1109\/TIT.2016.2570238","volume":"62","author":"U Mart\u00ednez-Pe\u00f1as","year":"2016","unstructured":"Mart\u00ednez-Pe\u00f1as, U.: On the similarities between generalized rank and Hamming weights and their applications to network coding. IEEE Trans. Inf. Theory 62(7), 4081\u20134095 (2016). https:\/\/doi.org\/10.1109\/TIT.2016.2570238","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"12","key":"2503_CR24","doi-asserted-by":"publisher","first-page":"2738","DOI":"10.1587\/transfun.E100.A.2738","volume":"E100\u2013A","author":"R Matsumoto","year":"2017","unstructured":"Matsumoto, R.: Quantum stabilizer codes can realize access structures impossible by classical secret sharing. IEICE Trans. Fundam. E100\u2013A(12), 2738\u20132739 (2017). https:\/\/doi.org\/10.1587\/transfun.E100.A.2738","journal-title":"IEICE Trans. Fundam."},{"issue":"8","key":"2503_CR25","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/s11128-017-1656-1","volume":"16","author":"R Matsumoto","year":"2017","unstructured":"Matsumoto, R.: Unitary reconstruction of secret for stabilizer based quantum secret sharing. Quant. Inf. Process. 16(8), 202 (2017). https:\/\/doi.org\/10.1007\/s11128-017-1656-1","journal-title":"Quant. Inf. Process."},{"issue":"8","key":"2503_CR26","doi-asserted-by":"publisher","first-page":"1215","DOI":"10.1587\/transfun.E101.A.1215","volume":"E101\u2013A","author":"R Matsumoto","year":"2018","unstructured":"Matsumoto, R.: Coding theoretic construction of quantum ramp secret sharing. IEICE Trans. Fundam. E101\u2013A(8), 1215\u20131222 (2018). https:\/\/doi.org\/10.1587\/transfun.E101.A.1215","journal-title":"IEICE Trans. Fundam."},{"key":"2503_CR27","doi-asserted-by":"publisher","unstructured":"Matsumoto, R.: Exploring quantum supremacy in access structures of secret sharing by coding theory. In: Proceedings of 2018 ISITA, pp. 331\u2013333. Singapore (2018). https:\/\/doi.org\/10.23919\/ISITA.2018.8664271","DOI":"10.23919\/ISITA.2018.8664271"},{"key":"2503_CR28","unstructured":"Matsumoto, R.: Classical access structures of ramp secret sharing based on quantum stabilizer codes. In: Proceedings of WCC 2019, paper no. 2. Saint-Jacut-de-la-Mer, France (2019). https:\/\/www.lebesgue.fr\/sites\/default\/files\/proceedings_WCC\/WCC_2019_paper_2.pdf"},{"issue":"10","key":"2503_CR29","first-page":"1878","volume":"E83\u2013A","author":"R Matsumoto","year":"2000","unstructured":"Matsumoto, R., Uyematsu, T.: Constructing quantum error-correcting codes for $$p^m$$-state systems from classical error-correcting codes. IEICE Trans. Fundam. E83\u2013A(10), 1878\u20131883 (2000)","journal-title":"IEICE Trans. Fundam."},{"issue":"9","key":"2503_CR30","doi-asserted-by":"publisher","first-page":"4391","DOI":"10.1063\/1.1497999","volume":"43","author":"R Matsumoto","year":"2002","unstructured":"Matsumoto, R., Uyematsu, T.: Lower bound for the quantum capacity of a discrete memoryless quantum channel. J. Math. Phys. 43(9), 4391\u20134403 (2002). https:\/\/doi.org\/10.1063\/1.1497999","journal-title":"J. Math. Phys."},{"issue":"9","key":"2503_CR31","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1145\/358746.358762","volume":"24","author":"RJ McEliece","year":"1981","unstructured":"McEliece, R.J., Sarwate, D.V.: On sharing secrets and Reed-Solomon codes. Commun. ACM 24(9), 583\u2013584 (1981). https:\/\/doi.org\/10.1145\/358746.358762","journal-title":"Commun. ACM"},{"key":"2503_CR32","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511976667","volume-title":"Quantum Computation and Quantum Information","author":"MA Nielsen","year":"2000","unstructured":"Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2000). https:\/\/doi.org\/10.1017\/CBO9780511976667"},{"issue":"3","key":"2503_CR33","doi-asserted-by":"publisher","first-page":"032318","DOI":"10.1103\/PhysRevA.72.032318","volume":"72","author":"T Ogawa","year":"2005","unstructured":"Ogawa, T., Sasaki, A., Iwamoto, M., Yamamoto, H.: Quantum secret sharing schemes and reversibility of quantum operations. Phys. Rev. A 72(3), 032318 (2005). https:\/\/doi.org\/10.1103\/PhysRevA.72.032318","journal-title":"Phys. Rev. A"},{"key":"2503_CR34","first-page":"3","volume-title":"Handbook of Coding Theory","author":"VS Pless","year":"1998","unstructured":"Pless, V.S., Huffman, W.C., Brualdi, R.A.: An introduction to algebraic codes. In: Pless, V.S., Huffman, W.C. (eds.) Handbook of Coding Theory, pp. 3\u2013139. Elsevier, Amsterdam (1998)"},{"issue":"4","key":"2503_CR35","doi-asserted-by":"publisher","first-page":"042303","DOI":"10.1103\/PhysRevA.86.042303","volume":"86","author":"PK Sarvepalli","year":"2012","unstructured":"Sarvepalli, P.K.: Nonthreshold quantum secret-sharing schemes in the graph-state formalism. Phys. Rev. A 86(4), 042303 (2012). https:\/\/doi.org\/10.1103\/PhysRevA.86.042303","journal-title":"Phys. Rev. A"},{"issue":"11","key":"2503_CR36","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). https:\/\/doi.org\/10.1145\/359168.359176","journal-title":"Commun. ACM"},{"key":"2503_CR37","unstructured":"Smith, A.D.: Quantum secret sharing for general access structures (2000). arXiv:quant-ph\/0001087"},{"issue":"1954","key":"2503_CR38","doi-asserted-by":"publisher","first-page":"2551","DOI":"10.1098\/rspa.1996.0136","volume":"452","author":"AM Steane","year":"1996","unstructured":"Steane, A.M.: Multiple particle interference and quantum error correction. Proc. R. Soc. Lond. Ser. A 452(1954), 2551\u20132577 (1996). https:\/\/doi.org\/10.1098\/rspa.1996.0136","journal-title":"Proc. R. Soc. Lond. Ser. A"},{"key":"2503_CR39","doi-asserted-by":"publisher","DOI":"10.1201\/9781420057133","volume-title":"Cryptography Theory and Practice","author":"DR Stinson","year":"2006","unstructured":"Stinson, D.R.: Cryptography Theory and Practice, 3rd edn. Chapman & Hall, London (2006). https:\/\/doi.org\/10.1201\/9781420057133","edition":"3"}],"container-title":["Quantum Information Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-019-2503-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11128-019-2503-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-019-2503-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,25]],"date-time":"2020-11-25T00:24:16Z","timestamp":1606263856000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11128-019-2503-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,26]]},"references-count":39,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,1]]}},"alternative-id":["2503"],"URL":"https:\/\/doi.org\/10.1007\/s11128-019-2503-3","relation":{},"ISSN":["1570-0755","1573-1332"],"issn-type":[{"value":"1570-0755","type":"print"},{"value":"1573-1332","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,11,26]]},"assertion":[{"value":"19 April 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 November 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 November 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"9"}}