# Simple commitment scheme using secure hash function

Can I create a simple commitment scheme using a secure hash function?

If so, is concatenation with a random secret enough to preserve hiding? (i.e. $$C = H( random\_string || message)$$)

Thank you

• Thanks for your response. Since there will be many possible pairs of $random\_string$ and $message$ that generate $C$, does this mean that the binding requirement is not satisfied since I can claim that I committed to either one of the messages? If so, how can I alter my scheme to satisfy both? – jimouris Aug 4 '19 at 7:39