s14h
/
prism-accumulation
1
0
Fork 0
Code Releases Activity
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.
366 Commits
5 Branches
0 Tags
31 MiB
 
 
 
 
 
 
Tree: 8a058dc21e
Branches Tags
${ item.name }
Create tag ${ searchTerm }
Create branch ${ searchTerm }
from '8a058dc21e'
${ noResults }
prism-accumulation/prism-examples/dining_crypt
Dave Parker 8a058dc21e
Auto creation of bin/classes directories if they do not exist. 		18 years ago
..
.autopp Tidied up dining cryptographers example. 18 years ago
.dining_cryptN.nm.pp Tidied up dining cryptographers example. 18 years ago
README Dining cryptographers example. 18 years ago
anonymity.pctl Tidied up dining cryptographers example. 18 years ago
auto Tidied up dining cryptographers example. 18 years ago
correctness.pctl Tidied up dining cryptographers example. 18 years ago
dining_crypt3.nm Tidied up dining cryptographers example. 18 years ago
dining_crypt4.nm Tidied up dining cryptographers example. 18 years ago
dining_crypt5.nm Tidied up dining cryptographers example. 18 years ago
dining_crypt6.nm Tidied up dining cryptographers example. 18 years ago
dining_crypt7.nm Tidied up dining cryptographers example. 18 years ago
dining_crypt8.nm Tidied up dining cryptographers example. 18 years ago
dining_crypt9.nm Tidied up dining cryptographers example. 18 years ago
dining_crypt10.nm Tidied up dining cryptographers example. 18 years ago
dining_crypt15.nm Tidied up dining cryptographers example. 18 years ago

README 

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