3 ms·
My eyes are glossing over trying to understand the equations in this article, but isn't the solution as easy as comparing a cryptographic hash of Alice's wealth
by Cyberdog 7y ago
My eyes are glossing over trying to understand the equations in this article, but isn't the solution as easy as comparing a cryptographic hash of Alice's wealth with a cryptographic hash of Bob's wealth for equality?
The fact that Alice could guess Bob's wealth within a certain range, even if that range is "between $0 and $1 trillion," and then have a finite range to search for a collision could be mitigated with a sufficiently slow hashing algorithm and/or an absurd number of iterations.
- baby 7y ago"could be mitigated" This is the issue with your solution, it isn't really mitigated in such problems because the domain is too small.
- roenxi 7y agoExpanding on this observation - mitigating in this manner means the two parties would have to use absurd amounts of time and computing power to calculate the initial hashes to communicate. Not very practical in many cases.