Authentication theory/coding theory
Proceedings of CRYPTO 84 on Advances in cryptology
SARI: self-authentication-and-recovery image watermarking system
MULTIMEDIA '01 Proceedings of the ninth ACM international conference on Multimedia
Approximate message authentication and biometric entity authentication
FC'05 Proceedings of the 9th international conference on Financial Cryptography and Data Security
Approximate Message Authentication Codes for -ary Alphabets
IEEE Transactions on Information Forensics and Security
Robust and secure image hashing
IEEE Transactions on Information Forensics and Security
Approximate image message authentication codes
IEEE Transactions on Multimedia
On the design of content-based multimedia authentication systems
IEEE Transactions on Multimedia
A robust image authentication method distinguishing JPEG compression from malicious manipulation
IEEE Transactions on Circuits and Systems for Video Technology
| Hi-index | 0.00 |
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.