Information-Theoretic Bounds for Authentication Frauds
Andrea Sgarro · Lecture notes in computer science · 1993
Several properties of authentication codes depend on a simple underlying mathematical structure, which we call below a fraud scheme. Relying on this fact, we are able to derive in an easy and compact way a whole range of information-theoretic lower bounds to fraud probabilities in authentication coding.