You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
|
|
15 years ago | |
|---|---|---|
| .. | ||
| .autopp | 18 years ago | |
| .dining_cryptN.nm.pp | 18 years ago | |
| README.txt | 15 years ago | |
| anonymity.pctl | 18 years ago | |
| auto | 18 years ago | |
| correctness.pctl | 15 years ago | |
| dining_crypt3.nm | 18 years ago | |
| dining_crypt4.nm | 18 years ago | |
| dining_crypt5.nm | 18 years ago | |
| dining_crypt6.nm | 18 years ago | |
| dining_crypt7.nm | 18 years ago | |
| dining_crypt8.nm | 18 years ago | |
| dining_crypt9.nm | 18 years ago | |
| dining_crypt10.nm | 18 years ago | |
| dining_crypt15.nm | 18 years ago | |
README.txt
This case study is based on the well known dining cryptographers problem [Cha88].
For more information, see: http://www.prismmodelchecker.org/casestudies/dining_crypt.php
=====================================================================================
[Cha88]
D. Chaum
The Dining Cryptographers Problem: Unconditional Sender and Recipient Untraceability
Journal of Cryptology, vol. 1, pp 65-75, 1988