Sciweavers

4 search results - page 1 / 1
» Stronger Security Bounds for OMAC, TMAC, and XCBC
Sort
View
INDOCRYPT
2003
Springer
13 years 10 months ago
Stronger Security Bounds for OMAC, TMAC, and XCBC
OMAC, TMAC and XCBC are CBC-type MAC schemes which are provably secure for arbitrary message length. In this paper, we present a more tight upper bound on Advmac for each scheme, w...
Tetsu Iwata, Kaoru Kurosawa
FSE
2003
Springer
115views Cryptology» more  FSE 2003»
13 years 10 months ago
OMAC: One-Key CBC MAC
In this paper, we present One-key CBC MAC (OMAC) and prove its security for arbitrary length messages. OMAC takes only one key, K (k bits) of a block cipher E. Previously, XCBC req...
Tetsu Iwata, Kaoru Kurosawa
FSE
2007
Springer
105views Cryptology» more  FSE 2007»
13 years 11 months ago
New Bounds for PMAC, TMAC, and XCBC
We provide new security proofs for PMAC, TMAC, and XCBC message authentication modes. The previous security bounds for these modes were σ2 /2n , where n is the block size in bits ...
Kazuhiko Minematsu, Toshiyasu Matsushima
FSE
2009
Springer
123views Cryptology» more  FSE 2009»
13 years 9 months ago
Fast and Secure CBC-Type MAC Algorithms
Abstract. The CBC-MAC or cipher block chaining message authentication code, is a well-known method to generate message authentication codes. Unfortunately, it is not forgery-secure...
Mridul Nandi