This case study concerns the dining cryptographers protocol [Cha88].

This is a POMDP model, described in [NPZ17].

=====================================================================================

[NPZ17]
Gethin Norman, David Parker and Xueyi Zou
Verification and Control of Partially Observable Probabilistic Systems
Real-Time Systems, 53(3), pages 354-402, Springer, 2017

[Cha88]
D. Chaum
The dining cryptographers problem: Unconditional sender and recipient untraceability
Journal of Cryptology 1, 65–75, 1988