Computational Diffie-Hellman assumption happens to be easy in the group G. Then I claim that in fact the Hash Diffie-Hellman assumption is also easy in the group G. In fact, I'll say for G, H and this is true in fact for all hash functions where the image of the hash function. 