Non$-$interactive Commitment Scheme. $[10$ points$]$ Consider the following

variant of Blum$$s commitment scheme introduced in the class: To commit to a message m in $\{0,1\},$

the committer samples a random seed s in $\{0,1\}$n and sets the commitment string c as follows:

c $=$

$($

G$($s$)03$n if m $=0$

G$($s$)13$n if m $=1.(1)$

Intuitively, c is the stream cipher encryption of the message bit m using G$($s$)$ as the key. It is well$-$

known that PRGs cannot imply secure non$-$interactive commitment schemes. So$,$ which security

property among hiding and binding does not hold for the above variant of Blum$$s scheme. Justify.

$3$