{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:22:15Z","timestamp":1740122535007,"version":"3.37.3"},"reference-count":55,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2020,3,27]],"date-time":"2020-03-27T00:00:00Z","timestamp":1585267200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2020,3,27]],"date-time":"2020-03-27T00:00:00Z","timestamp":1585267200000},"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":"crossref","award":["17K06419"],"award-info":[{"award-number":["17K06419"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2020,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We improve the flexibility in designing access structures of quantum stabilizer-based secret sharing schemes for classical secrets, by introducing message randomization in their encoding procedures. We generalize the Gilbert\u2013Varshamov bound for deterministic encoding to randomized encoding of classical secrets. We also provide an explicit example of a ramp secret sharing scheme with which multiple symbols in its classical secret are revealed to an intermediate set, and justify the necessity of incorporating strong security criterion of conventional secret sharing. Finally, we propose an explicit construction of strongly secure ramp secret sharing scheme by quantum stabilizers, which can support twice as large classical secrets as the McEliece\u2013Sarwate strongly secure ramp secret sharing scheme of the same share size and the access structure.<\/jats:p>","DOI":"10.1007\/s10623-020-00751-w","type":"journal-article","created":{"date-parts":[[2020,3,27]],"date-time":"2020-03-27T15:02:40Z","timestamp":1585321360000},"page":"1893-1907","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Message randomization and strong security in quantum stabilizer-based secret sharing for classical secrets"],"prefix":"10.1007","volume":"88","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":[[2020,3,27]]},"reference":[{"key":"751_CR1","volume-title":"Geometric Algebra","author":"E Artin","year":"1957","unstructured":"Artin E.: Geometric Algebra. Interscience Publishers, New York (1957)."},{"key":"751_CR2","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":"751_CR3","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":"751_CR4","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)"},{"key":"751_CR5","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/3-540-39568-7_20","volume-title":"Advances in Cryptology-CRYPTO\u201984, Lecture Notes in Computer Science","author":"GR Blakley","year":"1985","unstructured":"Blakley G.R., Meadows C.: Security of ramp schemes. In: Blakley G.R., Chaum D. (eds.) Advances in Cryptology-CRYPTO\u201984, Lecture Notes in Computer Science, vol. 196, pp. 242\u2013269. Springer, New York (1985). https:\/\/doi.org\/10.1007\/3-540-39568-7_20."},{"issue":"2","key":"751_CR6","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1006\/inco.1996.0095","volume":"131","author":"C Blundo","year":"1996","unstructured":"Blundo C., De Santis A., Vaccaro U.: Randomness in distribution protocols. Inf. Comput. 131(2), 111\u2013139 (1996). https:\/\/doi.org\/10.1006\/inco.1996.0095.","journal-title":"Inf. Comput."},{"issue":"1","key":"751_CR7","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/S0020-0190(97)00194-4","volume":"65","author":"C Blundo","year":"1998","unstructured":"Blundo C., De Santis A., Vaccaro U.: On secret sharing schemes. Inf. Process. Lett. 65(1), 25\u201332 (1998). https:\/\/doi.org\/10.1016\/S0020-0190(97)00194-4.","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"751_CR8","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1023\/A:1008242111272","volume":"11","author":"C Blundo","year":"1997","unstructured":"Blundo C., Gaggia A.G., Stinson D.R.: On the dealer\u2019s randomness required in secret sharing schemes. Des. Codes Cryptogr. 11(3), 235\u2013259 (1997). https:\/\/doi.org\/10.1023\/A:1008242111272.","journal-title":"Des. Codes Cryptogr."},{"issue":"3","key":"751_CR9","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":"751_CR10","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":"751_CR11","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":"751_CR12","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/978-3-540-72540-4_17","volume-title":"Advances in Cryptology-EUROCRYPT 2007, Lecture Notes in Computer Science","author":"H Chen","year":"2007","unstructured":"Chen H., Cramer R., Goldwasser S., de Haan R., Vaikuntanathan V.: Secure computation from random error correccting codes. In: Naor M. (ed.) Advances in Cryptology-EUROCRYPT 2007, Lecture Notes in Computer Science, vol. 4515, pp. 291\u2013310. Springer, Berlin (2007). https:\/\/doi.org\/10.1007\/978-3-540-72540-4_17."},{"issue":"3","key":"751_CR13","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":"751_CR14","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107337756","volume-title":"Secure Multiparty Computation and Secret Sharing","author":"R Cramer","year":"2015","unstructured":"Cramer R., Damg\u00e5rd I.B., Nielsen J.B.: Secure Multiparty Computation and Secret Sharing. Cambridge University Press, New York (2015). https:\/\/doi.org\/10.1017\/CBO9781107337756."},{"key":"751_CR15","doi-asserted-by":"publisher","unstructured":"dela Cruz R., Meyer A., Sol\u00e9 P.: Extension of Massey scheme for secret sharing. In: Proceedings of the ITW 2010. Dublin, Ireland (2010). https:\/\/doi.org\/10.1109\/CIG.2010.5592719","DOI":"10.1109\/CIG.2010.5592719"},{"issue":"1","key":"751_CR16","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":"751_CR17","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":"751_CR18","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":"751_CR19","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":"751_CR20","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"},{"issue":"10","key":"751_CR21","doi-asserted-by":"publisher","first-page":"2720","DOI":"10.1093\/ietfec\/e91-a.10.2720","volume":"E91\u2013A","author":"K Harada","year":"2008","unstructured":"Harada K., Yamamoto H.: Strongly secure linear network coding. IEICE Trans. Fundam. E91\u2013A(10), 2720\u20132728 (2008). https:\/\/doi.org\/10.1093\/ietfec\/e91-a.10.2720.","journal-title":"IEICE Trans. Fundam."},{"issue":"5","key":"751_CR22","doi-asserted-by":"publisher","first-page":"2355","DOI":"10.1109\/TIT.2016.2530088","volume":"62","author":"M Hayashi","year":"2016","unstructured":"Hayashi M., Matsumoto R.: Secure multiplex coding with dependent and non-uniform multiple messages. IEEE Trans. Inf. Theory 62(5), 2355\u20132409 (2016). https:\/\/doi.org\/10.1109\/TIT.2016.2530088.","journal-title":"IEEE Trans. Inf. Theory"},{"key":"751_CR23","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"},{"issue":"2","key":"751_CR24","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1016\/j.ipl.2005.09.012","volume":"97","author":"M Iwamoto","year":"2006","unstructured":"Iwamoto M., Yamamoto H.: Strongly secure ramp secret sharing schemes for general access structures. Inf. Process. Lett. 97(2), 52\u201357 (2006). https:\/\/doi.org\/10.1016\/j.ipl.2005.09.012.","journal-title":"Inf. Process. Lett."},{"key":"751_CR25","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":"751_CR26","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":"12","key":"751_CR27","doi-asserted-by":"publisher","first-page":"8131","DOI":"10.1109\/TIT.2013.2282673","volume":"59","author":"D Kobayashi","year":"2013","unstructured":"Kobayashi D., Yamamoto H., Ogawa T.: Secure multiplex coding attaining channel capacity in wiretap channels. IEEE Trans. Inf. Theory 59(12), 8131\u20138143 (2013). https:\/\/doi.org\/10.1109\/TIT.2013.2282673.","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"7","key":"751_CR28","doi-asserted-by":"publisher","first-page":"3912","DOI":"10.1109\/TIT.2015.2429713","volume":"61","author":"J Kurihara","year":"2015","unstructured":"Kurihara J., Matsumoto R., Uyematsu T.: Relative generalized rank weight of linear codes and its applications to network coding. IEEE Trans. Inf. Theory 61(7), 3912\u20133936 (2015). https:\/\/doi.org\/10.1109\/TIT.2015.2429713.","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"11","key":"751_CR29","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":"751_CR30","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"},{"key":"751_CR31","volume-title":"The Theory of Error-Correcting Codes","author":"FJ MacWilliams","year":"1977","unstructured":"MacWilliams F.J., Sloane N.J.A.: The Theory of Error-Correcting Codes. Elsevier, Amsterdam (1977)."},{"issue":"4","key":"751_CR32","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":"751_CR33","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":"751_CR34","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":"6","key":"751_CR35","doi-asserted-by":"publisher","first-page":"4191","DOI":"10.1109\/TIT.2018.2823326","volume":"64","author":"U Mart\u00ednez-Pe\u00f1as","year":"2018","unstructured":"Mart\u00ednez-Pe\u00f1as U.: Communication efficient and strongly secure secret sharing schemes based on algebraic geometry codes. IEEE Trans. Inf. Theory 64(6), 4191\u20134206 (2018). https:\/\/doi.org\/10.1109\/TIT.2018.2823326.","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"8","key":"751_CR36","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":"751_CR37","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":"751_CR38","doi-asserted-by":"crossref","unstructured":"Matsumoto R.: Classical access structures of ramp secret sharing based on quantum stabilizer codes. In: Proceedings of the WCC 2019, Paper No. 2. Saint-Jacut-de-la-Mer, France (2019)","DOI":"10.1007\/s11128-019-2503-3"},{"issue":"9","key":"751_CR39","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1587\/comex.2019XBL0089","volume":"8","author":"R Matsumoto","year":"2019","unstructured":"Matsumoto R.: Strongly secure ramp secret sharing with more participants based on Reed-Solomon codes. IEICE Commun. Express 8(9), 399\u2013403 (2019). https:\/\/doi.org\/10.1587\/comex.2019XBL0089.","journal-title":"IEICE Commun. Express"},{"issue":"1","key":"751_CR40","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/s11128-019-2503-3","volume":"19","author":"R Matsumoto","year":"2020","unstructured":"Matsumoto R.: Classical access structures of ramp secret sharing based on quantum stabilizer codes. Quant. Inf. Process. 19(1), 9 (2020). https:\/\/doi.org\/10.1007\/s11128-019-2503-3.","journal-title":"Quant. Inf. Process."},{"issue":"6","key":"751_CR41","doi-asserted-by":"publisher","first-page":"3773","DOI":"10.1109\/TIT.2017.2694012","volume":"63","author":"R Matsumoto","year":"2017","unstructured":"Matsumoto R., Hayashi M.: Universal secure multiplex network coding with dependent and non-uniform messages. IEEE Trans. Inf. Theory 63(6), 3773\u20133782 (2017). https:\/\/doi.org\/10.1109\/TIT.2017.2694012.","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"10","key":"751_CR42","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":"751_CR43","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":"751_CR44","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. Comm. ACM 24(9), 583\u2013584 (1981). https:\/\/doi.org\/10.1145\/358746.358762.","journal-title":"Comm. ACM"},{"key":"751_CR45","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":"12","key":"751_CR46","first-page":"1009","volume":"J92\u2013A","author":"M Nishiara","year":"2009","unstructured":"Nishiara M., Takizawa K.: Strongly secure secret sharing scheme with ramp threshold based on Shamir\u2019s polynomial interpolation scheme. Trans. IEICE J92\u2013A(12), 1009\u20131013 (2009). in Japanese.","journal-title":"Trans. IEICE"},{"key":"751_CR47","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":"751_CR48","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":"751_CR49","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. Comm. ACM 22(11), 612\u2013613 (1979). https:\/\/doi.org\/10.1145\/359168.359176.","journal-title":"Comm. ACM"},{"key":"751_CR50","doi-asserted-by":"publisher","unstructured":"Silva D., Kschischang F.R.: Universal weakly secure network coding. In: Proceedings of the ITW 2009, pp. 281\u2013285. Volos, Greece (2009). https:\/\/doi.org\/10.1109\/ITWNIT.2009.5158587","DOI":"10.1109\/ITWNIT.2009.5158587"},{"key":"751_CR51","unstructured":"Smith A.D.: Quantum secret sharing for general access structures (2000). arXiv:quant-ph\/0001087."},{"issue":"1954","key":"751_CR52","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":"751_CR53","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\/CRC, Boca Raton (2006). https:\/\/doi.org\/10.1201\/9781420057133.","edition":"3"},{"key":"751_CR54","doi-asserted-by":"publisher","unstructured":"Yamamoto H.: Secret sharing system using $$(k, l, n)$$ threshold scheme. Electron. Commun. Jpn. 69(9), 46\u201354 (1986). https:\/\/doi.org\/10.1002\/ecja.4410690906. (the original Japanese version published in 1985)","DOI":"10.1002\/ecja.4410690906"},{"issue":"2","key":"751_CR55","doi-asserted-by":"publisher","first-page":"715","DOI":"10.1007\/s11128-014-0863-2","volume":"14","author":"P Zhang","year":"2015","unstructured":"Zhang P., Matsumoto R.: Quantum strongly secure ramp secret sharing. Quant. Inf. Process. 14(2), 715\u2013729 (2015). https:\/\/doi.org\/10.1007\/s11128-014-0863-2.","journal-title":"Quant. Inf. Process."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-020-00751-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-020-00751-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-020-00751-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,27]],"date-time":"2021-03-27T00:19:03Z","timestamp":1616804343000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-020-00751-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,3,27]]},"references-count":55,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2020,9]]}},"alternative-id":["751"],"URL":"https:\/\/doi.org\/10.1007\/s10623-020-00751-w","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2020,3,27]]},"assertion":[{"value":"8 May 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 February 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 March 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 March 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}