Improved security analyses for CBC MACs

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

Volumn 3621 LNCS, Issue , 2006, Pages 527-545

  Bellare, Mihir ^a   Pietrzak, Krzysztof ^b   Rogaway, Phillip ^c,d  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b ETH ZURICH   (Switzerland)

^c University of California Davis   (United States)

^d CHIANG MAI UNIVERSITY   (Thailand)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; FUNCTION EVALUATION; PROBABILITY; QUERY LANGUAGES; RANDOM PROCESSES;

QUERIED MESSAGES; RANDOM FUNCTION OUTPUTTING; RANDOM N-BIT PERMUTATIONS; SECURITY ANALYSES;

SECURITY OF DATA;

EID: 33745136125     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (18)

1. M. Bellare, O. Goldreich, and A. Mityagin. The power of verification queries in message authentication and authenticated encryption. Cryptology ePrint Archive: Report 2004/309.
2. M. Bellare, J. Kilian, and P. Rogaway. The security of the cipher block chaining message authentication code. Journal of Computer and System Sciences (JCSS), vol. 61, no. 3, pp. 362-399, 2000. Earlier version in Crypto '94.
3. M. Bellare, K. Pietrzak, and P. Rogaway. Improved security analyses for CBC MACs. Full version of this paper. Available via authors' web pages.
4. M. Bellare and P. Rogaway. The game-playing technique. Cryptology ePrint Archive: Report 2004/331.
5. A. Berendschot, B. den Boer, J. Boly, A. Bosselaers, J. Brandt, D. Chaum, I. Damgård, M. Dichtl, W. Fumy, M. van der Ham, C. Jansen, P. Landrock, B. Preneel, G. Roelofsen, P. de Rooij, and J. Vandewalle. Final Report of Race Integrity Primitives. Lecture Notes in Computer Science, vol. 1007, Springer-Verlag, 1995
6. R. Berke. On the security of iterated MACs. Diploma Thesis, ETH Zürich, August 2003.
7. J. Black and P. Rogaway. CBC MACs for arbitrary-length messages: the three-key constructions. Advances in Cryptology - CKYPTO '00, Lecture Notes in Computer Science Vol. 1880, M. Bellare ed., Springer-Verlag, 2000.
8. Y. Dodis. Personal communication to K. Pietrzak. 2004.
9. Y. Dodis, R. Gennaro, J. Håstad, H. Krawczyk, and T. Rabin. Randomness extraction and key derivation using the CBC, Cascade, and HMAC modes. Advances in Cryptology - CRYPTO '04, Lecture Notes in Computer Science Vol. 3152 M. Franklin ed., Springer-Verlag, 2004.
10. G. Hardy and E. Wright. An Introduction to the Theory of Numbers. Oxford University Press, 1980.
11. E. Jaulmes, A. Joux, and F. Valette. On the security of randomized CBC-MAC beyond the birthday paradox limit: a new construction. Fast Software Encryption '02, Lecture Notes in Computer Science Vol. 2365 J. Daemen, V. Rijmen ed., Springer-Verlag, 2002.
12. J. Kilian and P. Rogaway. How to protect DES against exhaustive key search (an analysis of DESX). Journal of Cryptology, vol. 14, no. 1, pp. 17-35, 2001. Earlier version in Crypto '96.
13. U. Maurer. Indistinguishability of random systems. Advances in Cryptology - EUROCRYPT '02, Lecture Notes in Computer Science Vol. 2332, L. Knudsen ed., Springer-Verlag, 2002.
14. National Institute of Standards and Technology, U.S. Department of Commerce, M Dworkin, author. Recommendation for block cipher modes of operation: the CMAC mode for authentication. NIST Special Publication 800-38B, May 2005.
15. E. Petrank and C. Rackoff. CBC MAC for real-time data sources. Journal of Cryptology, vol. 13, no. 3, pp. 315-338, 2000.
16. V. Shoup. Sequences of games: a tool for taming complexity in security proofs. Cryptology ePrint report 2004/332, 2004.
17. S. Vaudenay. Decorrelation over infinite domains: the encrypted CBC-MAC case. Communications in Information and Systems (CIS), vol. 1, pp. 75-85, 2001.
18. M. Wegman and L. Carter. New classes and applications of hash functions. Symposium on Foundations of Computer Science (FOCS), pp. 175-182, 1979.