{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T06:17:37Z","timestamp":1774678657332,"version":"3.50.1"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1996,3,1]],"date-time":"1996-03-01T00:00:00Z","timestamp":825638400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1996,3,1]],"date-time":"1996-03-01T00:00:00Z","timestamp":825638400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Designs, Codes and Cryptography"],"published-print":{"date-parts":[[1996,3]]},"DOI":"10.1023\/a:1018094824862","type":"journal-article","created":{"date-parts":[[2003,11,3]],"date-time":"2003-11-03T19:30:08Z","timestamp":1067887808000},"page":"239-259","source":"Crossref","is-referenced-by-count":8,"title":["Combinatorial Characterizations of Authentication Codes II"],"prefix":"10.1007","volume":"7","author":[{"given":"Rolf S.","family":"Rees","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Douglas R.","family":"Stinson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"105397_CR1","first-page":"141","volume":"43","author":"E. F. Brickell","year":"1984","unstructured":"E. F. Brickell, A few results in message authentication, Congressus Numer, Vol. 43(1984), pp. 141\u2013154.","journal-title":"Congressus Numer"},{"key":"105397_CR2","doi-asserted-by":"crossref","first-page":"476","DOI":"10.1007\/3-540-46885-4_46","volume":"434","author":"M. De Soete","year":"1990","unstructured":"M. De Soete, K. Vedder and M. Walker, Cartesian authentication schemes: Proceedings of EUROCRYPT '89, Lecture Notes in Comput. Sci., 434(1990) pp. 476\u2013490.","journal-title":"Lecture Notes in Comput. Sci"},{"key":"105397_CR3","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/BF00196910","volume":"6","author":"M. D. Soete","year":"1991","unstructured":"M D Soete, New homndl and nnstorntion for authentication \/ secrecy codes with splitting. Journal of Cryptology Vol. 6(1991) pp. 173\u2013186.","journal-title":"Journal of Cryptology"},{"key":"105397_CR4","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1002\/j.1538-7305.1974.tb02751.x","volume":"53","author":"E. N. Gilbert","year":"1974","unstructured":"E. N. Gilbert, F. J. MacWilliams and N. J. A. Sloane, Codes which detect deception, Bell System Tech. Journal, Vol. 53(1974) pp. 405\u2013424.","journal-title":"Bell System Tech. Journal"},{"key":"105397_CR5","unstructured":"M. Hall, Jr., Combinatorial Theory, second edition. John Wilcy & Sons (1986)."},{"key":"105397_CR6","doi-asserted-by":"crossref","unstructured":"J. L. Massey, Cryptography-a selective survey, In Digital Communications pp. 3\u201321. North-Holland (1986).","DOI":"10.1016\/S0029-6465(22)00409-1"},{"key":"105397_CR7","first-page":"102 107","volume":"7","author":"C. Mitchell","year":"1994","unstructured":"C. Mitchell, M. Walker and P Wild, The combinatorics of perfect authentication schemes, SIAMJ Discrete Math. Vol. 7(1994) pp. 102 107.","journal-title":"SIAMJ Discrete Math"},{"key":"105397_CR8","doi-asserted-by":"crossref","first-page":"135 156","DOI":"10.1007\/BF00198462","volume":"6","author":"U. Rosenbaum","year":"1993","unstructured":"U. Rosenbaum, A lower bound on authentication after having observed a sequence of messages, Journal of Cryptology, Vol. 6(1993) pp. 135 156.","journal-title":"Journal of Cryptology"},{"key":"105397_CR9","first-page":"161","volume":"45","author":"G. J. Simmons","year":"1984","unstructured":"G. J. Simmons, Message authentication: a game on hypergraphs, Congressus Numer, Vol.45(1984) pp. 161\u2013192.","journal-title":"Congressus Numer"},{"key":"105397_CR10","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1007\/3-540-39568-7_32","volume":"196","author":"G. J. Simmons","year":"1985","unstructured":"G. J. Simmons, Authentication theory\/coding theory: Proceedings of CRYPTO '84, Lecture Notes in Comput. Sci., 196(1985) pp. 411\u2013432.","journal-title":"Lecture Notes in Comput. Sci"},{"key":"105397_CR11","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/3-540-48184-2_25","volume":"293","author":"G. J. Simmons","year":"1988","unstructured":"G. J. Simmons, Anaturaltaxonomy fordigial information lthntication schemes: Poceedings of CRYPTO '87, Lecture Notes in Comput. Sci., 293(1988) pp. 269\u2013288.","journal-title":"Lecture Notes in Comput. Sci"},{"key":"105397_CR12","unstructured":"G. J. Simmons, A survey of information authentication, In Contemporary Cryptology The Science of Information Integrity, pp. 379\u2013419. IEEE Press (1992)."},{"key":"105397_CR13","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/BF00206324","volume":"1","author":"D. R. Stinson","year":"1988","unstructured":"D. R. Stinson, Some constructions and bounds forauthentication codes, Journalof Cryptology Vol. 1 (1988) pp. 37\u201351.","journal-title":"Journalof Cryptology"},{"key":"105397_CR14","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/BF02252868","volume":"2","author":"D. R. Stinson","year":"1990","unstructured":"D. R Stinson, The combinatorics of authentication and secrecy codes, Journal of Cryptology Vol. 2(1990) pp. 23\u201349.","journal-title":"Journal of Cryptology"},{"key":"105397_CR15","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/BF00124896","volume":"2","author":"D. R. Stinson","year":"1992","unstructured":"D. R. Stinson, Combinatorial characterizations of authentication codes, Designs, Codes, and Cryptography Vol. 2(1992) pp175\u2013187.","journal-title":"Designs, Codes, and Cryptography"},{"key":"105397_CR16","doi-asserted-by":"crossref","unstructured":"D. R. Stinson, Combinatorial designs and cryptography, In Surveys in Combinatorics, 1993, pp. 257\u2013287. Cambridge University Press (1993).","DOI":"10.1017\/CBO9780511662089.010"},{"key":"105397_CR17","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/BF00190800","volume":"2","author":"M. Walker","year":"1990","unstructured":"M. Walker, Information-theoretic bounds for authentication schemes, Journal of Cryptology, Vol. 2(1990) pp. 131\u2013144.","journal-title":"Journal of Cryptology"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1018094824862.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1018094824862\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1018094824862.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,29]],"date-time":"2025-07-29T03:50:08Z","timestamp":1753761008000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1018094824862"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,3]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1996,3]]}},"alternative-id":["105397"],"URL":"https:\/\/doi.org\/10.1023\/a:1018094824862","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,3]]}}}