New bounds and constructions for authentication/secrecy codes with splitting


We investigate authentication codes with splitting, using the mathematical model introduced by Simmons. Besides an overview of the existing bounds, we obtain some new bounds for the probability of deception of the transmitter/ receiver in case of an impersonation or substitution game. We also prove some new bounds for a “spoofing attack of order L.” Further… (More)
DOI: 10.1007/BF00196910


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics