Secure Multi-party Computation and the Millionaires' Problem explained

You can buy me a coffee if you want to support the channel: https://buymeacoffee.com/secprivaca We explain the millionaires' problem and provide an example with real numbers to understand secure multi-party computation and its application. You can find the dining cryptographers' problem here: https://youtu.be/rpLV4paOayk And secure circuit evaluation here: https://youtu.be/6kwRkjL6kJc