That additional commitment used in the "RCTSimple" scheme is called "pseudo output". And the short answer is NO: the original input commitment and the pseudo output commitment are guaranteed to commit to the same amount. Below is why.
Suppose the sender's input commitment C
consists of the mask (aka. blinding factor) x
and the committed amount a
:
C = x*G + a*H
The pseudo output is a commitment to the same amount but with a different mask y
chosen by the sender:
D = y*G + a*H
The sender forms a ring signature by randomly choosing decoy outputs as ring partners. Let's say the ring size is 5 and the commitments in the ring are denoted as C1, C2, C3, C4, C5
and the sender's commitment is in the second place in the ring, i.e. C2 = C
. The ring signature is formed with respect to public keys defined as:
P1 = C1 - D
...
P5 = C5 - D
Importantly, the sender knows the secret key of P2
as x-y
because D
is a commitment to the same amount as committed to by C
. From the verifier's perspective, the fact that the ring signature of pubkeys P1,...,P5
as defined above checks as valid proves that one of C1,...,C5
commits to the same amount as committed to by D
.