{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T14:41:44Z","timestamp":1753886504701},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540611868"},{"type":"electronic","value":"9783540683391"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-68339-9_18","type":"book-chapter","created":{"date-parts":[[2007,8,6]],"date-time":"2007-08-06T01:31:14Z","timestamp":1186363874000},"page":"200-211","source":"Crossref","is-referenced-by-count":20,"title":["Optimum Secret Sharing Scheme Secure against Cheating"],"prefix":"10.1007","author":[{"given":"Wakaha","family":"Ogata","sequence":"first","affiliation":[]},{"given":"Kaoru","family":"Kurosawa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,7,13]]},"reference":[{"key":"18_CR1","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/BF02252871","volume":"1","author":"M. Tompa","year":"1988","unstructured":"M. Tompa and H. Woll. \u201cHow to share a secret with cheaters\u201d. In Journal of Cryptology, vol. 1, pages 133\u2013138, 1988.","journal-title":"Journal of Cryptology"},{"key":"18_CR2","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A. Shamir","year":"1979","unstructured":"A. Shamir. \u201cHow to Share a Secret\u201d. In Communications of the ACM, vol.22, no. 11, pages 612\u2013613, 1979.","journal-title":"Communications of the ACM"},{"key":"18_CR3","first-page":"313","volume":"48","author":"G.R. Blakely","year":"1979","unstructured":"G.R. Blakely. \u201cSafeguarding cryptographic keys\u201d. In Proc. of the AFIPS 1979 National Computer Conference, vol.48, pages 313\u2013317, 1979.","journal-title":"Proc. of the AFIPS 1979 National Computer Conference"},{"key":"18_CR4","first-page":"35","volume":"1","author":"E.D. Karnin","year":"1982","unstructured":"E.D. Karnin, J.W. Green, and M.E. Hellman. \u201cOn secret sharing systems\u201d. In IEEE Trans. IT-29, No.1, pages 35\u201341, 1982.","journal-title":"IEEE Trans. IT-29"},{"key":"18_CR5","series-title":"Lect Notes Comput Sci","first-page":"118","volume-title":"Proc. of Eurocrypto\u201993","author":"M. Carpentieri","year":"1993","unstructured":"M. Carpentieri, A. De Santis, and U. Vaccaro. \u201cSize of Shares and Probability of Cheating in Threshold Schemes\u201d. In Proc. of Eurocrypto\u201993, Lecture Notes in Computer Science, LNCS 765, Springer Verlag, pages 118\u2013125, 1993."},{"unstructured":"F.J. MacWilliams and N.J.A. Sloane. \u201cThe theory of error-correcting codes\u201d. In North-Holland, pages 397\u2013398, 1981.","key":"18_CR6"},{"unstructured":"T. Beth, T, D. Jungnickel and H. Lenz. \u201cDesign Theory\u201d. In Cambridge University Press, pages 260\u2013264, 1993.","key":"18_CR7"},{"key":"18_CR8","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1145\/358746.358762","volume":"24","author":"R.J. McEliece","year":"1981","unstructured":"R.J. McEliece and D.V. Sarwate. \u201cOn sharing secrets and Reed-Solomon codes\u201d. In Comm.ACM, 24, pages 583\u2013584, 1981.","journal-title":"Comm.ACM"},{"doi-asserted-by":"crossref","unstructured":"T. Rabin and M. Ben-Or. \u201cVerifiable secret sharing and multiparty protocols with honest majority\u201d. In Proc. 21st ACM Symposium on Theory of Computing, pages 73\u201385, 1989.","key":"18_CR9","DOI":"10.1145\/73007.73014"},{"issue":"4","key":"18_CR10","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1137\/0404044","volume":"4","author":"E.F. Brickell","year":"1991","unstructured":"E.F. Brickell and D.R. Stinson. \u201cThe Detection of Cheaters in Threshold Schemes\u201d. In SIAM J. DISC. MATH, Vol.4, No.4, pages 502\u2013510, 1991.","journal-title":"SIAM J. DISC. MATH"},{"issue":"3","key":"18_CR11","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/BF01388382","volume":"5","author":"M. Carpentieri","year":"1995","unstructured":"M. Carpentieri. \u201cA perfect threshold secrety sahring scheme to identify cheaters\u201d. In Designs, Codes and Cryptography, vol.5, no.3, pages 183\u2013187, 1995.","journal-title":"Designs, Codes and Cryptography"},{"key":"18_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1007\/3-540-44750-4_33","volume-title":"Proc. of Crypt\u201995","author":"K. Kurosawa","year":"1995","unstructured":"K. Kurosawa, S. Obana, and W. Ogata. \u201ct-cheater identifiable (k,n) threshold secret sharing schemes\u201d. In Proc. of Crypt\u201995, Lecture Notes in Computer Science, LNCS 963, Springer Verlag, pages 410\u2013423, 1995."},{"unstructured":"D.R. Stinson. \u201cCryptography: Theory and Practice\u201d. In CRC Press, pages 330\u2013331, 1995.","key":"18_CR13"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 EUROCRYPT \u201996"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-68339-9_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,21]],"date-time":"2019-02-21T01:24:40Z","timestamp":1550712280000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-68339-9_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540611868","9783540683391"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-68339-9_18","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1996]]}}}