Skip to main content

All Questions

Filter by
Sorted by
Tagged with
2 votes
1 answer
120 views

Efficient NOT in set proof?

I am looking for a solution for a very specific problem, I have one, but I am not statisfied with it and it feels there must be a much more efficient way to do this. I have a hashed value of 256 bits. ...
ovanwijk's user avatar
  • 155
1 vote
0 answers
204 views

Quantum-safe algorithm for hiding cryptocurrency transaction amount [closed]

I have a decentralized coin system that I am trying to develop. Each coin can be split up into 1,000,000 units. I've been looking for a quantum-safe and practical (efficient) algorithm to send ...
rapt's user avatar
  • 91
1 vote
0 answers
81 views

Hash as encryption used by Monero

Monero uses a Pedersen commitment $yG + bH$ to obfuscate the value of a transaction, where $b$ is the value and $y$ is the blinding factor. For the receiver to know both variables, it uses a Diffie-...
Fiono's user avatar
  • 597
2 votes
1 answer
547 views

Trouble understanding range proof of Greg Maxwell's Confidential Transaction

i've some trouble understanding the base of the range proof presented at https://elementsproject.org/elements/confidential-transactions/investigation.html I've understand the base of the Pedersen ...
Bartok's user avatar
  • 21