journal article
Apr 08, 2026
Construction of an Optimal (k,n) Multi‐Receiver Authentication Code Based on Orthogonal Arrays
Abstract
ABSTRACT
A multi‐receiver authentication code refers to a sender transmitting a message that needs to be authenticated to receivers, so that each receiver can verify it, and any receivers cannot deceive other receivers. In this paper, an optimal multi‐receiver authentication code is designed by constructing two orthogonal arrays, which satisfy that each column of one orthogonal array is friendly to the other orthogonal array. One orthogonal array with strength 2 is presented according to the mutually orthogonal Latin squares, and the other orthogonal array with strength is obtained by using Bush's construction. It is proved that the orthogonal array with strength is friendly to each column of the orthogonal array with strength 2. The probability of successful impersonation and substitution attacks from an opponent, and the number of encoding rules are calculated to verify that the constructed multi‐receiver authentication code is optimal.
A multi‐receiver authentication code refers to a sender transmitting a message that needs to be authenticated to receivers, so that each receiver can verify it, and any receivers cannot deceive other receivers. In this paper, an optimal multi‐receiver authentication code is designed by constructing two orthogonal arrays, which satisfy that each column of one orthogonal array is friendly to the other orthogonal array. One orthogonal array with strength 2 is presented according to the mutually orthogonal Latin squares, and the other orthogonal array with strength is obtained by using Bush's construction. It is proved that the orthogonal array with strength is friendly to each column of the orthogonal array with strength 2. The probability of successful impersonation and substitution attacks from an opponent, and the number of encoding rules are calculated to verify that the constructed multi‐receiver authentication code is optimal.
Topics
No keywords indexed for this article. Browse by subject →
References
20
[1]
Gilbert E. N. "Codes Which Detect Deception" Bell System Technical Journal (1974) 10.1002/j.1538-7305.1974.tb02751.x
[2]
Simmons G. J. "Authentication Theory/Coding Theory" Lecture Notes in Computer Science (1984) 10.1007/3-540-39568-7_32
[3]
Desmedt Y. (1992)
[4]
Kurosawa K. (1997) 10.1007/bfb0027927
[5]
Safavi‐Naini R. "Bounds and Constructions for Multireceiver Authentication Codes" Advances in Cryptology‐Asiacrypt'98 (1998) 10.1007/3-540-49649-1_20
[6]
Chen S. "Construction of Multi‐Receiver Multi‐Fold Authentication Codes From Singular Symplectic Geometry Over Finite Fields" Algebra Colloquium (2013) 10.1142/s1005386713000679
[7]
Wang X. "Multi‐Receiver Authentication Scheme With Hierarchical Structure" IET Information Security (2017) 10.1049/iet-ifs.2016.0264
[8]
Xu Q. "Multi‐Receiver Authentication Scheme for General Access Structure" IEEE Access (2020) 10.1109/access.2020.2965732
[9]
Watanabe Y. "Multi‐Designated Receiver Authentication Codes: Models and Constructions" IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2023) 10.1587/transfun.2022tap0015
[10]
Yang J. (2024) 10.1109/isit57864.2024.10619081
[11]
Pang S. "Security Authentication Codes Constructed by Mixed Orthogonal Array" Journal of Henan University (Natural Science) (2014)
[12]
Li M. "A Construction Of‐Fold Perfect Splitting Authentication Codes With Equal Deception Probabilities" Cryptography and Communications (2015) 10.1007/s12095-014-0107-4
[13]
M.Cao Constructions of Cartesian and Splitting Authentication Codes Based on Orthogonal Arrays and Splittable Designs. Civil Aviation University of China 2021.
[14]
Wang X. "Construction of Authentication Codes Based on Orthogonal Array and Latin Square" Computational and Applied Mathematics (2022) 10.1007/s40314-022-01866-7
[15]
Colbourn C. J. (2007)
[16]
Wan Z. (2009) 10.1142/7460
[17]
Pei D. (2009)
[18]
Hedayat A. S. (1999) 10.1007/978-1-4612-1478-6
[19]
Shen H. (2008)
[20]
Obana S. "Bounds and Combinatorial Structure of (k,n) $(k,n)$ Multi‐Receiver A‐Codes" Designs, Codes and Cryptography (2001) 10.1023/a:1008351225940
Metrics
0
Citations
20
References
Details
- Published
- Apr 08, 2026
- License
- View
Authors
Funding
National Natural Science Foundation of China
Award: 12301670
Cite This Article
Xiuli Wang, Yangmei Deng (2026). Construction of an Optimal (k,n) Multi‐Receiver Authentication Code Based on Orthogonal Arrays. Journal of Combinatorial Designs. https://doi.org/10.1002/jcd.70015
Related
You May Also Like
A proof of Lindner's conjecture on embeddings of partial Steiner triple systems
Darryn Bryant, Daniel Horsley · 2008
26 citations
Existence of certain skew room frames with application to weakly 3‐chromatic linear spaces
C. A. Rodger, E. B. Wantland · 1994
7 citations