Good morning again Jose,
Another idea is that with sufficiently high stakes (i.e. control of the
government of an entire country) it would be possible for a miner-strong The
Party to censor transactions that do not give it non-zero amounts of coins. If
The Party has a strong enough power over
Good morning Jose,
By my understanding, the sender needs to reveal some secrets to the receiver,
and the receiver will then know if it received 0 or 1 coin from that sender.
(At least from my understanding of MimbleWimble; it might not be the case for
CT, but MW is an extension of CT so...)
I
You're right that this is a simple electronic voting scheme. The thing
is that cryptographers are working on e-voting for decades and the idea
to use homomorphic commitments (or encryption) and zero-knowledge
proofs is not new in this area. It's rather the case that e-voting
inspired a lot of work
If I understand Bulletproof Confidential Transactions properly, their main
virtue is being able to hide not the senders/receivers of a coin but the amount
transferred.
That sounds to me like a perfect use case for an election.
For instance, in my country, every citizen is issued a National ID Car
