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.
415 B
415 B
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