CBC MAC for real-time data sources

DOI10.1007/S001450010009MaRDI QIDQ1573769zbMATH OpenOpenAlexWikidataFDO

Authors Erez Petrank, Charles W. Rackoff

Publication date 8 August 2000

Published in Journal of Cryptology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s001450010009

zbMATH Keywords

cipher block chainingMACmessage authentication

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Review text

Let \(X=\{x_1,x_2,\ldots,x_m\}\) be a message that needs to be authenticated amongst parties that share a common key \(a\). A popular method for achieving this is the Cipher Block Chaining Message Authentication Code (CBC MAC), where the following data is added to the message: \[ f_{a}^{(m)} = f_a(f_a(\ldots f_a(f_a(x_1)\oplus x_2)\ldots)\oplus x_m). \] Here \(f_a\) denotes a block cipher with key \(a\). CBC MAC for messages of fixed length was proven secure by \textit{M. Bellare, J. Kilian} and \textit{P. Rogaway} [Advances in cryptology - CRYPTO '94, Lect. Notes Comput. Sci. 839, 341-358 (1994; Zbl 0939.94554)]. CBC MAC for variable length messages is known to be insecure. The two main results of the current paper are the following. Firstly, encrypted CBC MAC is proven secure for variable length messages. Encrypted CBC MAC is a variant of CBC MAC where the block cipher \(f\) is applied one extra time on the result of CBC MAC, with a key different from the one used in CBC MAC. Secondly, CBC MAC is proven secure when applied to prefix free messages. This second result is a simple extension of the work by Bellare et al. cited above.

Recommendations

• The security of the cipher block chaining message authentication code
• Fast and Secure CBC-Type MAC Algorithms
• CBC MACs for arbitrary-length messages: The three-key constructions
• scientific article; zbMATH DE number 1406792

Cited in

(22)

• Authenticated encryption: relations among notions and analysis of the generic composition paradigm
• On the security of \textsf{TrCBC}
• Security models and proof strategies for plaintext-aware encryption
• PMAC with parity: minimizing the query-length influence
• Fast and Secure CBC-Type MAC Algorithms
• The exact PRF security of truncation: tight bounds for keyed sponges and truncated CBC
• Revisiting structure graphs: applications to CBC-MAC and EMAC
• Authenticated Encryption Mode for Beyond the Birthday Bound Security
• CBCR: CBC MAC with rotating transformations
• On the Unprovable Security of 2-Key XCBC
• The Cramer-Shoup Encryption Scheme Is Plaintext Aware in the Standard Model
• Key-Recovery Attacks on Universal Hash Function Based MAC Algorithms
• TrCBC: another look at CBC-MAC
• scientific article; zbMATH DE number 1759779 (Why is no real title available?)
• scientific article; zbMATH DE number 1406792 (Why is no real title available?)
• On Efficient Message Authentication Via Block Cipher Design Techniques
• A New Mode of Operation for Block Ciphers and Length-Preserving MACs
• The security of the cipher block chaining message authentication code
• Key-reduced variants of 3Kf9 with beyond-birthday-bound security
• A quantum-secure partial parallel MAC QPCBC
• Comprehensive robustness analysis of GCM, CCM, and OCB3
• CBC MACs for arbitrary-length messages: The three-key constructions

This page was built for publication: CBC MAC for real-time data sources

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1573769)