Loading...
conference paper
Interpreting Hash Function Security Proofs
2010
Provable Security
We provide a concrete security treatment of several "provably secure" hash functions. Interpreting arguments behind MQ-HASH, FSB, SWIFFTX and VSH we identify similar lines of reasoning. We aim to formulate the main security claims in a language closer to that of attacks. We evaluate designers' claims of provable security and quantify them more precisely, deriving "second order" bounds on bounds. While the authors of FSB, MQ-HASH and SWIFFT(X) prove existence of non-trivial lower bounds on security, we show that the quantification of the bounds limits the practical significance of the proofs.
Loading...
Name
Juraj-Provsec2010.pdf
Access type
openaccess
Size
316.54 KB
Format
Adobe PDF
Checksum (MD5)
8de61fbf4599d614fb115ba57351046c