Decorrelation over infinite domains: The encrypted CBC-MAC case

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2012, Issue , 2001, Pages 189-201

  Vaudenay, Serge ^a  

^a EPFL   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

BLOCK CIPHERS; CRYPTOGRAPHIC PRIMITIVES; DE CORRELATIONS; FINITE DOMAINS; INFINITE DOMAINS; INPUT LENGTHS; MESSAGE AUTHENTICATION CODES; VARIABLE LENGTH;

CRYPTOGRAPHY;

EID: 84909989036     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44983-3_14     Document Type: Conference Paper

References (22)

1. Data Encryption Standard. Federal Information Processing Standard Publication 46, U. S. National Bureau of Standards, 1977
2. ANSI X9. 9. American National Standard -Financial Institution Message Authentication (Wholesale). ASC X9 Secretariat -American Bankers Association, 1986
3. ISO 8731-2. Banking -Approved Algorithms for Message Authentication -Part 2: Message Authenticator Algorithm. International Organization for Standardization, Geneva, Switzerland, 1992
4. RACE Project, Lectures Notes in Computer Science 1005, Springer-Verlag, 1995.
5. J. H. An, M. Bellare. Constructing VIL-MACs from FIL-MACs: Message Authentication under Weakened Assumptions. In Advances in Cryptology CRYPTO’99, Santa Barbara, California, U. S. A., Lectures Notes in Computer Science 1666, pp. 252–269, Springer-Verlag, 1999
6. M. Bellare, J. Kilian, P. Rogaway. The Security of Cipher Block Chaining. In Advances in Cryptology CRYPTO’94, Santa Barbara, California, U. S. A., Lectures Notes in Computer Science 839, pp. 341–358, Springer-Verlag, 1994
7. E. Biham, A. Shamir. Differential Cryptanalysis of the Data Encryption Standard, Springer-Verlag, 1993
8. I. B. Damgård. A Design Principle for Hash Functions. In Advances in Cryptology CRYPTO’89, Santa Barbara, California, U. S. A., Lectures Notes in Computer Science 435, pp. 416–427, Springer-Verlag, 1990
9. M. Luby, C. Rackoff. How to Construct Pseudorandom Permutations from Pseudorandom Functions. SIAM Journal on Computing, vol. 17, pp. 373–386, 1988
10. M. Matsui. The first experimental cryptanalysis of the Data Encryption Standard. In Advances in Cryptology CRYPTO’94, Santa Barbara, California, U. S. A., Lectures Notes in Computer Science 839, pp. 1–11, Springer-Verlag, 1994
11. U. M. Maurer. A Simplified and Generalized Treatment of Luby-Rackoff Pseudorandom permutation generators. In Advances in Cryptology EUROCRYPT’92, Balatonfüred, Hungary, Lectures Notes in Computer Science 658, pp. 239–255, Springer-Verlag, 1993
12. U. M. Maurer. Information-Theoretic Cryptography. Invited lecture. In Advances in Cryptology CRYPTO’99, Santa Barbara, California, U. S. A., Lectures Notes in Computer Science 1666, pp. 47–64, Springer-Verlag, 1999
13. R. C. Merkle. One way Hash Functions and DES. In Advances in Cryptology CRYPTO’89, Santa Barbara, California, U. S. A., Lectures Notes in Computer Science 435, pp. 416–427, Springer-Verlag, 1990
14. J. Patarin. Etude des Générateurs de Permutations Basés sur le Schéma du D. E. S., Th`ese de Doctorat de l’Université de Paris 6, 1991
15. J. Patarin. How to Construct Pseudorandom and Super Pseudorandom Permutations from One Single Pseudorandom Function. In Advances in Cryptology EUROCRYPT’ 92, Balatonfüred, Hungary, Lectures Notes in Computer Science 658, pp. 256–266, Springer-Verlag, 1993
16. E. Petrank, C. Rackoff. CBC MAC for Real-Time Data Sources. Journal of Cryptology, vol. 13, pp. 315–338, 2000
17. S. Vaudenay. Provable Security for Block Ciphers by Decorrelation. Invited talk. In STACS 98, Paris, France, Lectures Notes in Computer Science 1373, pp. 249–275, Springer-Verlag, 1998. Full Paper: technical report LIENS-98-8, Ecole Normale Supérieure, 1998. (ftp://ftp.ens.fr/pub/reports/liens/)
18. S. Vaudenay. Feistel Ciphers with L2-Decorrelation. In Selected Areas in Cryptography, Kingston, Ontario, Canada, Lectures Notes in Computer Science 1556, pp. 1–14, Springer-Verlag, 1999
19. S. Vaudenay. Resistance Against General Iterated Attacks. In Advances in Cryptology EUROCRYPT’99, Prague, Czech Republic, Lectures Notes in Computer Science 1592, pp. 255–271, Springer-Verlag, 1999
20. S. Vaudenay. On the Lai-Massey Scheme
21. S. Vaudenay. Adaptive-Attack Norm for Decorrelation and Super-Pseudorandomness. In Selected Areas in Cryptography, Kingston, Ontario, Canada, Lectures Notes in Computer Science 1758, pp. 49–61, Springer-Verlag, 2000
22. S. Vaudenay. On Provable Security for Conventional Cryptography. Invited talk. (To appear in the Proceedings of ICISC’ 99, LNCS, Springer-Verlag.)