Paper 2020/061

Simple Schnorr Signature with Pedersen Commitment as Key

Gary Yu

Abstract

In a transaction-output-based blockchain system, where each transaction spends UTXOs (the previously unspent transaction outputs), a user must provide a signature, or more precisely a $\mathit{\text{scriptSig}}$ for Bitcoin, to spend an UTXO, which proves the ownership of the spending output. When Pedersen commitment $g^x{h}^a$ or ElGamal commitment $(g^x{h}^a,h^x)$ introduced into blockchain as transaction output, for supporting confidential transaction feature, where the input and output amounts in a transaction are hidden, the prior signature schemes such as Schnorr signature scheme and its variants does not directly work here if using the commitment as the public key, since nobody including the committer knows the private key of a $g^x{h}^a$ when $a$ is not zero, meaning no one knows the $c$ such that $(g^c=g^x{h}^a)$. This is a signature scheme which is able to use the $$ as the signature public key for any value of $$. The signer, proceeding from a random Pedersen commitment $$, generates a random bit sequence $$, by multiplication of a stored private key $$ with the bit sequence $$ and by addition of the random number $$ to get the $$, by multiplication of the committed value $$ with the bit sequence $$ and by addition of the random number $$ to get the $$, finally constructs $$ as the signature, with the corresponding public key $$. In turn, the verifier calculates a Pedersen commitment $$, and accepts the signature if $$. For an electronic signature, a hash value $$ is calculated from a random Pedersen commitment $$, the Pedersen commitment $$, and from the message $$ to be signed. This signature scheme will be very helpful in the design of a non-interactive transaction in Mimblewimble.

Note: Add 2 more paragraphs: 3.2 Rogue-key attack on multi-signatures scheme; 3.3 Optimization for Multiple Inputs Single Signer. A little bit more optimization.