E. Andreeva, A. Luykx, and B. Mennink, Provable Security of BLAKE with Non-ideal Compression Function, Cryptology ePrint Archive, vol.620, 2011.
DOI : 10.1007/978-3-642-35999-6_21

E. Andreeva, B. Mennink, and B. Preneel, Security Reductions of the Second Round SHA-3 Candidates, 13th International Conference on Information Securiryt, 2010.
DOI : 10.1007/978-3-642-18178-8_5

E. Andreeva, B. Mennink, B. Preneel, and M. ?. Skrobot, Security analysis and comparison of the SHA-3 finalists BLAKE, pp.3-3

E. Andreeva, G. Neven, B. Preneel, and T. Shrimpton, Sevenproperty-preserving iterated hashing: ROX, Advances in Cryptology ? ASIACRYPT 2007, pp.130-146, 2007.
DOI : 10.1007/978-3-540-76900-2_8

URL : https://lirias.kuleuven.be/bitstream/123456789/228688/2/article-943.pdf

E. Andreeva, B. Mennink, and B. Preneel, On the Indifferentiability of the Gr??stl Hash Function, Cryptology ePrint Archive, 2010.
DOI : 10.1007/978-3-642-15317-4_7

J. Aumasson, L. Henzen, W. Meier, and R. C. Phan, SHA-3 proposal BLAKE, 2010.

G. Barthe, B. Grégoire, S. Heraud, F. Olmedo, and S. Zanella-béguelin, Verified indifferentiable hashing into elliptic curves, 1st Conference on Principles of Security and Trust ? POST 2012, 2012.
DOI : 10.3233/JCS-130476

URL : https://hal.archives-ouvertes.fr/hal-00765874

G. Barthe, B. Grégoire, S. Heraud, and S. Zanella-béguelin, Computer-Aided Security Proofs for the Working Cryptographer, Advances in Cryptology ? CRYPTO 2011, pp.71-90, 2011.
DOI : 10.1007/978-3-642-22792-9_5

URL : https://hal.archives-ouvertes.fr/hal-01112075

G. Barthe, B. Grégoire, Y. Lakhnech, and S. Zanella-béguelin, Beyond Provable Security Verifiable IND-CCA Security of OAEP, Topics in Cryptology ? CT-RSA 2011, pp.180-196, 2011.
DOI : 10.1109/SP.2009.17

URL : https://hal.archives-ouvertes.fr/hal-01112084

G. Barthe, B. Grégoire, and S. Zanella-béguelin, Formal certification of code-based cryptographic proofs, 36th ACM SIGPLAN-SIGACT symposium on Principles of Programming Languages, pp.90-101, 2009.

G. Barthe, B. Grégoire, and S. Zanella-béguelin, Programming Language Techniques for Cryptographic Proofs, 1st International conference on Interactive Theorem Proving, ITP 2010, pp.115-130, 2010.
DOI : 10.1007/978-3-642-14052-5_10

URL : https://hal.archives-ouvertes.fr/inria-00552894

M. Bellare, T. Kohno, S. Lucks, N. Ferguson, B. Schneier et al., Provable security support for the Skein hash family, 2009.

M. Bellare and P. Rogaway, Random oracles are practical, Proceedings of the 1st ACM conference on Computer and communications security , CCS '93, pp.62-73, 1993.
DOI : 10.1145/168588.168596

G. Bertoni, J. Daemen, M. Peeters, and G. Van-assche, On the Indifferentiability of the Sponge Construction, Advances in Cryptology ? EUROCRYPT 2008, pp.181-197, 2008.
DOI : 10.1007/978-3-540-78967-3_11

R. Bhattacharyya, A. Mandal, and M. Nandi, Security Analysis of the Mode of JH Hash Function, 17th International Workshop on Fast Software Encryption, FSE 2010, pp.168-191, 2010.
DOI : 10.1007/978-3-642-13858-4_10

E. Biham and O. Dunkelman, A framework for iterative hash functions ? HAIFA, Cryptology ePrint Archive Report, vol.278, 2007.

J. Black, M. Cochran, T. Shrimpton, ]. E. Brier, J. Coron et al., On the impossibility of highly-efficient blockcipher-based hash functions Efficient indifferentiable hashing into ordinary elliptic curves, Advances in Cryptology ? CRYPTO 2010, pp.311-329, 2009.

R. Canetti, O. Goldreich, and S. Halevi, The random oracle methodology, revisited, Journal of the ACM, vol.51, issue.4, pp.557-594, 2004.
DOI : 10.1145/1008731.1008734

D. Chang, M. Nandi, and M. Yung, Indifferentiability of the hash algorithm BLAKE, Cryptology ePrint Archive Report, vol.623, 2011.

J. Coron, Y. Dodis, C. Malinaud, and P. Puniya, Merkle-Damg??rd Revisited: How to Construct a Hash Function, Advances in Cryptology ? CRYPTO 2005, pp.430-448, 2005.
DOI : 10.1007/11535218_26

I. Damgård, A Design Principle for Hash Functions, Lecture Notes in Computer Science, vol.435, pp.416-427, 1990.
DOI : 10.1007/0-387-34805-0_39

N. Ferguson, S. Lucks, B. Schneier, D. Whithing, M. Bellare et al., The Skein hash function family, 2008.

P. Gauravaram, L. R. Knudsen, K. Matusiewicz, F. Mendel, C. Rechberger et al., Grøstl ? a SHA-3 candidate, 2011.

D. Khovratovich, I. Nikoli´cnikoli´c, and C. Rechberger, Rotational Rebound Attacks on Reduced Skein, Advances in Cryptology ? ASIACRYPT 2010, pp.1-19, 2010.
DOI : 10.1007/978-3-642-17373-8_1

S. Lucks, A Failure-Friendly Design??Principle for??Hash??Functions, Advances in Cryptology ? ASIACRYPT 2005, ser, pp.474-494, 2005.
DOI : 10.1007/11593447_26

S. Manuel, Classification and generation of disturbance vectors for collision attacks against SHA-1, Designs, Codes and Cryptography, pp.247-263, 2011.
DOI : 10.1007/s10623-010-9458-9

F. Massacci and L. Marraro, Logical cryptanalysis as a SAT problem, Journal of Automated Reasoning, vol.24, issue.1/2, pp.165-203, 2000.
DOI : 10.1023/A:1006326723002

U. Maurer, R. Renner, and C. Holenstein, Indifferentiability, Impossibility Results on Reductions, and Applications to the Random Oracle Methodology, 1st Theory of Cryptography Conference, pp.21-39, 2004.
DOI : 10.1007/978-3-540-24638-1_2

R. Merkle, One Way Hash Functions and DES, Lecture Notes in Computer Science, vol.435, pp.428-446, 1990.
DOI : 10.1007/0-387-34805-0_40

I. Mironov and L. Zhang, Applications of SAT Solvers to Cryptanalysis of Hash Functions, Theory and Applications of Satisfiability Testing -SAT 2006, pp.102-115, 2006.
DOI : 10.1007/11814948_13

T. Ristenpart, H. Shacham, and T. Shrimpton, Careful with Composition: Limitations of the Indifferentiability Framework, Advances in Cryptology ? EUROCRYPT 2011, pp.487-506, 2011.
DOI : 10.1007/978-3-642-20465-4_27

P. Rogaway and T. Shrimpton, Cryptographic Hash-Function Basics: Definitions, Implications, and Separations for Preimage Resistance, Second-Preimage Resistance, and Collision Resistance, 11th International Workshop on Fast Software Encryption , FSE 2004, pp.371-388, 2004.
DOI : 10.1007/978-3-540-25937-4_24

D. Toma and D. Borrione, Formal Verification of a SHA-1 Circuit Core Using ACL2, 18th international conference on Theorem Proving in Higher Order Logics, 2005.
DOI : 10.1007/11541868_21

URL : https://hal.archives-ouvertes.fr/hal-00014220

X. Wang, Y. Yin, and H. Yu, Finding Collisions in the Full SHA-1, Advances in Cryptology ? CRYPTO 2005, ser, pp.17-36, 2005.
DOI : 10.1007/11535218_2

X. Wang and H. Yu, How to Break MD5 and Other Hash Functions, Advances in Cryptology ? EUROCRYPT 2005, ser, pp.561-561, 2005.
DOI : 10.1007/11426639_2

H. Wu, The hash function JH, 2011.