You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
In a Pedersen commitment scheme $C(x) = xG + rH$ the two generator points must have an unknown discrete logarithm connection. Generating $H$ via a random key might not be secure enough, so we should use some hash-to-curve mechanism. For example hash_to_curve(G.as_bytes()).
The text was updated successfully, but these errors were encountered:
Description
In a Pedersen commitment scheme$C(x) = xG + rH$ the two generator points must have an unknown discrete logarithm connection. Generating $H$ via a random key might not be secure enough, so we should use some hash-to-curve mechanism. For example
hash_to_curve(G.as_bytes())
.The text was updated successfully, but these errors were encountered: