SHA-1 Broken

Bruce Schneier has a post on his Blog reporting that the popular hashing algorithm SHA-1 has been broken. This makes a brute force attack on SHA-1 go from 2^80 iterations to 2^69 iterations (or 2048 times faster). This is still a considerable amount of iterations to perform for an attack, but as computers get faster and potential other advances in breaking algorithms occur, their stength in use will dwindle. Digital signatures have already been accepted for legally binding form of identification. How is that affected as components of digital signature schemes deteriorate? At what point do we say, since SHA-1 can be theoretically compromised, in a court of law we cannot beyond a reasonable doubt be sure this message wasn't tampered with?