How to construct pseudorandom permutations from pseudorandom functions
SIAM Journal on Computing - Special issue on cryptography
A design principle for hash functions
CRYPTO '89 Proceedings on Advances in cryptology
One way hash functions and DES
CRYPTO '89 Proceedings on Advances in cryptology
Differential cryptanalysis of the data encryption standard
Differential cryptanalysis of the data encryption standard
On Probable Security for Conventional Cryptography
ICISC '99 Proceedings of the Second International Conference on Information Security and Cryptology
Feistel Ciphers with L2-Decorrelation
SAC '98 Proceedings of the Selected Areas in Cryptography
Adaptive-Attack Norm for Decorrelation and Super-Pseudorandomness
SAC '99 Proceedings of the 6th Annual International Workshop on Selected Areas in Cryptography
Provable Security for Block Ciphers by Decorrelation
STACS '98 Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science
The First Experimental Cryptanalysis of the Data Encryption Standard
CRYPTO '94 Proceedings of the 14th 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
A simplified and generalized treatment of Luby-Rackoff pseudorandom permutation generators
EUROCRYPT'92 Proceedings of the 11th annual international conference on Theory and application of cryptographic techniques
EUROCRYPT'92 Proceedings of the 11th annual international conference on Theory and application of cryptographic techniques
Resistance against general iterated attacks
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Security Flaws Induced by CBC Padding - Applications to SSL, IPSEC, WTLS ...
EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
Hi-index | 0.00 |
Decorrelation theory has recently been proposed in order to address the security of block ciphers and other cryptographic primitives over a finite domain. We show here how to extend it to infinite domains, which can be used in the Message Authentication Code (MAC) case. In 1994, Bellare, Kilian and Rogaway proved that CBC-MAC is secure when the input length is fixed. This has been extended by Petrank and Rackoff in 1997 with a variable length. In this paper, we prove a result similar to Petrank and Rackoff's one by using decorrelation theory. This leads to a slightly improved result and a more compact proof. This result is meant to be a general proving technique for security, which can be compared to the approach which was announced by Maurer at CRYPTO'99.