{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T18:06:11Z","timestamp":1776881171536,"version":"3.51.2"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2009,1,11]],"date-time":"2009-01-11T00:00:00Z","timestamp":1231632000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2009,7]]},"DOI":"10.1007\/s10623-008-9265-8","type":"journal-article","created":{"date-parts":[[2009,1,10]],"date-time":"2009-01-10T10:47:02Z","timestamp":1231584422000},"page":"15-24","source":"Crossref","is-referenced-by-count":73,"title":["Detection and identification of cheaters in (t, n) secret sharing scheme"],"prefix":"10.1007","volume":"52","author":[{"given":"Lein","family":"Harn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Changlu","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,1,11]]},"reference":[{"key":"9265_CR1","unstructured":"Araki T.: Efficient (k, n) threshold secret sharing schemes secure against cheating from n \u2013 1 cheaters. In: Proceedings of ACISP\u201907, LNCS, vol. 4586, pp. 13\u2013142. Springer-Verlag (2007)."},{"key":"9265_CR2","unstructured":"Bhndo C., De Santis A., Gargano L., Vaccaro U.: Secret sharing schemes with veto capabilities. In: Proceedings of the First French-Israeli Workshop on Algebraic Coding, LNCS, vol. 781, pp. 82\u201389. Springer-Verlag (1993)."},{"key":"9265_CR3","unstructured":"Blakley G.R.: Safeguarding cryptographic keys. In: Proceedings of AFIPS\u201979, vol. 48, pp. 313\u2013317 (1979)."},{"key":"9265_CR4","doi-asserted-by":"crossref","unstructured":"Brickell E.F., Stinson D.R.: The detection of cheaters in threshold schemes. In: Proceedings of Crypto\u201988, LNCS, vol. 403, pp. 564\u2013577. Springer-Verlag (1990).","DOI":"10.1007\/0-387-34799-2_40"},{"issue":"3","key":"9265_CR5","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/BF01388382","volume":"5","author":"M. Carpentieri","year":"1995","unstructured":"Carpentieri M.: A perfect threshold secret sharing scheme to identify cheaters. Des. Codes Cryptogr. 5(3), 183\u2013187 (1995)","journal-title":"Des. Codes Cryptogr."},{"key":"9265_CR6","doi-asserted-by":"crossref","unstructured":"Carpentieri M., De Santis A., Vaccaro U.: Size of shares and probability of cheating in threshold schemes. In: Proceedings of Eurocrypt\u201993, LNCS, vol. 765, pp. 118\u2013125. Springer-Verlag (1994).","DOI":"10.1007\/3-540-48285-7_10"},{"key":"9265_CR7","doi-asserted-by":"crossref","unstructured":"Charnes C., Pieprzyk J., Safavi-Naini R.: Conditionally secure secret sharing scheme with disenrolment capability. In: Proceedings of CCS\u201994, pp. 89\u201395. ACM (1994).","DOI":"10.1145\/191177.191196"},{"issue":"3","key":"9265_CR8","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1023\/A:1008200702849","volume":"14","author":"J. He","year":"1998","unstructured":"He J., Dawson E.: Shared secret reconstruction. Des. Codes Cryptogr. 14(3), 221\u2013237 (1998)","journal-title":"Des. Codes Cryptogr."},{"key":"9265_CR9","unstructured":"Kurosawa K., Obana S., Ogata W.: t-cheater identifiable (k, n) secret sharing schemes. In: Proceedings of Crypto\u201995, LNCS, vol. 963, pp. 410\u2013423. Springer-Verlag (1995)."},{"key":"9265_CR10","unstructured":"Lin H.Y., Harn L.: A generalized secret sharing scheme with cheater detection. In: Proceedings of Asiacrypt\u201991, LNCS, vol. 739, pp. 149\u2013158. Springer-Verlag (1991)."},{"key":"9265_CR11","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1145\/358746.358762","volume":"24","author":"R.J. McEliece","year":"1981","unstructured":"McEliece R.J., Sarwate D.V.: On sharing secrets and Reed-Solomon codes. Comm. ACM 24, 583\u2013584 (1981)","journal-title":"Comm. ACM"},{"issue":"1","key":"9265_CR12","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1137\/S0895480100378689","volume":"20","author":"W. Ogata","year":"2006","unstructured":"Ogata W., Kurosawa K., Stinson D.R.: Optimum secret sharing scheme secure against cheating. SIAM J. Discrete Math. 20(1), 79\u201395 (2006)","journal-title":"SIAM J. Discrete Math."},{"key":"9265_CR13","doi-asserted-by":"crossref","unstructured":"Pieprzyk J., Zhang X.M.: Cheating prevention in linear secret sharing. In: Proceedings of ACISP\u201902, LNCS, vol. 2384, pp. 121\u2013135. Springer-Verlag (2002).","DOI":"10.1007\/3-540-45450-0_9"},{"key":"9265_CR14","doi-asserted-by":"crossref","unstructured":"Rabin T., Ben-Or M.: Verifiable secret sharing and multiparty protocols with honest majority. In: Proceedings of the 21st Annual ACM Symposium on the Theory of Computing, pp. 73\u201385 (1989).","DOI":"10.1145\/73007.73014"},{"issue":"11","key":"9265_CR15","doi-asserted-by":"crossref","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A. Shamir","year":"1979","unstructured":"Shamir A.: How to share a secret. Comm. ACM 22(11), 612\u2013613 (1979)","journal-title":"Comm. ACM"},{"key":"9265_CR16","unstructured":"Simmons G.: An introduction to shared secret schemes and their applications. Sandia Report SAND 88-2298 (1988)."},{"key":"9265_CR17","doi-asserted-by":"crossref","unstructured":"Tartary C., Wang H.: Dynamic threshold and cheater resistance for shamir secret sharing scheme. In: Proceedings of Inscrypt\u201906, LNCS, vol. 4318, pp. 103\u2013117. Springer-Verlag (2006).","DOI":"10.1007\/11937807_9"},{"issue":"3","key":"9265_CR18","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/BF02252871","volume":"1","author":"M. Tompa","year":"1989","unstructured":"Tompa M., Woll H.: How to share a secret with cheaters. J. Cryptol. 1(3), 133\u2013138 (1989)","journal-title":"J. Cryptol."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-008-9265-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-008-9265-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-008-9265-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T19:58:25Z","timestamp":1559246305000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-008-9265-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,1,11]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,7]]}},"alternative-id":["9265"],"URL":"https:\/\/doi.org\/10.1007\/s10623-008-9265-8","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,1,11]]}}}