How to construct random functions
Journal of the ACM (JACM)
How to construct pseudorandom permutations from pseudorandom functions
SIAM Journal on Computing - Special issue on cryptography
CBC MACs for Arbitrary-Length Messages: The Three-Key Constructions
CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
A Design Principle for Hash Functions
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
One Way Hash Functions and DES
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
The Security of Cipher Block Chaining
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
XOR MACs: New Methods for Message Authentication Using Finite Pseudorandom Functions
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
A Block-Cipher Mode of Operation for Parallelizable Message Authentication
EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
Fast and Secure CBC-Type MAC Algorithms
Fast Software Encryption
CT-RSA'03 Proceedings of the 2003 RSA conference on The cryptographers' track
A simple and unified method of proving indistinguishability
INDOCRYPT'06 Proceedings of the 7th international conference on Cryptology in India
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Improved security analyses for CBC MACs
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
PRF domain extension using DAGs
TCC'06 Proceedings of the Third conference on Theory of Cryptography
New bounds for PMAC, TMAC, and XCBC
FSE'07 Proceedings of the 14th international conference on Fast Software Encryption
PMAC with parity: minimizing the query-length influence
CT-RSA'12 Proceedings of the 12th conference on Topics in Cryptology
Hardness preserving reductions via cuckoo hashing
TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography
| Hi-index | 0.00 |
This paper provides a unified framework for improving PRF (pseudorandom function) advantages of several popular MACs (message authentication codes) based on a blockcipher modeled as RP (random permutation). In many known MACs, the inputs of the underlying blockcipher are defined to be some deterministic affine functions of previously computed outputs of the blockcipher. Keeping the similarity in mind, a class of ADEs (affine domain extensions) and a wide subclass of SADEs (secure ADEs) are introduced in the paper which contain following constructions C = {CBC-MAC, GCBC*, OMAC, PMAC}. We prove that all SADEs have PRF advantages O(tq/2n + N(t, q)/2n) where t is the total number of blockcipher computations needed for all q queries and N(t, q) is a parameter defined in the paper. The PRF advantage of any SADE is O(t2/2n) as we can show that N(t, q) ≤ (t 2). Moreover, N(t, q) = O(tq) for all members of C and hence these MACs have improved advantages O(tq/2n). Eventually, our proposed bounds for CBC-MAC and GCBC* become strictly better than previous best known bounds.