A toy implementation of Chaum's Dining Cryptographers problem to illustrate programmatic functionality over a reliable broadcast network, along with a brief explanation.

This is repo I used for dining cryptographers protocol for Cryptography course on my CS studies.

🍽️ 🔐 Benchmarking Model Checkers for Dynamic and Temporal Epistemic Logics using the Dining Cryptographers example.

Unconditional sender and recipient untraceability

An exhaustive symbolic model checking analysis for the Dining Cryptographers' Problem which inspired DC-Networks offering anonymity, unlinkability and unobservability based on synchronous finite-state and infinite-state systems.