{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T06:17:48Z","timestamp":1774678668010,"version":"3.50.1"},"reference-count":23,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1990,1,1]],"date-time":"1990-01-01T00:00:00Z","timestamp":631152000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,9,11]],"date-time":"2013-09-11T00:00:00Z","timestamp":1378857600000},"content-version":"vor","delay-in-days":8654,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Combinatorics"],"published-print":{"date-parts":[[1990,1]]},"DOI":"10.1016\/s0195-6698(13)80058-3","type":"journal-article","created":{"date-parts":[[2013,9,11]],"date-time":"2013-09-11T15:21:19Z","timestamp":1378912879000},"page":"73-79","source":"Crossref","is-referenced-by-count":22,"title":["A Construction for Authentication\/secrecy Codes from 3-homogeneous Permutation Groups"],"prefix":"10.1016","volume":"11","author":[{"given":"D.R.","family":"Stinson","sequence":"first","affiliation":[]},{"given":"L.","family":"Teirlinck","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0195-6698(13)80058-3_bib1","series-title":"Design Theory","author":"Beth","year":"1985"},{"key":"10.1016\/S0195-6698(13)80058-3_bib2","first-page":"141","article-title":"A few results in message authentication","volume":"43","author":"Brickell","year":"1984","journal-title":"Congressus Numer."},{"key":"10.1016\/S0195-6698(13)80058-3_bib3","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1112\/blms\/8.3.263","article-title":"Some new 5-designs","volume":"8","author":"Denniston","year":"1976","journal-title":"Bull. London Math. Soc.,"},{"key":"10.1016\/S0195-6698(13)80058-3_bib4","series-title":"Advances in Cryptology: Proceedings of Eurocrypt '88, Lecture Notes in Computer Science, vol. 330","first-page":"57","article-title":"Some constructions for authentication-secrecy codes","author":"De Soete","year":"1988"},{"key":"10.1016\/S0195-6698(13)80058-3_bib5","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1002\/j.1538-7305.1974.tb02751.x","article-title":"Codes which detect deception","volume":"53","author":"Gilbert","year":"1974","journal-title":"Bell System Tech. J.,"},{"key":"10.1016\/S0195-6698(13)80058-3_bib6","first-page":"163","article-title":"Nested Steiner n-gon systems and perpendicular arrays","volume":"3","author":"Granville","year":"1988","journal-title":"J. Comb. Math. Comb. Comput.,"},{"key":"10.1016\/S0195-6698(13)80058-3_bib7","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/BF01113919","article-title":"k-homogeneous groups","volume":"124","author":"Kantor","year":"1972","journal-title":"Math. Z.,"},{"key":"10.1016\/S0195-6698(13)80058-3_bib8","unstructured":"E. S. Kramer, D. L. Kreher, R. Rees and D. R. Stinson, On perpendicular arrays with t \u2a7e 3, Ars Combin., to appear."},{"key":"10.1016\/S0195-6698(13)80058-3_bib9","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0012-365X(84)90104-3","article-title":"Steiner pentagon systems","volume":"52","author":"Lindner","year":"1984","journal-title":"Discr. Math.,"},{"key":"10.1016\/S0195-6698(13)80058-3_bib10","first-page":"3","article-title":"Cryptography\u2014a selective survey","author":"Massey","year":"1986","journal-title":"Digital Communications"},{"key":"10.1016\/S0195-6698(13)80058-3_bib11","first-page":"193","article-title":"A new 5-design","volume":"6","author":"Mills","year":"1978","journal-title":"Ars Combin.,"},{"key":"10.1016\/S0195-6698(13)80058-3_bib12","first-page":"141","article-title":"On the construction of perpendicular arrays","volume":"18","author":"Mullin","year":"1980","journal-title":"Utilitas Math.,"},{"key":"10.1016\/S0195-6698(13)80058-3_bib13","unstructured":"P. Schobi, Perfect authentication systems for data sources with arbitrary statistics, presented at Eurocrypt '86."},{"key":"10.1016\/S0195-6698(13)80058-3_bib14","doi-asserted-by":"crossref","first-page":"656","DOI":"10.1002\/j.1538-7305.1949.tb00928.x","article-title":"Communication theory of secrecy systems","volume":"28","author":"Shannon","year":"1949","journal-title":"Bell System Tech. J.,"},{"key":"10.1016\/S0195-6698(13)80058-3_bib15","first-page":"413","article-title":"A game theory model of digital message authentication","volume":"34","author":"Simmons","year":"1982","journal-title":"Congressus Numer.,"},{"key":"10.1016\/S0195-6698(13)80058-3_bib16","first-page":"161","article-title":"Message authentication: a game on hypergraphs","volume":"45","author":"Simmons","year":"1984","journal-title":"Congressus Numer.,"},{"key":"10.1016\/S0195-6698(13)80058-3_bib17","series-title":"Advances in Cryptology: Proceedings of CRYPTO 84, Lecture Notes in Computer Science, vol. 196","first-page":"411","article-title":"Authentication theory\/coding theory","author":"Simmons","year":"1985"},{"key":"10.1016\/S0195-6698(13)80058-3_bib18","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/BF00206324","article-title":"Some constructions and bounds for authentication codes","volume":"1","author":"Stinson","year":"1988","journal-title":"J. Cryptol.,"},{"key":"10.1016\/S0195-6698(13)80058-3_bib19","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1007\/BF02351720","article-title":"A construction for authentication\/secrecy codes from certain combinatorial designs","volume":"1","author":"Stinson","year":"1988","journal-title":"J. Cryptol.,"},{"key":"10.1016\/S0195-6698(13)80058-3_bib20","first-page":"31","article-title":"On large sets of disjoint ordered designs","volume":"25","author":"Teirlinck","year":"1988","journal-title":"Ars Combin.,"},{"key":"10.1016\/S0195-6698(13)80058-3_bib21","unstructured":"L. Teirlinck, Generalized idempotent orthogonal arrays, to appear."},{"key":"10.1016\/S0195-6698(13)80058-3_bib22","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1007\/BF02948947","article-title":"Die funffach transitiven Gruppen von Mathieu","volume":"12","author":"Witt","year":"1938","journal-title":"Abh. Math. Sem. Hamburg,"},{"key":"10.1016\/S0195-6698(13)80058-3_bib23","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/BF02948948","article-title":"Uber Steinersche Systeme","volume":"12","author":"Witt","year":"1938","journal-title":"Abh. Math. Sem. Hamburg,"}],"container-title":["European Journal of Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0195669813800583?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0195669813800583?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,10,13]],"date-time":"2018-10-13T01:22:43Z","timestamp":1539393763000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0195669813800583"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,1]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1990,1]]}},"alternative-id":["S0195669813800583"],"URL":"https:\/\/doi.org\/10.1016\/s0195-6698(13)80058-3","relation":{},"ISSN":["0195-6698"],"issn-type":[{"value":"0195-6698","type":"print"}],"subject":[],"published":{"date-parts":[[1990,1]]}}}