{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:25:54Z","timestamp":1725456354095},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540640400"},{"type":"electronic","value":"9783540696889"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0028171","type":"book-chapter","created":{"date-parts":[[2005,11,22]],"date-time":"2005-11-22T06:50:22Z","timestamp":1132642222000},"page":"207-216","source":"Crossref","is-referenced-by-count":12,"title":["On ideal non-perfect secret sharing schemes"],"prefix":"10.1007","author":[{"given":"Pascal","family":"Paillier","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,15]]},"reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"J. Benaloh and J. Leichter, Generalized secret sharing and monotone functions, LNCS 403, Advances in Cryptology, Proceedings of Crypto'88, Springer Verlag, pp. 27\u201336, 1990.","DOI":"10.1007\/0-387-34799-2_3"},{"key":"17_CR2","first-page":"313","volume":"48","author":"G. Blakley","year":"1979","unstructured":"G. Blakley, Safeguarding cryptographic keys, Proceedings of AFIPS 1979 National Computer Conference, vol. 48, 1979, pp. 313\u2013317.","journal-title":"Proceedings of AFIPS 1979 National Computer Conference"},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"G. Blakley and G. Kabatianski, On general perfect secret sharing schemes, LNCS 963, Advances in Cryptology, Proceedings of Crypto'95, Springer Verlag, pp. 367\u2013371, 1995","DOI":"10.1007\/3-540-44750-4_29"},{"key":"17_CR4","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/BF00196772","volume":"4","author":"E. Brickell","year":"1991","unstructured":"E. Brickell and D. Davenport, On the classification of ideal secret sharing schemes, Journal of Cryptology, vol. 4, 1991, pp. 123\u2013134.","journal-title":"Journal of Cryptology"},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"L. Csirmaz, The size of a share must be large, LNCS 950, Advances in Cryptology, Proceedings of Eurocrypt'94, Springer Verlag, pp. 13\u201322, 1994.","DOI":"10.1007\/BFb0053420"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"Y. Desmedt, G. Di Crescenzo and M. Burmester, Multiplicative non-abelian sharing schemes and their applications to threshold cryptography, LNCS 917, Advances in Cryptology, Proceedings of Asiacrypt'94, Springer Verlag, PP. 21\u201332,1994.","DOI":"10.1007\/BFb0000421"},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"S. Droste, New results on visual cryptography, LNCS 1109, Advances in Cryptology, Proceedings of Crypto'96, Springer Verlag, pp. 401\u2013415,1996.","DOI":"10.1007\/3-540-68697-5_30"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"W. Jackson, K. Martin and C. O'Keefe, On sharing many secrets, LNCS 917, Advances in Cryptology, Proceedings of Asiacrypt'94, Springer Verlag, pp. 42\u201354, 1994.","DOI":"10.1007\/BFb0000423"},{"key":"17_CR9","unstructured":"M. Itoh, A. Saito and T. Nishizeki, Secret sharing scheme realizing general access structure, Proceedings of IEEE Globecom'87, Tokyo, pp. 99\u2013102, 1987."},{"issue":"1","key":"17_CR10","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1109\/TIT.1983.1056621","volume":"IT-29","author":"E. Karnin","year":"1983","unstructured":"E. Karnin, J. Green and M. Hellman, On secret sharing systems, IEEE Trans. Information Theory, vol. IT-29, no. 1, pp. 35\u201341, 1983.","journal-title":"IEEE Trans. Information Theory"},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"K. Kurosawa, K. Okada, K. Sakano, W. Ogata and S. Tsujii, Nonperfect secret sharing schemes and matroids, LNCS 765, Advances in Cryptology, Proceedings of Eurocrypt'93, Springer Verlag, p. 126\u2013141.","DOI":"10.1007\/3-540-48285-7_11"},{"key":"17_CR12","doi-asserted-by":"crossref","unstructured":"K. Okada and K. Kurosawa, Lower bound on the size of shares of nonperfect secret sharing schemes, LNCS 917, Advances in Cryptology, Proceedings of Asiacrypt'94, Springer-Verlag, pp. 33\u201341, Dec. 1994.","DOI":"10.1007\/BFb0000422"},{"issue":"11","key":"17_CR13","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A. Shamir","year":"1979","unstructured":"A. Shamir, How to share a secret, Communications of the ACM, vol. 22, n.11, pp. 612\u2013613, Nov. 1979.","journal-title":"Communications of the ACM"},{"key":"17_CR14","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1007\/BF00125203","volume":"2","author":"D. Stinson","year":"1992","unstructured":"D. Stinson, An explication of secret sharing schemes, Designs, Codes and Cryptography, vol. 2, pp. 357\u2013390, 1992.","journal-title":"Designs, Codes and Cryptography"}],"container-title":["Lecture Notes in Computer Science","Security Protocols"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0028171","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T02:49:33Z","timestamp":1586573373000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0028171"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540640400","9783540696889"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/bfb0028171","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}