{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T16:08:05Z","timestamp":1774022885648,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642322839","type":"print"},{"value":"9783642322846","type":"electronic"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32284-6_11","type":"book-chapter","created":{"date-parts":[[2012,8,1]],"date-time":"2012-08-01T14:14:37Z","timestamp":1343830477000},"page":"187-204","source":"Crossref","is-referenced-by-count":9,"title":["Optimum General Threshold Secret Sharing"],"prefix":"10.1007","author":[{"given":"Maki","family":"Yoshida","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Toru","family":"Fujiwara","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marc","family":"Fossorier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","unstructured":"Bai, L.: A strong ramp secret sharing scheme using matrix projection. In: The 2006 Int\u2019l Symp. on a World of Wireless, Mobile and Multimedia Networks, pp. 652\u2013656 (2006)"},{"key":"11_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/978-3-642-20901-7_2","volume-title":"Coding and Cryptology","author":"A. Beimel","year":"2011","unstructured":"Beimel, A.: Secret-Sharing Schemes: A Survey. In: Chee, Y.M., Guo, Z., Ling, S., Shao, F., Tang, Y., Wang, H., Xing, C. (eds.) IWCC 2011. LNCS, vol.\u00a06639, pp. 11\u201346. Springer, Heidelberg (2011)"},{"key":"11_CR3","doi-asserted-by":"publisher","first-page":"5634","DOI":"10.1109\/TIT.2011.2162183","volume":"57","author":"A. Beimel","year":"2011","unstructured":"Beimel, A., Orlov, I.: Secret sharing and non-Shannon information inequalities. IEEE Trans. on Information Theory\u00a057, 5634\u20135649 (2011)","journal-title":"IEEE Trans. on Information Theory"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Blakley, G.R.: Safeguarding cryptographic keys. In: AFIPS 1979 Nat. Comput. Conf. vol.\u00a048, pp. 313\u2013317 (1979)","DOI":"10.1109\/MARK.1979.8817296"},{"key":"11_CR5","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\u2013268. Springer, Heidelberg (1985)"},{"key":"11_CR6","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF00198463","volume":"6","author":"R.M. Capocelli","year":"1993","unstructured":"Capocelli, R.M., De Santis, A., Gargano, L., Vaccaro, U.: On the size of shares for secret sharing schemes. J. of Cryptology\u00a06, 157\u2013168 (1993)","journal-title":"J. of Cryptology"},{"key":"11_CR7","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/s001459900029","volume":"10","author":"L. Csirmaz","year":"1997","unstructured":"Csirmaz, L.: The size of a share must be large. J. of Cryptology\u00a010, 223\u2013231 (1997)","journal-title":"J. of Cryptology"},{"key":"11_CR8","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. Inform. Processing Letters\u00a097, 52\u201357 (2006)","journal-title":"Inform. Processing Letters"},{"key":"11_CR9","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. on Information Theory\u00a029, 35\u201341 (1983)","journal-title":"IEEE Trans. on Information Theory"},{"key":"11_CR10","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, S.: Nonperfect Secret Sharing Schemes and Matroids. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol.\u00a0765, pp. 126\u2013141. Springer, Heidelberg (1994)"},{"key":"11_CR11","series-title":"Lecture Notes in Computer Science","first-page":"34","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":"11_CR12","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. of the ACM\u00a022, 612\u2013613 (1979)","journal-title":"Comm. of the ACM"},{"key":"11_CR13","first-page":"945","volume":"68","author":"H. Yamamoto","year":"1985","unstructured":"Yamamoto, H.: On secret sharing systems using (k,L,n) threshold scheme. IECE Trans.\u00a0J68-A, 945\u2013952 (1985) (in Japanese). English transl.: Electron. Comm. Japan Part I. 69, 46\u201354 (1986)","journal-title":"IECE Trans."},{"key":"11_CR14","unstructured":"Yoneyama, K., Kunihiro, N., Santoso, B., Ohta, K.: Non-linear function ramp scheme. In: The 2004 Int\u2019l Symp. on Inform. Theory and its Appli., pp. 788\u2013793 (2004)"},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"Yoshida, M., Fujiwara, T.: A secure construction for the nonlinear function threshold ramp secret sharing scheme. In: The 2007 Int\u2019l Symp. on Inform. Theory, CD-ROM (2007)","DOI":"10.1109\/ISIT.2007.4557361"}],"container-title":["Lecture Notes in Computer Science","Information Theoretic Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32284-6_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,12]],"date-time":"2020-07-12T05:33:35Z","timestamp":1594532015000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32284-6_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642322839","9783642322846"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32284-6_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}