Infinite Families of Optimal Splitting Authentication Codes Secure Against Spoofing Attacks of Higher Order

TL;DR

This paper introduces new infinite families of optimal splitting authentication codes, including the first known family secure against second-order spoofing attacks, advancing the security and design of authentication protocols.

Contribution

It constructs the first infinite family of optimal splitting authentication codes that are secure against second-order spoofing attacks.

Findings

Established the first infinite family of such codes.

Demonstrated optimality of the constructed codes.

Proved security against higher-order spoofing attacks.

Abstract

We consider the problem of constructing optimal authentication codes with splitting. New infinite families of such codes are obtained. In particular, we establish the first known infinite family of optimal authentication codes with splitting that are secure against spoofing attacks of order two.