Commitment schemes

A commitment "locks in" the value of data while keeping it secret. Hash functions are good for this: C = H(nonce+data)

A Pedersen commitment is an additively homomorphic commitment:

• C(B1,d1) + C(B2,d2) = C(B1+B2,d1+d2)

Pedersen commitments can be implemented using ECC:

• Choose a second generator H = point(Hash(G))

• C = xG + aH, where x is private key and a is data being committed