54 search results - page 7 / 11 » Second Preimage Attacks on Dithered Hash Functions |
89
Voted
ACISP
2007
Springer
15 years 3 months ago
2007
Springer
We present a new non-interactive message authentication protocol in manual channel model (NIMAP, for short) using the weakest assumption on the manual channel (i.e. assuming the st...
72
Voted
FSE
2008
Springer
14 years 11 months ago
2008
Springer
We show that the LASH-x hash function is vulnerable to attacks that trade time for memory, including collision attacks as fast as 2(4x/11) and preimage attacks as fast as 2(4x/7) ....
79
Voted
ACISP
2009
Springer
15 years 4 months ago
2009
Springer
Bernstein’s CubeHash is a hash function family that includes four functions submitted to the NIST Hash Competition. A CubeHash function is parametrized by a number of rounds r, a...
CRYPTO
2009
Springer
15 years 4 months ago
2009
Springer
RSA-FDH and many other schemes secure in the Random-Oracle Model (ROM) require a hash function with output size larger than standard sizes. We show that the random-oracle instanti...
ACNS
2006
Springer
15 years 3 months ago
2006
Springer
We study the influence of collision-finding attacks on the security of time-stamping schemes. We distinguish between client-side hash functions used to shorten the documents befo...