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.
thought this was about Bernie Sanders lol.
In an episode of Curb Your Enthusiasm, the protagonist has to find the total weight of all the passengers for an airplane, but every passenger is uncomfortable sharing their weight. To me this seems like a problem that could be solved cryptographically, as it seems reminiscent of the SMP or distributed key generation. Does anyone from the crypto community know if there exists a solution for a problem like that?