CBC MACs for arbitrary-length messages: The three-key constructions

Journal of Cryptology

Volumn 18, Issue 2, 2005, Pages 111-131

  Black, John ^a   Rogaway, Phillip ^b,c  

^a UNIVERSITY OF COLORADO   (United States)

^b University of California   (United States)

^c CHIANG MAI UNIVERSITY   (Thailand)

Author keywords

CBC MAC; Message authentication codes; Modes of operation; Provable security; Standards

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; DATA PRIVACY; DATA PROCESSING; FUNCTIONS; SECURITY OF DATA;

CBC MAC; MESSAGE AUTHENTICATION CODES; MODES OF OPERATIONS; PROVABLE SECURITY;

CRYPTOGRAPHY;

EID: 17444383008     PISSN: 09332790     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00145-004-0016-3     Document Type: Article

References (16)

1. Bellare, M., Kilian, J., and Rogaway, P. The security of the cipher block chaining message authentication code. Journal of Computer and System Sciences (JCSS) 61(3) (Dec. 2000), 362-399. Earlier version in CRYPTO '94. See www.cs.ucdavis.edu/~rogaway.
2. Berendschot, A., den Boer, B., Boly, J., Bosselaers, A., Brandt, J., Chaum, D., Damgård, I., Dichtl, M., Fumy, W., van der Ham, M., Jansen, C., Landrock, P., Preneel, B., Roelofsen, G., de Rooij, P., and Vandewalle, J. Final Report of Race Integrity Primitives. Vol. 1007 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1995.
3. Black, J., Halevi, S., Krawczyk, H., Krovetz, T., and Rogaway, P. UMAC: Fast and secure message authentication. In Advances in Cryptology - CRYPTO '99 pp. 216-233 Vol. 1666 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1999.
4. Black, J., and Rogaway, P. CBC MACs for arbitrary-length messages: the three-key constructions. In Advances in Cryptology - CRYPTO '00, pp. 197-215. Vol. 1800 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 2000.
5. Carter, L., and Wegman, M. Universal hash functions. Journal of Computer and System Sciences 18 (1979), 143-154.
6. Dworkin, M. Personal communication, 2003.
7. FIPS. Computer data authentication. Federal Information Processing Standards Publication 113. U.S. Department of Commerce/National Bureau of Standards, National Technical Information Service. Spring-field, Virginia, 1994.
8. Goldreich, O., Goldwasser, S., and Micali, S. How to construct random functions. Journal of the ACM 33(4) (1986), 210-217.
9. Iso/Iec 9797-1. Information technology - security techniques - data integrity mechanism using a cryptographic check function employing a block cipher algorithm. International Organization for Standards. Geneva, Switzerland, 1999. Second edition.
10. Iwata, T., and Kurosawa, K. OMAC: One-key CBC MAC. In Fast Software Encryption (FSE 2003). Lecture Notes in Computer Science. Springer-Verlag, Berlin, 2003.
11. Kilian, J., and Rogaway, P. How to protect DES against exhaustive key search (an analysis of DESX). Journal of Cryptology 14(1) (2001), 17-35.
12. Liskov, M., Rivest, R., and Wagner, D. Tweakable block ciphers. In Advances in Cryptology - CRYPTO '02, M. Yung, ed., pp. 31-46. Vol. 2442 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 2002.
13. Maurer, U. Indistinguishability of random systems. In Advances in Cryptology - EUROCRYPT '02, pp. 110-132. Vol. 2332 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 2002.
14. Petrank, E., and Rackoff, C. CBC MAC for real-time data sources. Journal of Cryptology 13(3) (2000), 315-338.
15. Vaundenay, S. Decorrelation over infinite domains: the encrypted CBC-MAC case. Communications in Information and Systems (CIS) 1 (2001), 75-85.
16. Wegman, M., and Carter, L. New hash functions and their use in authentication and set equality. In Journal of Computer and System Sciences 22 (1981), 265-279.