Hello All,
I was wondering, if anyone could solve this questions below:
Let H be a hash function that is both hiding and puzzle friendly. Consider G(z)=H(z)∥zl where zl is the last bit of z. Show that G is puzzle frielndly but not hiding.
Thanks
Hello All,
I was wondering, if anyone could solve this questions below:
Let H be a hash function that is both hiding and puzzle friendly. Consider G(z)=H(z)∥zl where zl is the last bit of z. Show that G is puzzle frielndly but not hiding.
Thanks