{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T19:06:26Z","timestamp":1754161586285,"version":"3.41.2"},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1998,10,1]],"date-time":"1998-10-01T00:00:00Z","timestamp":907200000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1998,10,1]],"date-time":"1998-10-01T00:00:00Z","timestamp":907200000000},"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":[[1998,10]]},"DOI":"10.1023\/a:1008229625895","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T08:47:34Z","timestamp":1040546854000},"page":"87-100","source":"Crossref","is-referenced-by-count":9,"title":["New Combinatorial Bounds for Authentication Codes and Key Predistribution Schemes"],"prefix":"10.1007","volume":"15","author":[{"given":"Kaoru","family":"Kurosawa","sequence":"first","affiliation":[]},{"given":"Koji","family":"Okada","sequence":"additional","affiliation":[]},{"given":"Hajime","family":"Saido","sequence":"additional","affiliation":[]},{"given":"Douglas R.","family":"Stinson","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"168583_CR1","unstructured":"A. Beimel, Private communication, (1997)."},{"key":"168583_CR2","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1002\/jcd.3180030304","volume":"3","author":"J. Bierbrauer","year":"1995","unstructured":"J. Bierbrauer, Bounds on orthogonal arrays and resilient functions, Journal of Combinatorial Designs, Vol. 3 (1995) pp. 179\u2013183.","journal-title":"Journal of Combinatorial Designs"},{"key":"168583_CR3","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1007\/3-540-39757-4_22","volume":"209","author":"R. Blom","year":"1984","unstructured":"R. Blom, An optimal class of symmetric key generation systems, Lecture Notes in Computer Science, Vol. 209 (1984) pp. 335\u2013338 (Proceedings of EUROCRYPT\u2019 84).","journal-title":"Lecture Notes in Computer Science"},{"key":"168583_CR4","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1007\/3-540-48071-4_33","volume":"740","author":"C. Blundo","year":"1993","unstructured":"C. Blundo, A. De Santis, A. Herzberg, S. Kutten, U. Vaccaro, and M. Yung, Perfectly secure key distribution for dynamic conferences, Lecture Notes in Computer Science, Vol. 740 (1993) pp. 471\u2013486 (Proceedings of CRYPTO\u2019 92).","journal-title":"Lecture Notes in Computer Science"},{"key":"168583_CR5","doi-asserted-by":"crossref","unstructured":"C. J. Colbourn and J.H. Dinitz, eds, CRC Handbook of Combinatorial Designs, CRC Press, Inc. (1996).","DOI":"10.1201\/9781420049954"},{"key":"168583_CR6","first-page":"737","volume":"12","author":"D. K. Ray-Chaudhuri","year":"1975","unstructured":"D. K. Ray-Chaudhuri and R. M. Wilson, On t-designs, Osaka Journal of Mathematics, Vol. 12 (1975) pp. 737\u2013744.","journal-title":"Osaka Journal of Mathematics"},{"key":"168583_CR7","first-page":"239","volume":"7","author":"R. S. Rees","year":"1996","unstructured":"R. S. Rees and D.R. Stinson, Combinatorial characterizations of authentication codes II, Designs, Codes and Cryptography, Vol. 7 (1996) pp. 239\u2013259.","journal-title":"Designs, Codes and Cryptography"},{"key":"168583_CR8","unstructured":"G. J. Simmons, A survey of information authentication, Contemporary Cryptology, The Science of Information Integrity, IEEE Press (1992) pp. 379\u2013419."},{"key":"168583_CR9","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":"168583_CR10","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) pp. 175\u2013187.","journal-title":"Designs, Codes and Cryptography"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008229625895.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1008229625895\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008229625895.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,29]],"date-time":"2025-07-29T03:45:18Z","timestamp":1753760718000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1008229625895"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,10]]},"references-count":10,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1998,10]]}},"alternative-id":["168583"],"URL":"https:\/\/doi.org\/10.1023\/a:1008229625895","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[1998,10]]}}}