HMAC is a randomness extractor and applications to TLS

In this paper, we study the security of a practical randomness extractor and its application in the tls standard. Randomness extraction is the first stage of key derivation functions since the secret shared between the entities does not always come from a uniformly distributed source. More precisely, we wonder if the Hmac function, used in many standards, can be considered as a randomness extractor? We show that when the shared secret is put in the key space of the Hmac function, there are two cases to consider depending on whether the key is larger than the block-length of the hash function or not. In both cases, we provide a formal proof that the output is pseudo-random, but under different assumptions. Nevertheless, all the assumptions are related to the fact that the compression function of the underlying hash function behaves like a pseudo-random function. This analysis allows us to prove the tls randomness extractor for Diffie-Hellman and RSA key exchange. Of independent interes...

• Type: Conference
• Year: 2008
• Where: CCS
• Authors: Pierre-Alain Fouque, David Pointcheval, Sébastien Zimmer
• Keywords: CCS 2008, Hash Function, Hmac Function, Randomness Extractor, Security Privacy