Abstract
We describe a new approach for authenticating a message using a finite pseudorandom function (PRF). Our “XOR MACs” have several nice features, including parallelizability, incrementality, and provable security. The finite PRF can be “instantiated” via DES (yielding an alternative to the CBC MAC), via the compression function of MD5 (yielding an alternative to various “keyed MD5” constructions), or in a variety of other ways. The proven security is quantitative, expressing the adversary’s inability to forge in terms of her (presumed) inability to break the underlying finite PRF. This is backed by attacks showing the analysis is tight. Our proofs exploit linear algebraic techniques.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
N. Alon, L. Babai and A. Itai. A fast and simple randomized parallel algorithm for the maximal independent set problem. J. of Algorithms, Vol.7, 567–583, 1986.
M. Bellare, R. Guérin and P. Rogaway. XOR MACs: New methods for message authentication using finite pseudorandom functions. Available from the authors or out of http://www.cs.ucdavis.edu/~rogaway/
M. Bellare, J. Kilian and P. Rogaway. On the security of cipher block chaining. Advances in Cryptology — Crypto 94 Proceedings.
M. Bellare, O. Goldreich and S. Goldwasser. Incremental cryptography: The case of hashing and signing. Advances in Cryptology — Crypto 94 Proceedings.
M. Bellare, O. Goldreich and S. Goldwasser. Incremental cryptography and application to virus protection. Proceedings of the Twenty Seventh Annual Symposium on the Theory of Computing, ACM, 1995.
B. Berger and J. Rompel, “Simulating (logcn)-wise independence in NC,” Proceedings of the Thirtieth Annual Symposium on the Foundations of Computer Science, IEEE, 1989.
O. Goldreich, S. Goldwasser, and S. Micali. How to construct random functions. Journal of the ACM, Vol. 33, No. 4, 210–217, 1986.
S. Goldwasser, S. Micali, and R. Rivest. A digital signature scheme secure against adaptive chosen-message attacks. SIAM Journal of Computing, 17(2):281–308, April 1988.
ISO/IEC 9797. Data cryptographic techniques-Data integrity mechanism using a cryptographic check function employing a block cipher algorithm, 1989.
H. Krawczyk. Personal communication, September 1994.
M. Luby and C. Rackoff, “How to construct pseudorandom permutations from pseudorandom functions,” SIAM J. Comput, Vol. 17, No. 2, April 1988.
B. Preneel and P. van Oorschot. A new generic attack on message authentication codes. Advances in Cryptology — Crypto 95 Proceedings.
R. Rivest, “The MD5 message digest algorithm.” IETF RFC-1321, 1992.
G. Tsudik, “Message authentication with one-way hash functions.” Proceedings of Infocom 92, IEEE Press, 1992.
ANSI X9.9, American National Standard for Financial Institution Message Authentication (Wholesale), American Bankers Association, 1981. Revised 1986.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bellare, M., Guérin, R., Rogaway, P. (1995). XOR MACs: New Methods for Message Authentication Using Finite Pseudorandom Functions. In: Coppersmith, D. (eds) Advances in Cryptology — CRYPT0’ 95. CRYPTO 1995. Lecture Notes in Computer Science, vol 963. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44750-4_2
Download citation
DOI: https://doi.org/10.1007/3-540-44750-4_2
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60221-7
Online ISBN: 978-3-540-44750-4
eBook Packages: Springer Book Archive