{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T16:37:15Z","timestamp":1778085435057,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540858843","type":"print"},{"value":"9783540858867","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-85886-7_31","type":"book-chapter","created":{"date-parts":[[2008,9,17]],"date-time":"2008-09-17T12:45:42Z","timestamp":1221655542000},"page":"455-470","source":"Crossref","is-referenced-by-count":59,"title":["A New (k,n)-Threshold Secret Sharing Scheme and Its Extension"],"prefix":"10.1007","author":[{"given":"Jun","family":"Kurihara","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shinsaku","family":"Kiyomoto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kazuhide","family":"Fukushima","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Toshiaki","family":"Tanaka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"11","key":"31_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\u00a022(11), 612\u2013613 (1979)","journal-title":"Commun. ACM"},{"key":"31_CR2","doi-asserted-by":"crossref","unstructured":"Blakley, G.R.: Safeguarding cryptographic keys. In: Proc. AFIPS, vol.\u00a048, pp. 313\u2013317 (1979)","DOI":"10.1109\/MARK.1979.8817296"},{"key":"31_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/3-540-39568-7_20","volume-title":"Advances in Cryptology","author":"G.R. Blakley","year":"1985","unstructured":"Blakley, G.R., Meadows, C.: Security of ramp schemes. In: Blakely, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol.\u00a0196, pp. 242\u2013269. Springer, Heidelberg (1985)"},{"issue":"9","key":"31_CR4","first-page":"945","volume":"J68-A","author":"H. Yamamoto","year":"1985","unstructured":"Yamamoto, H.: On secret sharing systems using (k,L,n) threshold scheme. IEICE Trans. Fundamentals (Japanese Edition)\u00a0J68-A(9), 945\u2013952 (1985)","journal-title":"IEICE Trans. Fundamentals (Japanese Edition)"},{"key":"31_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1007\/3-540-48285-7_11","volume-title":"Advances in Cryptology - EUROCRYPT \u201993","author":"K. Kurosawa","year":"1994","unstructured":"Kurosawa, K., Okada, K., Sakano, K., Ogata, W., Tsujii, T.: Non perfect secret sharing schemes and matroids. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol.\u00a0765, pp. 126\u2013141. Springer, Heidelberg (1994)"},{"issue":"8","key":"31_CR6","first-page":"690","volume":"4","author":"W. Ogata","year":"1998","unstructured":"Ogata, W., Kurosawa, K.: Some basic properties of general nonperfect secret sharing schemes. J. Universal Computer Science\u00a04(8), 690\u2013704 (1998)","journal-title":"J. Universal Computer Science"},{"key":"31_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/BFb0000422","volume-title":"Advances in Cryptology - ASIACRYPT \u201994","author":"K. Okada","year":"1995","unstructured":"Okada, K., Kurosawa, K.: Lower bound on the size of shares of nonperfect secret sharing schemes. In: Safavi-Naini, R., Pieprzyk, J.P. (eds.) ASIACRYPT 1994. LNCS, vol.\u00a0917, pp. 34\u201341. Springer, Heidelberg (1995)"},{"key":"31_CR8","unstructured":"Ishizu, H., Ogihara, T.: A study on long-term storage of electronic data. In: Proc. IEICE General Conf., vol.\u00a0D-9-10(1), p. 125 (2004) (in Japanese)"},{"key":"31_CR9","unstructured":"Fujii, Y., Tada, M., Hosaka, N., Tochikubo, K., Kato, T.: A fast (2,n)-threshold scheme and its application. In: Proc. CSS 2005, pp. 631\u2013636 (2005) (in Japanese)"},{"key":"31_CR10","unstructured":"Hosaka, N., Tochikubo, K., Fujii, Y., Tada, M., Kato, T.: (2,n)-threshold secret sharing systems based on binary matrices. In: Proc. SCIS. pp. 2D1\u20134 (2007) (in Japanese)"},{"issue":"1","key":"31_CR11","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1093\/ietfec\/e91-a.1.127","volume":"E91-A","author":"J. Kurihara","year":"2008","unstructured":"Kurihara, J., Kiyomoto, S., Fukushima, K., Tanaka, T.: A fast (3,n)-threshold secret sharing scheme using exclusive-or operations. IEICE Trans. Fundamentals,\u00a0E91-A(1), 127\u2013138 (2008)","journal-title":"IEICE Trans. Fundamentals,"},{"key":"31_CR12","unstructured":"Shiina, N., Okamoto, T., Okamoto, E.: How to convert 1-out-of-n proof into k-out-of-n proof. In: Proc. SCIS 2004, pp. 1435\u20131440 (2004) (in Japanese)"},{"key":"31_CR13","unstructured":"Kunii, H., Tada, M.: A note on information rate for fast threshold schemes. In: Proc. CSS 2006, pp. 101\u2013106 (2006) (in Japanese)"},{"issue":"1","key":"31_CR14","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1109\/TIT.1983.1056621","volume":"29","author":"E.D. Karnin","year":"1983","unstructured":"Karnin, E.D., Greene, J.W., Hellman, M.E.: On secret sharing systems. IEEE Trans. Inform. Theory\u00a029(1), 35\u201341 (1983)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"31_CR15","first-page":"35","volume":"6","author":"R.M. Capocelli","year":"1983","unstructured":"Capocelli, R.M., De Santis, A., Gargano, L., Vaccaro, U.: On the size of shares for secret sharing schemes. J. Cryptology\u00a06, 35\u201341 (1983)","journal-title":"J. Cryptology"},{"key":"31_CR16","series-title":"Lecture Notes in Computer Science","first-page":"149","volume-title":"Advances in Cryptology - CRYPTO \u201992","author":"C. Blundo","year":"1993","unstructured":"Blundo, C., De Santis, A., Gargano, L., Vaccaro, U.: On the information rate of secret sharing schemes. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol.\u00a0740, pp. 149\u2013169. Springer, Heidelberg (1993)"},{"issue":"1","key":"31_CR17","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1109\/18.272461","volume":"40","author":"D.R. Stinson","year":"1994","unstructured":"Stinson, D.R.: Decomposition constructions for secret sharing schemes. IEEE Trans. Inform. Theory\u00a040(1), 118\u2013125 (1994)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"31_CR18","volume-title":"Cryptography: Theory and Practice","author":"D.R. Stinson","year":"1995","unstructured":"Stinson, D.R.: Cryptography: Theory and Practice. CRC Press, Florida (1995)"},{"key":"31_CR19","unstructured":"Poettering, B.: SSSS: Shamir\u2019s Secret Sharing Scheme, http:\/\/point-at-infinity.org\/ssss\/"}],"container-title":["Lecture Notes in Computer Science","Information Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85886-7_31.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:36:02Z","timestamp":1606185362000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-85886-7_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540858843","9783540858867"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85886-7_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[]}}