SHA-1 security has been discussed since an algorithm for finding collisions was  first published at CRYPTO 2004 and has been subsequently improved.Wikipedia lists a couple of references, however it seems the latest research published (and later withdrawn) on this subject was in 2009 (Cameron McDonald, Philip Hawkes and Josef Pieprzyk Differential Path for SHA-1 with complexity O(2^52)).Since then, has any significant progress been made on reducing the effort for a hash collision attack on SHA-1?A link to specific research accompanied with a short summary would be appreciated.
State of research on SHA-1 Collision Attacks
cr.crypto security;hash function;cryptographic attack