Core/grin
0
0
Fork 0
mirror of https://github.com/mimblewimble/grin.git synced 2025-01-20 19:11:08 +03:00
Code Issues Projects Releases Packages Wiki Activity Actions

clarify why blinding factor range proof is needed

Browse source
This commit is contained in:
Boris Nagaev 2024-03-10 10:41:06 -03:00
parent 43b43d9749
commit b09c066701
1 changed files with 3 additions and 1 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

4
doc/intro.md
View file

@ -252,7 +252,9 @@ which can be signed by the attacker because Carol's blinding factor cancels out
This output (`(113 + 99)*G + 2*H`) requires that both the numbers 113 and 99 are known in order to be spent; the attacker This output (`(113 + 99)*G + 2*H`) requires that both the numbers 113 and 99 are known in order to be spent; the attacker
would thus have successfully locked Carol's UTXO. The requirement for a range proof for the blinding factor prevents this would thus have successfully locked Carol's UTXO. The requirement for a range proof for the blinding factor prevents this
because the attacker doesn't know the number 113 and thus neither (113 + 99). A more detailed description of range proofs is further detailed in the [range proof paper](https://eprint.iacr.org/2017/1066.pdf). because the attacker doesn't know the number 113 and thus neither (113 + 99); without knowing the private key (113 + 99)
the attacker can not produce a valid range proof for the public key `(113 + 99)*G`.
A more detailed description of range proofs is further detailed in the [range proof paper](https://eprint.iacr.org/2017/1066.pdf).
#### Putting It All Together #### Putting It All Together