{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T18:11:16Z","timestamp":1778263876317,"version":"3.51.4"},"publisher-location":"Boston, MA","reference-count":17,"publisher":"Springer US","isbn-type":[{"value":"9781441959058","type":"print"},{"value":"9781441959065","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-1-4419-5906-5_389","type":"book-chapter","created":{"date-parts":[[2011,10,27]],"date-time":"2011-10-27T09:52:10Z","timestamp":1319709130000},"page":"1095-1097","source":"Crossref","is-referenced-by-count":1,"title":["Secret Sharing Schemes"],"prefix":"10.1007","author":[{"given":"G. R.","family":"Blakley","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gregory","family":"Kabatiansky","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"389_CR1_389","first-page":"313","volume-title":"Proceedings of AFIPS 1979 national computer conference","author":"R Blakley","year":"1979","unstructured":"Blakley R (1979) Safeguarding cryptographic keys. In: Proceedings of AFIPS 1979 national computer conference, vol\u00a048. New York, pp\u00a0313\u2013317"},{"issue":"1","key":"389_CR2_389","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A Shamir","year":"1979","unstructured":"Shamir A (1979) How to share a secret. Commun ACM 22(1):612\u2013613","journal-title":"Commun ACM"},{"key":"389_CR3_389","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/BF02620229","volume":"6","author":"M Ito","year":"1993","unstructured":"Ito M, Saito A, Nishizeki T (1993) Multiple assignment scheme for sharing secret. J Cryptol 6:15\u201320","journal-title":"J Cryptol"},{"issue":"1","key":"389_CR4_389","first-page":"231","volume":"29","author":"ED Karnin","year":"1983","unstructured":"Karnin ED, Greene JW, Hellman ME (1983) On secret sharing systems. IEEE Trans Inform Theory 29(1):231\u2013241","journal-title":"IEEE Trans Inform Theory"},{"key":"389_CR5_389","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF00198463","volume":"6","author":"RM Capocelli","year":"1993","unstructured":"Capocelli RM, De\u00a0Santis A, Gargano L, Vaccaro U (1993) On the size of shares for secret sharing schemes. J Cryptol 6: 157\u2013167","journal-title":"J Cryptol"},{"key":"389_CR6_389","first-page":"123","volume":"4","author":"EF Brickell","year":"1991","unstructured":"Brickell EF, Davenport DM (1991) On the classification of ideal secret sharing schemes. J Cryptol 4:123\u2013134","journal-title":"J Cryptol"},{"issue":"3","key":"389_CR7_389","first-page":"102","volume":"33","author":"GR Blakley","year":"1997","unstructured":"Blakley GR, Kabatianski GA (1997) Generalized ideal secret sharing schemes and matroids.\u00a0Prob Inform Transm 33(3): 102\u2013110","journal-title":"Prob Inform Transm"},{"key":"389_CR8_389","series-title":"Lecture notes in computer science","first-page":"126","volume-title":"Advances in cryptology EUROCRYPT\u201993","author":"K Kurosawa","year":"1993","unstructured":"Kurosawa K, Okada K, Sakano K, Ogata W, Tsujii S (1993) Nonperfect secret sharing schemes and matroids. In: Advances in cryptology EUROCRYPT\u201993. Lecture notes in computer science, vol 765. Springer, Berlin, pp\u00a0126\u2013141"},{"key":"389_CR9_389","first-page":"249","volume":"28","author":"W-A Jackson","year":"1998","unstructured":"Jackson W-A, Martin KM (1998) Combinatorial models for perfect secret sharing schemes. J Combin Math Combin Comput 28:249\u2013265","journal-title":"J Combin Math Combin Comput"},{"key":"389_CR10_389","volume-title":"Matroid theory","author":"DJA Welsh","year":"1976","unstructured":"Welsh DJA (1976) Matroid theory. Academic Press, London"},{"key":"389_CR11_389","series-title":"Lecture notes in computer science","first-page":"13","volume-title":"Advances in cryptology EUROCRYPT\u201994","author":"L Csirmaz","year":"1994","unstructured":"Csirmaz L (1994) The size of a share must be large. In: Advances in cryptology EUROCRYPT\u201994., Lecture notes in computer science, vol\u00a0950. Springer, Berlin, pp\u00a013\u201322"},{"key":"389_CR12_389","series-title":"Lecture notes in computer science","first-page":"33","volume-title":"Error control, cryptology and speech compression","author":"GR Blakley","year":"1994","unstructured":"Blakley GR, Kabatianski GA (1994) Linear algebra approach to secret sharing schemes. In: Error control, cryptology and speech compression. Lecture notes in computer science, vol\u00a0829. Springer, Berlin, pp\u00a033\u201340"},{"key":"389_CR13_389","series-title":"Lecture notes in computer science","first-page":"23","volume-title":"Advances in cryptology EUROCRYPT\u201994","author":"M van Dijk","year":"1995","unstructured":"van Dijk M (1995) A linear construction of perfect secret sharing schemes. In: Advances in cryptology EUROCRYPT\u201994. Lecture notes in computer science, vol\u00a0950. Springer, Berlin, pp\u00a023\u201334"},{"key":"389_CR14_389","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1145\/358746.358762","volume":"24","author":"RJ McEliece","year":"1981","unstructured":"McEliece RJ, Sarwate DV (1981) On secret sharing and Reed-Solomon code. Commun ACM 24:583\u2013584","journal-title":"Commun ACM"},{"issue":"2","key":"389_CR15_389","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1023\/A:1008244215660","volume":"14","author":"A Ashihmin","year":"1998","unstructured":"Ashihmin A, Simonis J (1998) Almost affine codes. Design Code Cryptogr 14(2):179\u2013197","journal-title":"Design Code Cryptogr"},{"key":"389_CR16_389","first-page":"246","volume-title":"Proceedings sixth joint Swedish-Russian workshop on information theory","author":"J Massey","year":"1993","unstructured":"Massey J (1993) Minilal codewords and secret sharing. In: Proceedings sixth joint Swedish-Russian workshop on information theory. Molle, Sweden, pp 246\u2013249"},{"issue":"5","key":"389_CR17_389","first-page":"1887","volume":"44","author":"A Beimel","year":"1998","unstructured":"Beimel A, Chor B (1998) Secret sharing with public reconstruction. IEEE Trans Inform Theory 44(5):1887\u20131896","journal-title":"IEEE Trans Inform Theory"}],"container-title":["Encyclopedia of Cryptography and Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4419-5906-5_389","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T17:48:59Z","timestamp":1778262539000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-1-4419-5906-5_389"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9781441959058","9781441959065"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-1-4419-5906-5_389","relation":{},"subject":[],"published":{"date-parts":[[2011]]}}}