A related problem in cryptography is The Millionaire Problem [0] - how do two millionaires Alice and Bob compare their wealth (whether a >= b) without revealing

A related problem in cryptography is The Millionaire Problem [0] - how do two millionaires Alice and Bob compare their wealth (whether a >= b) without revealing any information about it? Many solutions exist. A variant of this problem is the Socialist Millionaire Problem (SMP) [1], it asks whether a == b, and can be solved with a minor modification to the standard Diffie-Hellman key exchange, which can provide a 2^128 level of security. Comparing confidential numbers is an important question in cryptography. [0] https://en.wikipedia.org/wiki/Yao%27s_Millionaires%27_problem https://en.wikipedia.org/wiki/Yao%27s_Millionaires%27_proble... [1] https://en.wikipedia.org/wiki/Socialist_millionaire_problem https://en.wikipedia.org/wiki/Socialist_millionaire_problem