 Socialist millionaire problem

The "socialist millionaire problem" is a thought experiment in the field of cryptography and secure multi-party computation. It addresses how two parties (often referred to as "millionaires") can learn which of them is richer without revealing their actual wealth to each other. The classic formulation involves two millionaires, Alice and Bob, who want to determine who has more money. They would prefer not to disclose their exact fortunes, only the information about who is wealthier.