In the commitment scheme discussed in Week 2, if we implement the commitment for message m (e.g., bid price for an auction) using a secure hash function H as follows instead, does it provide the same security guarantees as the one discussed in Week 2 slide? Please explain. Recall that r and m are kept secret until they are revealed.

C(m) = H(r XOR m)