{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T04:59:40Z","timestamp":1764997180663},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319979151"},{"type":"electronic","value":"9783319979168"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-97916-8_13","type":"book-chapter","created":{"date-parts":[[2018,7,25]],"date-time":"2018-07-25T12:13:24Z","timestamp":1532520804000},"page":"193-205","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Improvements to Almost Optimum Secret Sharing with Cheating Detection"],"prefix":"10.1007","author":[{"given":"Louis","family":"Cianciullo","sequence":"first","affiliation":[]},{"given":"Hossein","family":"Ghodosi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,7,26]]},"reference":[{"key":"13_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/978-3-540-73458-1_10","volume-title":"Information Security and Privacy","author":"T Araki","year":"2007","unstructured":"Araki, T., Obana, S.: Flaws in some secret sharing schemes against cheating. In: Pieprzyk, J., Ghodosi, H., Dawson, E. (eds.) ACISP 2007. LNCS, vol. 4586, pp. 122\u2013132. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-73458-1_10"},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation. In: Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, STOC 1988, pp. 1\u201310. ACM, New York (1988)","DOI":"10.1145\/62212.62213"},{"key":"13_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/3-540-47721-7_19","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 86","author":"JC Benaloh","year":"1987","unstructured":"Benaloh, J.C.: Secret sharing homomorphisms: keeping shares of a secret secret (extended abstract). In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 251\u2013260. Springer, Heidelberg (1987). https:\/\/doi.org\/10.1007\/3-540-47721-7_19"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Blakley, G.: Safeguarding cryptographic keys. In: Proceedings of the 1979 AFIPS National Computer Conference, pp. 313\u2013317. AFIPS Press, Monval (1979)","DOI":"10.1109\/MARK.1979.8817296"},{"issue":"2","key":"13_CR5","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(2), 175\u2013188 (2002)","journal-title":"Des. Codes Crypt."},{"key":"13_CR6","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 \u2014 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). https:\/\/doi.org\/10.1007\/3-540-48285-7_10"},{"key":"13_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/978-3-642-29011-4_13","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"A Cevallos","year":"2012","unstructured":"Cevallos, A., Fehr, S., Ostrovsky, R., Rabani, Y.: Unconditionally-secure robust secret sharing with compact shares. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 195\u2013208. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_13"},{"key":"13_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/978-3-540-78967-3_27","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"R Cramer","year":"2008","unstructured":"Cramer, R., Dodis, Y., Fehr, S., Padr\u00f3, C., Wichs, D.: Detection of algebraic manipulation with applications to robust secret sharing and fuzzy extractors. In: Smart, N. (ed.) EUROCRYPT 2008. LNCS, vol. 4965, pp. 471\u2013488. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78967-3_27"},{"key":"13_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/978-3-319-22425-1_13","volume-title":"Advances in Information and Computer Security","author":"H Hoshino","year":"2015","unstructured":"Hoshino, H., Obana, S.: Almost optimum secret sharing schemes with cheating detection for random bit strings. In: Tanaka, K., Suga, Y. (eds.) IWSEC 2015. LNCS, vol. 9241, pp. 213\u2013222. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-22425-1_13"},{"key":"13_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/978-3-319-24126-5_21","volume-title":"Security, Privacy, and Applied Cryptography Engineering","author":"MP Jhanwar","year":"2015","unstructured":"Jhanwar, M.P., Safavi-Naini, R.: Almost optimum secret sharing with cheating detection. In: Chakraborty, R.S., Schwabe, P., Solworth, J. (eds.) SPACE 2015. LNCS, vol. 9354, pp. 359\u2013372. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-24126-5_21"},{"key":"13_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/978-3-642-10230-1_8","volume-title":"Information Theoretic Security","author":"K Kurosawa","year":"2009","unstructured":"Kurosawa, K., Suzuki, K.: Almost secure (1-round, n-channel) message transmission scheme. In: Desmedt, Y. (ed.) ICITS 2007. LNCS, vol. 4883, pp. 99\u2013112. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-10230-1_8"},{"key":"13_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-09843-2_7"},{"key":"13_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/3-540-68339-9_18","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201996","author":"W Ogata","year":"1996","unstructured":"Ogata, W., Kurosawa, K.: Optimum secret sharing scheme secure against cheating. In: Maurer, U. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 200\u2013211. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-68339-9_18"},{"issue":"1","key":"13_CR14","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_CR15","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":"2","key":"13_CR16","first-page":"133","volume":"1","author":"M Tompa","year":"1988","unstructured":"Tompa, M., Woll, H.: How to share a secret with cheaters. J. Crypt. 1(2), 133\u2013138 (1988)","journal-title":"J. Crypt."}],"container-title":["Lecture Notes in Computer Science","Advances in Information and Computer Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-97916-8_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,21]],"date-time":"2019-10-21T07:48:21Z","timestamp":1571644101000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-97916-8_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319979151","9783319979168"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-97916-8_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}