{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T00:40:21Z","timestamp":1764981621389,"version":"3.46.0"},"reference-count":22,"publisher":"Walter de Gruyter GmbH","issue":"1","license":[{"start":{"date-parts":[[2020,11,25]],"date-time":"2020-11-25T00:00:00Z","timestamp":1606262400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,11,25]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>In this paper, we show a \u201cdirect\u201d equivalence between certain authentication codes and robust threshold schemes. It was previously known that authentication codes and robust threshold schemes are closely related to similar types of designs, but direct equivalences had not been considered in the literature. Our new equivalences motivate the consideration of a certain \u201ckey-substitution attack.\u201d We study this attack and analyze it in the setting of \u201cdual authentication codes.\u201d We also show how this viewpoint provides a nice way to prove properties and generalizations of some known constructions.<\/jats:p>","DOI":"10.1515\/jmc-2019-0048","type":"journal-article","created":{"date-parts":[[2020,11,30]],"date-time":"2020-11-30T15:54:44Z","timestamp":1606751684000},"page":"179-196","source":"Crossref","is-referenced-by-count":2,"title":["On the equivalence of authentication codes and robust (2, 2)-threshold schemes"],"prefix":"10.1515","volume":"15","author":[{"given":"Maura B.","family":"Paterson","sequence":"first","affiliation":[{"name":"Department of Economics, Mathematics and Statistics Birkbeck, University of London , Malet Street , London , UK"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Douglas R.","family":"Stinson","sequence":"additional","affiliation":[{"name":"David R. Cheriton School of Computer Science, University of Waterloo , Waterloo , Ontario, N2L 3G1 , Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"374","published-online":{"date-parts":[[2020,11,25]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"W. Ogata, K. Kurowawa and D.R. Stinson, Optimum secret sharing scheme secure against cheating, SIAM J. Discrete Math. 20 (2006), 79\u201395.","key":"2025120600333863329_j_jmc-2019-0048_ref_001","DOI":"10.1137\/S0895480100378689"},{"doi-asserted-by":"crossref","unstructured":"W. Ogata, K. Kurowawa, D.R. Stinson and H. Saido, New combinatorial designs and their applications to authentication codes and secret sharing schemes, Discrete Math. 279 (2004), 383\u2013405.","key":"2025120600333863329_j_jmc-2019-0048_ref_002","DOI":"10.1016\/S0012-365X(03)00283-8"},{"doi-asserted-by":"crossref","unstructured":"R. Cramer, Y. Dodis, S. Fehr, C. Padr\u00f3 and D. Wichs, Detection of algebraic manipulation with applications to robust secret sharing and fuzzy extractors, Lecture Notes in Computer Science 4965 (2008), 471\u2013488 (Eurocrypt 2008).","key":"2025120600333863329_j_jmc-2019-0048_ref_003","DOI":"10.1007\/978-3-540-78967-3_27"},{"doi-asserted-by":"crossref","unstructured":"M.B. Paterson and D.R. Stinson, Combinatorial characterizations of algebraic manipulation detection codes involving generalized difference families, Discrete Math. 339 (2016), 2891\u20132906.","key":"2025120600333863329_j_jmc-2019-0048_ref_004","DOI":"10.1016\/j.disc.2016.06.004"},{"doi-asserted-by":"crossref","unstructured":"M. Tompa and H. Woll, How to share a secret with cheaters, Journal of Cryptology 1 (1988), 133\u2013138.","key":"2025120600333863329_j_jmc-2019-0048_ref_005","DOI":"10.1007\/BF02252871"},{"doi-asserted-by":"crossref","unstructured":"M. Carpentieri, A. De Santis and U. Vaccaro, Size of shares and probability of cheating in threshold schemes, Lecture Notes in Computer Science 765 (1994), 118\u2013125 (Eurocrypt \u201993).","key":"2025120600333863329_j_jmc-2019-0048_ref_006","DOI":"10.1007\/3-540-48285-7_10"},{"doi-asserted-by":"crossref","unstructured":"K. Kurowawa, S. Obana andW. Ogata, t-cheater identifiable k, n threshold secret sharing schemes, Lecture Notes in Computer Science 963 (1995), 410\u2013423. (CRYPTO \u201995 Proceedings.)","key":"2025120600333863329_j_jmc-2019-0048_ref_007","DOI":"10.1007\/3-540-44750-4_33"},{"doi-asserted-by":"crossref","unstructured":"C. Blundo and A. De Santis, Lower bounds for robust secret sharing schemes, Information Processing Letters 63 (1997) 317\u2013321.","key":"2025120600333863329_j_jmc-2019-0048_ref_008","DOI":"10.1016\/S0020-0190(97)00135-X"},{"doi-asserted-by":"crossref","unstructured":"L. Cianciullo and H. Ghodosi, Improvements to almost optimum secret sharing with cheating detection, Lecture Notes in Computer Science 11049 (2018), 193\u2013205 (IWSEC 2018).","key":"2025120600333863329_j_jmc-2019-0048_ref_009","DOI":"10.1007\/978-3-319-97916-8_13"},{"doi-asserted-by":"crossref","unstructured":"Y. Liu, Linear k, n secret sharing scheme with cheating detection, Security Comm. Networks 9 (2016), 2115\u20132121.","key":"2025120600333863329_j_jmc-2019-0048_ref_010","DOI":"10.1002\/sec.1467"},{"doi-asserted-by":"crossref","unstructured":"D. Becerra and G. Vega, Secret sharing scheme with efficient cheating detection, In \u201cNISS19: Proceedings of the 2nd International Conference on Networking, Information Systems & Security\u201d, 2019, Article No. 5.","key":"2025120600333863329_j_jmc-2019-0048_ref_011","DOI":"10.1145\/3320326.3320331"},{"doi-asserted-by":"crossref","unstructured":"G.J. Simmons, Authentication theory \/ coding theory, Lecture Notes in Computer Science 196 (1985), 411\u2013431. (CRYPTO \u201984 Proceedings.)","key":"2025120600333863329_j_jmc-2019-0048_ref_012","DOI":"10.1007\/3-540-39568-7_32"},{"unstructured":"J.L. Massey, Cryptography\u2014a selective survey, In \u201cDigital Communications,\u201d 1986, pp. 3\u201321.","key":"2025120600333863329_j_jmc-2019-0048_ref_013"},{"doi-asserted-by":"crossref","unstructured":"D.R. Stinson, The combinatorics of authentication and secrecy codes, Journal of Cryptology 2 (1990), 23\u201349.","key":"2025120600333863329_j_jmc-2019-0048_ref_014","DOI":"10.1007\/BF02252868"},{"doi-asserted-by":"crossref","unstructured":"R.S. Rees and D.R. Stinson, Combinatorial characterizations of authentication codes II, Designs, Codes and Cryptography 7 (1996), 239\u2013259.","key":"2025120600333863329_j_jmc-2019-0048_ref_015","DOI":"10.1023\/A:1018094824862"},{"doi-asserted-by":"crossref","unstructured":"G. Ge, Y. Miao and L. Wang, Combinatorial constructions for optimal splitting authentication codes, SIAM J. Discrete Math. 18 (2005), 663\u2013678.","key":"2025120600333863329_j_jmc-2019-0048_ref_016","DOI":"10.1137\/S0895480103435469"},{"doi-asserted-by":"crossref","unstructured":"M. De Soete, New bounds and constructions for authentication\/secrecy codes with splitting, Journal of Cryptology 3 (1991), 173\u2013186.","key":"2025120600333863329_j_jmc-2019-0048_ref_017","DOI":"10.1007\/BF00196910"},{"doi-asserted-by":"crossref","unstructured":"C. Blundo, A. De Santis, K. Kurosawa and W. Ogata, On a fallacious bound for authentication codes, Journal of Cryptology 12 (1999), 155\u2013159.","key":"2025120600333863329_j_jmc-2019-0048_ref_018","DOI":"10.1007\/s001459900049"},{"doi-asserted-by":"crossref","unstructured":"M. Liang, L. Ji and J. Zhang, Some new classes of 2-fold optimal or perfect splitting authentication codes, Cryptogr. Commun. 9 (2017) 407\u2013430.","key":"2025120600333863329_j_jmc-2019-0048_ref_019","DOI":"10.1007\/s12095-015-0179-9"},{"doi-asserted-by":"crossref","unstructured":"M. Li, M. Liang, B. Du and J. Chen, A construction for optimal c-splitting authentication and secrecy codes, Designs, Codes and Cryptography 86 (2018), 1739\u20131755.","key":"2025120600333863329_j_jmc-2019-0048_ref_020","DOI":"10.1007\/s10623-017-0421-x"},{"doi-asserted-by":"crossref","unstructured":"C.J. Colbourn and J.H. Dinitz, eds. Handbook of Combinatorial Designs, Second Edition. Chapman & Hall\/CRC, 2007.","key":"2025120600333863329_j_jmc-2019-0048_ref_021","DOI":"10.1201\/9781420010541"},{"unstructured":"M.B. Paterson and D.R. Stinson. Algebraic manipulation detection codes and authentication codes with perfect secrecy. Preprint.","key":"2025120600333863329_j_jmc-2019-0048_ref_022"}],"container-title":["Journal of Mathematical Cryptology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.degruyter.com\/view\/journals\/jmc\/15\/1\/article-p179.xml","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jmc-2019-0048\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jmc-2019-0048\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T00:35:26Z","timestamp":1764981326000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jmc-2019-0048\/html"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,11,25]]},"references-count":22,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2021,4,20]]},"published-print":{"date-parts":[[2021,4,20]]}},"alternative-id":["10.1515\/jmc-2019-0048"],"URL":"https:\/\/doi.org\/10.1515\/jmc-2019-0048","relation":{},"ISSN":["1862-2984"],"issn-type":[{"type":"electronic","value":"1862-2984"}],"subject":[],"published":{"date-parts":[[2020,11,25]]}}}