Name
Abstract | ||
|---|---|---|
Message authentication codes (MACs) are widely used to protect data integrity and data origin authentication in communications.
In this paper, we propose a new block-cipher-based MAC algorithm, CBCR, with provable security for arbitrary-length messages.
CBCR adopts rotating operations in the end of cipher-block-chaining structure, and it appends fixed-length prefixes to all
messages, which implies flexible usages in practice. For example, these fixed-length prefixes can be filled with some security
parameters, message redundancies, etc. We also propose CBCR0, a special case of CBCR that sets its prefix to be an all-zero
block. Compared with CMAC, a recommended standard by the US National Institute of Standards and Technology (NIST), CBCR0 enjoys
all the advantages that CMAC has, but requires less memory; so, in practical applications, CBCR0 behaves as well as CMAC does,
and it is even more suitable for environments with limited memory resources, e.g. smart cards. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1007/s11432-011-4289-5 | SCIENCE CHINA Information Sciences |
Keywords | Field | DocType |
block cipher,cipher block chaining,message authentication code,provable security | Mathematical optimization,Authentication,Message authentication code,CBC-MAC,Block cipher mode of operation,Computer science,Smart card,Computer network,Data integrity,NIST,Provable security,Distributed computing | Journal |
Volume | Issue | ISSN |
54 | 11 | null |
Citations | PageRank | References |
0 | 0.34 | 9 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Liting Zhang | 1 | 42 | 8.18 |
| Wenling Wu | 2 | 787 | 69.06 |
| Lei Zhang | 3 | 34 | 3.24 |
| Peng Wang | 4 | 118 | 8.25 |