{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T15:37:00Z","timestamp":1772725020247,"version":"3.50.1"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2021,1,25]],"date-time":"2021-01-25T00:00:00Z","timestamp":1611532800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,25]],"date-time":"2021-01-25T00:00:00Z","timestamp":1611532800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int. J. Inf. Secur."],"published-print":{"date-parts":[[2021,12]]},"DOI":"10.1007\/s10207-021-00538-7","type":"journal-article","created":{"date-parts":[[2021,1,25]],"date-time":"2021-01-25T06:03:31Z","timestamp":1611554611000},"page":"871-878","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Outsourced cheating detection for secret sharing"],"prefix":"10.1007","volume":"20","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5274-8956","authenticated-orcid":false,"given":"Louis","family":"Cianciullo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hossein","family":"Ghodosi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,1,25]]},"reference":[{"key":"538_CR1","doi-asserted-by":"crossref","unstructured":"Araki, T.: Efficient (k,n) Threshold Secret Sharing Schemes Secure Against Cheating from n\u00a0-\u00a01 Cheaters. In: J.\u00a0Pieprzyk, H.\u00a0Ghodosi, E.\u00a0Dawson (eds.) Information Security and Privacy: 12th Australasian Conference, ACISP 2007, Townsville, Australia, July 2-4, 2007. Proceedings, pp. 133\u2013142. Springer Berlin Heidelberg, Berlin, Heidelberg (2007)","DOI":"10.1007\/978-3-540-73458-1_11"},{"key":"538_CR2","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, NJ, USA (1979)","DOI":"10.1109\/MARK.1979.8817296"},{"issue":"2","key":"538_CR3","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. Desig. Codes Cryptogr. 25(2), 175\u2013188 (2002)","journal-title":"Desig. Codes Cryptogr."},{"key":"538_CR4","doi-asserted-by":"crossref","unstructured":"Carpentieri, M., De Santis, A., Vaccaro, U.: Size of Shares and Probability of Cheating in Threshold Schemes. In: Helleseth, T. (ed.) Advances in Cryptology \u2013 EUROCRYPT \u201993: Workshop on the Theory and Application of Cryptographic Techniques Lofthus, Norway, May 23\u201327, 1993 Proceedings, pp. 118\u2013125. Springer, Berlin Heidelberg, Berlin, Heidelberg (1994)","DOI":"10.1007\/3-540-48285-7_10"},{"key":"538_CR5","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/978-3-319-97916-8_13","volume-title":"Advances in information and computer security","author":"L Cianciullo","year":"2018","unstructured":"Cianciullo, L., Ghodosi, H.: Improvements to almost optimum secret sharing with cheating detection. In: Inomata, A., Yasuda, K. (eds.) Advances in information and computer security, pp. 193\u2013205. Springer, Cham (2018)"},{"key":"538_CR6","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/978-3-540-78967-3_27","volume-title":"Advances in Cryptology - 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.) Advances in Cryptology - EUROCRYPT 2008, pp. 471\u2013488. Springer, New york (2008)"},{"issue":"7","key":"538_CR7","doi-asserted-by":"publisher","first-page":"1349","DOI":"10.1007\/s11425-013-4654-5","volume":"56","author":"R Cramer","year":"2013","unstructured":"Cramer, R., Fehr, S., Padr\u00f3, C.: Algebraic manipulation detection codes. Sci. China Math. 56(7), 1349\u20131358 (2013)","journal-title":"Sci. China Math."},{"key":"538_CR8","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1007\/978-3-662-46494-6_20","volume-title":"Theory of cryptography","author":"R Cramer","year":"2015","unstructured":"Cramer, R., Padr\u00f3, C., Xing, C.: Optimal algebraic manipulation detection codes in the constant-error model. In: Dodis, Y., Nielsen, J.B. (eds.) Theory of cryptography, pp. 481\u2013501. Springer, Berlin Heidelberg (2015)"},{"key":"538_CR9","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/978-3-030-35199-1_8","volume-title":"Cryptography and Coding","author":"I Damg\u00e5rd","year":"2019","unstructured":"Damg\u00e5rd, I., Haagh, H., Nielsen, M., Orlandi, C.: Commodity-based 2pc for arithmetic circuits. In: Albrecht, M. (ed.) Cryptography and Coding, pp. 154\u2013177. Springer, Cham (2019)"},{"key":"538_CR10","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd, I., Keller, M., Larraia, E., Pastro, V., Scholl, P., Smart, N.P.: Practical covertly secure mpc for dishonest majority\u2013or: breaking the spdz limits. In: European Symposium on Research in Computer Security, pp. 1\u201318. Springer,New york (2013)","DOI":"10.1007\/978-3-642-40203-6_1"},{"key":"538_CR11","unstructured":"Desmedt, Y., Jajodia, S.: Redistributing secret shares to new access structures and its applications. Tech. rep., Technical Report ISSE TR-97-01, George Mason University (1997)"},{"key":"538_CR12","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/978-3-319-22425-1_13","volume-title":"Advances in information and computer security: 10th international workshop on security, iwsec 2015, nara, japan, august 26\u201328, 2015, proceedings","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.) Advances in information and computer security: 10th international workshop on security, iwsec 2015, nara, japan, august 26\u201328, 2015, proceedings, pp. 213\u2013222. Springer, Cham (2015)"},{"key":"538_CR13","doi-asserted-by":"crossref","unstructured":"Obana, S., Tsuchida, K.: Cheating detectable secret sharing schemes supporting an arbitrary finite field. In: Advances in Information and Computer Security, pp. 88\u201397. Springer, Cham (2014)","DOI":"10.1007\/978-3-319-09843-2_7"},{"issue":"1","key":"538_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. Discrete Math. 20(1), 79\u201395 (2006)","journal-title":"SIAM J. Discrete Math."},{"issue":"11","key":"538_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"},{"key":"538_CR16","doi-asserted-by":"crossref","unstructured":"Smart, N.P., Tanguy, T.: Taas: Commodity mpc via triples-as-a-service. In: Proceedings of the 2019 ACM SIGSAC Conference on Cloud Computing Security Workshop, pp. 105\u2013116 (2019)","DOI":"10.1145\/3338466.3358918"},{"issue":"2","key":"538_CR17","first-page":"133","volume":"1","author":"M Tompa","year":"1988","unstructured":"Tompa, M., Woll, H.: How to Share a Secret with Cheaters. J. Cryptol. 1(2), 133\u2013138 (1988)","journal-title":"J. Cryptol."}],"container-title":["International Journal of Information Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-021-00538-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10207-021-00538-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-021-00538-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,19]],"date-time":"2021-10-19T03:19:03Z","timestamp":1634613543000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10207-021-00538-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,25]]},"references-count":17,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2021,12]]}},"alternative-id":["538"],"URL":"https:\/\/doi.org\/10.1007\/s10207-021-00538-7","relation":{},"ISSN":["1615-5262","1615-5270"],"issn-type":[{"value":"1615-5262","type":"print"},{"value":"1615-5270","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,1,25]]},"assertion":[{"value":"25 January 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}