Approximate message authentication codes (AMAC) arise naturally in biometric and multimedia applications where plaintexts are
and a tagged message (
is the calculated tag for a message
that is ‘close’ to
′ should pass the verification test. Fuzziness of plaintexts can be due to a variety of factors including applying acceptable transforms such as compression and decompression to data, or inaccuracy of sensors in reading biometric data.
This paper develops a framework for approximate message authentication systems in
unconditionally security setting
. We give formal definition of AMAC and analyze two attacks, impersonation attack and substitution attack. We derive lower bounds on an opponent’s deception probability in these attacks under the assumption that all keys are equiprobable. Our bounds generalize known combinatorial bounds in classical authentication theory.