Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Crescenzo, G.D., Graveman, R.F., Ge, R., Arce, G.R.: Approximate message authentication and biometric entity authentication. In: S. Patrick, A., Yung, M. (eds.) FC 2005. LNCS, vol. 3570, pp. 240–254. Springer, Heidelberg (2005)
Ge, R., Arce, G.R., Crescenzo, G.D.: Approximate message authentication codes for N-ary alphabets. IEEE Transactions on Information Forensics and Security 1(1) (2006)
Gilbert, E.N., MacWilliams, F.J., Sloane, N.J.A.: Codes which detect deception. Bell System Technical Journal 53, 405–424 (1974)
Lin, C.Y., Chang, S.F.: A Robust Image Authentication Method Surviving JPEG Lossy Compression. In: SPIE Storage and Retrieval f Image/Video Database, EI 1998, San Jose (January 1998); also in IEEE Trans. on Circuits and Systems for Video Technology (2000)
Lin, C.Y., Chang, S.F.: SARI: Self-Authentication-and-Recovery Image Watermarking System. ACM Multimedia (2001)
Simmons, G.J.: Authentication theory / coding theory. In: Blakely, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol. 196, pp. 411–432. Springer, Heidelberg (1985)
Swaminathan, A., Mao, Y., Wu, M.: Robust and secure image hashing. IEEE Transactions on Information Forensics and Security 1(2), 215–230 (2006)
Wu, C.W.: On the design of content-based multimedia authentication systems. IEEE Transactions On Multimedia 4(3), 385–393 (2002)
Xie, L., Arce, G.R., Graveman, R.F.: Approximate image message authentication codes. IEEE Transactions on Multimedia 3(2), 242–252 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tonien, D., Safavi-Naini, R., Nickolas, P., Desmedt, Y. (2009). Unconditionally Secure Approximate Message Authentication. In: Chee, Y.M., Li, C., Ling, S., Wang, H., Xing, C. (eds) Coding and Cryptology. IWCC 2009. Lecture Notes in Computer Science, vol 5557. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-01877-0_19
Download citation
DOI: https://doi.org/10.1007/978-3-642-01877-0_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-01813-8
Online ISBN: 978-3-642-01877-0
eBook Packages: Computer ScienceComputer Science (R0)