(Enter summary)
Abstract: . We suggest some simple variants of the CBC MAC that let
you efficiently MAC messages of arbitrary lengths. Our constructions
use three keys, K1, K2, K3, to avoid unnecessary padding and MAC
any message M 2 f0; 1g
using maxf1; djM j=neg applications of the
underlying n-bit block cipher. Our favorite construction, XCBC, works
like this: if jM j is a positive multiple of n then XOR the n-bit key K2
with the last block of M and compute the CBC MAC keyed with K1;
otherwise, extend M 's length ... (Update)
Cited by: More
Improved Security Analyses for CBC MACs - Bellare, Pietrzak, Rogaway (2005)
(Correct)
Code-Based Game-Playing Proofs and the Security of Triple.. - Bellare, Rogaway (2006)
(Correct)
Deterministic Authenticated-Encryption - Provable-Security Treatment Of
(Correct)
Similar documents (at the sentence level):
56.4%: CBC MACs for Arbitrary-Length Messages: The Three-Key.. - Black, Rogaway (2000)
(Correct)
Active bibliography (related documents): More All
0.1: Unknown - Proposal To Nist
(Correct)
0.1: A Suggestion for Handling Arbitrary-Length Messages with the.. - Black, Rogaway (2000)
(Correct)
0.1: Comments to NIST concerning AES Modes of Operations: - Suggestion For Handling
(Correct)
Similar documents based on text: More All
2.1: TMAC: Two-Key CBC MAC - Kurosawa, Iwata (2002)
(Correct)
2.0: OMAC: One-Key CBC MAC - Iwata, Kurosawa (2002)
(Correct)
0.9: Stronger Security Bounds for OMAC, TMAC and XCBC - Iwata, Kurosawa (2003)
(Correct)
Related documents from co-citation: More All
34: The security of the cipher block chaining message authentication code
- Bellare, Kilian et al. - 1994
27: CBC MAC for Real-Time Data Sources
- Petrank, Rackoff - 1997
19: Encode-then-encipher encryption: How to exploit nonces or redundancy in plaintex..
- Bellare, Rogaway
BibTeX entry: (Update)
J. BLACK, P. ROGAWAY. CBC MACs for arbitrary-length messages: The three-key constructions. Advances in Cryptology---Crypto 2000, Lecture Notes in Computer Science, vol. 1880, Springer-Verlag, Mihir Bellare, editor, pp. 197--215, 2000. http://citeseer.ist.psu.edu/article/black00cbc.html More
@article{ black00cbc,
author = "John Black and Phillip Rogaway",
title = "{CBC {MACs}} for Arbitrary-Length Messages:The Three-Key Constructions",
journal = "Lecture Notes in Computer Science",
volume = "1880",
pages = "197--??",
year = "2000",
url = "citeseer.ist.psu.edu/article/black00cbc.html" }
Citations (may not include all citations):
419
How to construct random functions (context) - Goldreich, Goldwasser et al. - 1986
191
New hash functions and their use in authentication and set e.. (context) - Wegman, Carter - 1981
142
Federal Information Processing Standards Publication (context) - Computer - 1994
97
The security of the cipher block chaining message authentica..
- Bellare, Kilian et al. - 1994
86
How to protect DES against exhaustive key search
- Kilian, Rogaway - 1996
56
UMAC: Fast and secure message authentication
- Black, Halevi et al. - 1999
42
CBC MAC for real-time data sources
- Petrank, Rackoff - 1997
29
of Computer and System Sciences (context) - Carter, Wegman et al. - 1979
26
Information technology -- security techniques -- data integr.. (context) - Iec - 1999
20
the security of two MAC algorithms
- Preneel, van Oorschot - 1996
18
Final Report of Race Integrity Primitives (context) - Berendschot, den Boer et al. - 1995
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.ucdavis.edu/~rogaway/papers/): More
On the Construction of Variable-Input-Length Ciphers - Bellare, Rogaway (1999)
(Correct)
Authenticated Key Exchange Secure Against Dictionary Attacks - Bellare, Pointcheval.. (2000)
(Correct)
Reconciling Two Views of Cryptography (The Computational.. - Abadi, Rogaway (2000)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC