A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Splitting authentication codes with perfect secrecy: New results, constructions and connections with algebraic manipulation detection codes

2021
*
Advances in Mathematics of Communications
*

<p style='text-indent:20px;'>A splitting BIBD is a type of combinatorial design that can be used to construct splitting authentication codes with good properties. In this paper we show that a design-theoretic approach is useful in the analysis of more general splitting authentication codes. Motivated by the study of algebraic manipulation detection (AMD) codes, we define the concept of a <i>group generated</i> splitting authentication code. We show that all group-generated authentication codes

doi:10.3934/amc.2021054
fatcat:5qza23l3irh2bhnpdmkxwusnfm