{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,22]],"date-time":"2025-11-22T10:49:08Z","timestamp":1763808548179},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540593393"},{"type":"electronic","value":"9783540492368"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/bfb0000422","type":"book-chapter","created":{"date-parts":[[2005,10,7]],"date-time":"2005-10-07T15:27:29Z","timestamp":1128698849000},"page":"33-41","source":"Crossref","is-referenced-by-count":13,"title":["Lower bound on the size of shares of nonperfect secret sharing schemes"],"prefix":"10.1007","author":[{"given":"Koji","family":"Okada","sequence":"first","affiliation":[]},{"given":"Kaoru","family":"Kurosawa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,9,8]]},"reference":[{"key":"3_CR1","first-page":"313","volume":"48","author":"G.R. Blakley","year":"1979","unstructured":"G.R.Blakley: Safeguarding cryptographic keys. Proc. of the AFIPS 1979 National Computer Conference, vol. 48, pp. 313\u2013317 (1979)","journal-title":"Proc. of the AFIPS 1979 National Computer Conference"},{"issue":"No.1","key":"3_CR2","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/BF02620229","volume":"6","author":"A. Shamir","year":"1993","unstructured":"A.Shamir: How to share a secret. Journal of Cryptology, vol. 6, No.1, pp. 15\u201320 (1993)","journal-title":"Journal of Cryptology"},{"key":"3_CR3","unstructured":"M.Itoh, A.Saito and T.Nishizeki: Secret sharing scheme realizing general access structure. Proc. of IEEE Globecom '87, Tokyo, pp.99\u2013102 (1987) Also, Multiple assignment scheme for sharing secret. Journal of Cryptology, vol.6, No.1, pp.15\u201320 (1993)"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"J.C.Benaloh and J.Leichter: Generalized secret sharing and monotone functions. Crypto'88, pp.27\u201336 (1990)","DOI":"10.1007\/0-387-34799-2_3"},{"issue":"No.1","key":"3_CR5","first-page":"35","volume":"IT-29","author":"E.D. Karnin","year":"1982","unstructured":"E.D.Karnin, J.W.Green and M.E.Hellman: On secret sharing systems. IEEE Trans. IT-29, No.1, pp. 35\u201341 (1982)","journal-title":"IEEE Trans."},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"G.R.Blakeley and C.Meadows: Security of ramp schemes. Crypto'84, pp.242\u2013268 (1984)","DOI":"10.1007\/3-540-39568-7_20"},{"issue":"No.2","key":"3_CR7","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/BF00196772","volume":"4","author":"E.F. Brickell","year":"1991","unstructured":"E.F.Brickell and D.M.Davenport: On the classification of ideal secret sharing schemes. Journal of Cryptology, vol. 4, No.2, pp. 123\u2013134 (1991)","journal-title":"Journal of Cryptology"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"R.M.Capocelli, A.De Santis, L.Gargano and U.Vaccaro: On the size of shares for secret sharing schemes. Crypto'91, pp.101\u2013113 (1991)","DOI":"10.1007\/3-540-46766-1_7"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"E.F.Brickell and D.R.Stinson: Some improved bounds on the information rate of perfect secret sharing schemes. Crypto'90, pp.242\u2013252 (1990)","DOI":"10.1007\/3-540-38424-3_17"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"C.Blund, A.De Santis, D.R.Stinson and U.Vaccaro: Graph decomposition and secret sharing schemes. Eurocrypt'92, pp.1\u201320 (1992)","DOI":"10.1007\/3-540-47555-9_1"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"C.Blund, A.De Santis, L.Gargano and U.Vaccaro: On the information rate of secret sharing schemes. Crypto'92 (1992)","DOI":"10.1007\/3-540-48071-4_11"},{"key":"3_CR12","unstructured":"D.R.Stinson: New general bounds on the information rate of secret sharing schemes. Crypto'92 (1992)"},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"M.Franklin and M.Yung: Communication complexity of secure computation. STOC'92, pp.699\u2013710 (1992)","DOI":"10.1145\/129712.129780"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"C.Blund, A.De Santis and U.Vaccaro: Efficient sharing of many secrets. STACS'93, pp.692\u2013703 (1993)","DOI":"10.1007\/3-540-56503-5_68"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"W.Ogata, K.Kurosawa and S.Tsujii: Nonperfect secret sharing schemes. Auscrypt'92 (1992)","DOI":"10.1007\/3-540-57220-1_52"},{"key":"3_CR16","unstructured":"K.Kurosawa, K.Okada, K.Sakano, W.Ogata and S.Tsujii: Nonperfect secret sharing schemes and matroids. Eurocrypt'93 (1993)"},{"key":"3_CR17","volume-title":"Information Theory and Reliable Communications","author":"R.G. Gallager","year":"1968","unstructured":"R.G.Gallager: Information Theory and Reliable Communications. John Wiley & Sons, New York, NY (1968)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 ASIACRYPT'94"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0000422","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,10]],"date-time":"2020-04-10T06:18:24Z","timestamp":1586499504000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0000422"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540593393","9783540492368"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/bfb0000422","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}