2 search results - page 1 / 1 » Hash-and-Sign with Weak Hashing Made Secure |
ACISP
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. Digital signatures are often proven to be secure in the random oracle model while hash functions deviate more and more from this idealization. Liskov proposed to model a ...
CRYPTO
2006
Springer
13 years 6 months ago
2006
Springer
HMAC was proved in [3] to be a PRF assuming that (1) the underlying compression function is a PRF, and (2) the iterated hash function is weakly collision-resistant. However, recent...