{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,16]],"date-time":"2026-05-16T01:38:56Z","timestamp":1778895536541,"version":"3.51.4"},"reference-count":14,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2004,3,1]],"date-time":"2004-03-01T00:00:00Z","timestamp":1078099200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3461,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[2004,3]]},"DOI":"10.1016\/s0012-365x(03)00283-8","type":"journal-article","created":{"date-parts":[[2003,10,9]],"date-time":"2003-10-09T04:08:46Z","timestamp":1065672526000},"page":"383-405","source":"Crossref","is-referenced-by-count":64,"title":["New combinatorial designs and their applications to authentication codes and secret sharing schemes"],"prefix":"10.1016","volume":"279","author":[{"given":"Wakaha","family":"Ogata","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kaoru","family":"Kurosawa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Douglas R.","family":"Stinson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hajime","family":"Saido","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(03)00283-8_BIB1","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/s001459900049","article-title":"On a fallacious bound for authentication codes","volume":"12","author":"Blundo","year":"1999","journal-title":"J. Cryptology"},{"key":"10.1016\/S0012-365X(03)00283-8_BIB2","first-page":"141","article-title":"A few results in message authentication","volume":"43","author":"Brickell","year":"1984","journal-title":"Congr. Numer."},{"key":"10.1016\/S0012-365X(03)00283-8_BIB3","doi-asserted-by":"crossref","unstructured":"C.J. Colbourn, J.H. Dinitz (Eds.), CRC Handbook of Combinatorial Designs, CRC Press, Boca Raton, FL, 1996.","DOI":"10.1201\/9781420049954"},{"key":"10.1016\/S0012-365X(03)00283-8_BIB4","doi-asserted-by":"crossref","unstructured":"Y. Desmedt, M. Yung, Arbitrated unconditionally secure authentication can be unconditionally protected against arbiter's attack, Lecture Notes in Computer Science, Vol. 537, Springer, New York-Berlin, 1990, pp. 177\u2013188 (CRYPTO \u201990 Proceedings).","DOI":"10.1007\/3-540-38424-3_13"},{"key":"10.1016\/S0012-365X(03)00283-8_BIB5","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/BF00196910","article-title":"New bounds and constructions for authentication\/secrecy codes with splitting","volume":"3","author":"De Soete","year":"1991","journal-title":"J. Cryptol."},{"key":"10.1016\/S0012-365X(03)00283-8_BIB6","doi-asserted-by":"crossref","unstructured":"T. Johansson, On the construction of perfect authentication codes that permit arbitration, Lecture Notes in Computer Science, Vol. 773, Springer, New York-Berlin, 1993, pp. 343\u2013354 (CRYPTO \u201993 Proceedings).","DOI":"10.1007\/3-540-48329-2_29"},{"key":"10.1016\/S0012-365X(03)00283-8_BIB7","doi-asserted-by":"crossref","first-page":"1573","DOI":"10.1109\/18.333869","article-title":"Lower bounds on the probability of deception in authentication with arbitration","volume":"40","author":"Johansson","year":"1994","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0012-365X(03)00283-8_BIB8","doi-asserted-by":"crossref","unstructured":"K. Kurosawa, New bound on authentication code with arbitration, Lecture Notes in Computer Science, Vol. 899, Springer, New York-Berlin, 1994, pp. 140\u2013149 (CRYPTO \u201994 Proceedings).","DOI":"10.1007\/3-540-48658-5_16"},{"key":"10.1016\/S0012-365X(03)00283-8_BIB9","doi-asserted-by":"crossref","unstructured":"K. Kurosawa, S. Obana, Combinatorial bounds for authentication codes with arbitration, Lecture Notes in Computer Science, Vol. 921, Springer, New York-Berlin, 1995, pp. 289\u2013300 (EUROCRYPT \u201995 Proceedings).","DOI":"10.1007\/3-540-49264-X_23"},{"key":"10.1016\/S0012-365X(03)00283-8_BIB10","doi-asserted-by":"crossref","unstructured":"W. Ogata, K. Kurosawa, Optimum secret sharing scheme against cheating, Lecture Notes in Computer Science, Vol. 1070, Springer, New York-Berlin, 1996, pp. 200\u2013211 (EUROCRYPT \u201996 Proceedings).","DOI":"10.1007\/3-540-68339-9_18"},{"key":"10.1016\/S0012-365X(03)00283-8_BIB11","doi-asserted-by":"crossref","unstructured":"G.J. Simmons, Authentication theory\/coding theory, Lecture Notes in Computer Science, Vol. 196, Springer, New York-Berlin, 1984, pp. 411\u2013431 (CRYPTO \u201984 Proceedings).","DOI":"10.1007\/3-540-39568-7_32"},{"key":"10.1016\/S0012-365X(03)00283-8_BIB12","unstructured":"G.J. Simmons, Message authentication with arbitration of transmitter\/receiver disputes, Lecture Notes in Computer Science, Vol. 304, Springer, New York-Berlin, 1987, pp. 150\u2013166 (EUROCRYPT \u201987 Proceedings)."},{"key":"10.1016\/S0012-365X(03)00283-8_BIB13","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/BF00204449","article-title":"A cartesian product construction for unconditionally secure authentication codes that permit arbitration","volume":"2","author":"Simmons","year":"1990","journal-title":"J. Cryptol."},{"key":"10.1016\/S0012-365X(03)00283-8_BIB14","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/BF02252871","article-title":"How to share a secret with cheaters","volume":"1","author":"Tompa","year":"1988","journal-title":"J. Cryptol."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X03002838?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X03002838?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,25]],"date-time":"2020-03-25T22:43:49Z","timestamp":1585176229000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X03002838"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,3]]},"references-count":14,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2004,3]]}},"alternative-id":["S0012365X03002838"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(03)00283-8","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[2004,3]]}}}