General lower bounds for chosen-content attacks against authentication codes
Cristiano Crevato, Andrea Sgarro · Journal of Discrete Mathematical Sciences and Cryptography · 1998
We consider chosen-content attacks against authentication systems; the opponent succeeds in his fraud if he sends through a fraudulent cryptogram which conveys a favourable clearmessage. We determine general lower bounds for the probability of success by use of a tool called a fraud scheme, as introduced by the second author: fraud schemes provide a simple and quite general approach to converse theorems in authentication theory.