This is repo I used for dining cryptographers protocol for Cryptography course on my CS studies.
-
Updated
Apr 4, 2019 - Go
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.
A toy implementation of Chaum's Dining Cryptographers problem to illustrate programmatic functionality over a reliable broadcast network, along with a brief explanation.
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.
Unconditional sender and recipient untraceability
Add a description, image, and links to the dining-cryptographers topic page so that developers can more easily learn about it.
To associate your repository with the dining-cryptographers topic, visit your repo's landing page and select "manage topics."