New Proofs for NMAC and HMAC: Security without Collision Resistance

294 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Zerocash: Decentralized Anonymous Payments from Bitcoin (2014, methodology): “However in this work we assume that a portion of the compression function is the seed for the pseudorandom function, rather than using the chaining variable as in [28].”
Do I know you?: efficient and privacy-preserving common friend-finder protocols and applications (2013, background): “However, this is impossible since, in ROM, HMAC is known to be pseudo-random [7].”
Pseudorandom Functions: Three Decades Later (2017, background): “Pseudorandom functions fit naturally into message authentication and in particular underlie the security of the widely deployed authentication function HMAC [22, 21].”
TrustedDB: A Trusted Hardware-Based Database with Privacy and Data Confidentiality (2011, unknown): “The cost can be reduced further by up to 50 percent if instead of AES, a cipher is built using a faster cryptographic hash as a pseudorandom function [6].”