The security of the cipher block chaining message authentication code
Journal of Computer and System Sciences
Modern Cryptography, Probabilistic Proofs, and Pseudorandomness
Modern Cryptography, Probabilistic Proofs, and Pseudorandomness
CBC MACs for Arbitrary-Length Messages: The Three-Key Constructions
CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Indistinguishability of Random Systems
EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
A Concrete Security Treatment of Symmetric Encryption
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
CT-RSA'03 Proceedings of the 2003 RSA conference on The cryptographers' track
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Composition does not imply adaptive security
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
Improved security analyses for CBC MACs
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
Stronger security bounds for wegman-carter-shoup authenticators
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Pseudo-random functions and parallelizable modes of operations of a block cipher
IEEE Transactions on Information Theory
A unified method for improving PRF bounds for a class of blockcipher based MACs
FSE'10 Proceedings of the 17th international conference on Fast software encryption
How to thwart birthday attacks against MACs via small randomness
FSE'10 Proceedings of the 17th international conference on Fast software encryption
A new variant of PMAC: beyond the birthday bound
CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
PMAC with parity: minimizing the query-length influence
CT-RSA'12 Proceedings of the 12th conference on Topics in Cryptology
| Hi-index | 0.06 |
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 and σ is the total number of queried message blocks. Our new bounds are lq2/2n for PMAC and lq2/2n + 4q2/22n for TMAC and XCBC, where q is the number of queries and l is the maximum message length in n-bit blocks. This improves the previous results under most practical cases, e.g., when no message is exceptionally long compared to other messages.