2009 | OriginalPaper | Chapter
Unconditionally Secure Approximate Message Authentication
Authors : Dongvu Tonien, Reihaneh Safavi-Naini, Peter Nickolas, Yvo Desmedt
Published in: Coding and Cryptology
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
Approximate message authentication codes (AMAC) arise naturally in biometric and multimedia applications where plaintexts are
fuzzy
and a tagged message (
x
′,
t
) where
t
is the calculated tag for a message
x
that is ‘close’ to
x
′ 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.