Secure Multi-party Computation: The Dining Cryptographers (DC) Problem Explained

You can buy me a coffee if you want to support the channel: https://buymeacoffee.com/secprivaca Today we are talking about an important concept regarding anonymity and cryptography: The dining cryptographers problem. It is a way to perform secure multi-party computation and is hence part of the SMPC series.