{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T17:42:37Z","timestamp":1742924557124,"version":"3.40.3"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319224244"},{"type":"electronic","value":"9783319224251"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-22425-1_13","type":"book-chapter","created":{"date-parts":[[2015,8,19]],"date-time":"2015-08-19T14:42:31Z","timestamp":1439995351000},"page":"213-222","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Almost Optimum Secret Sharing Schemes with Cheating Detection for Random Bit Strings"],"prefix":"10.1007","author":[{"given":"Hidetaka","family":"Hoshino","sequence":"first","affiliation":[]},{"given":"Satoshi","family":"Obana","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,8,20]]},"reference":[{"issue":"6","key":"13_CR1","doi-asserted-by":"publisher","first-page":"1338","DOI":"10.1587\/transfun.E94.A.1338","volume":"E94\u2013A","author":"T Araki","year":"2011","unstructured":"Araki, T., Ogata, W.: A simple and efficient secret sharing scheme secure against cheating. IEICE Trans. Fundam. E94\u2013A(6), 1338\u20131345 (2011)","journal-title":"IEICE Trans. Fundam."},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"Blakley, G.R.: Safeguarding cryptographic keys. In: Proceedings AFIPS 1979, National Computer Conference, vol. 48, pp. 313\u2013137 (1979)","DOI":"10.1109\/MARK.1979.8817296"},{"issue":"4","key":"13_CR3","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1137\/0404044","volume":"4","author":"EF Brickell","year":"1991","unstructured":"Brickell, E.F., Stinson, D.R.: The detection of cheaters in threshold schemes. SIAM J. Discret. Math. 4(4), 502\u2013510 (1991)","journal-title":"SIAM J. Discret. Math."},{"key":"13_CR4","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1023\/A:1013856431727","volume":"25","author":"S Cabello","year":"2002","unstructured":"Cabello, S., Padr\u00f3, C., S\u00e1ez, G.: Secret sharing schemes with detection of cheaters for a general access structure. Des. Codes Crypt. 25, 175\u2013188 (2002)","journal-title":"Des. Codes Crypt."},{"key":"13_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/3-540-48285-7_10","volume-title":"Advances in Cryptology - EUROCRYPT \u201993","author":"M Carpentieri","year":"1994","unstructured":"Carpentieri, M., De Santis, A., Vaccaro, U.: Size of shares and probability of cheating in threshold schemes. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol. 765, pp. 118\u2013125. Springer, Heidelberg (1994)"},{"key":"13_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1007\/978-3-319-09843-2_7","volume-title":"Advances in Information and Computer Security","author":"S Obana","year":"2014","unstructured":"Obana, S., Tsuchida, K.: Cheating detectable secret sharing schemes supporting an arbitrary finite field. In: Yoshida, M., Mouri, K. (eds.) IWSEC 2014. LNCS, vol. 8639, pp. 88\u201397. Springer, Heidelberg (2014)"},{"issue":"11","key":"13_CR7","doi-asserted-by":"publisher","first-page":"2230","DOI":"10.1587\/transfun.E96.A.2230","volume":"E96\u2013A","author":"W Ogata","year":"2013","unstructured":"Ogata, W., Araki, T.: Cheating detectable secret sharing schemes for random bit strings. IEICE TRANS. FUNDAM. E96\u2013A(11), 2230\u20132234 (2013)","journal-title":"IEICE TRANS. FUNDAM."},{"issue":"1","key":"13_CR8","doi-asserted-by":"publisher","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. Discret. Math. 20(1), 79\u201395 (2006)","journal-title":"SIAM J. Discret. Math."},{"issue":"11","key":"13_CR9","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A Shamir","year":"1979","unstructured":"Shamir, A.: How to share a secret. Commun. ACM 22(11), 612\u2013613 (1979)","journal-title":"Commun. ACM"},{"issue":"3","key":"13_CR10","doi-asserted-by":"publisher","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":["Lecture Notes in Computer Science","Advances in Information and Computer Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-22425-1_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,15]],"date-time":"2023-02-15T14:31:21Z","timestamp":1676471481000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-22425-1_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319224244","9783319224251"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-22425-1_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"20 August 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}