Authors:
Download:
by M. H. Albert, M. D. Atkinson, H. P. Van Ditmarsch, R. E. L. Aldred
http://www.cs.otago.ac.nz/trseries/oucs-2003-06ver2.pdf
Add To MetaCart
Abstract:
Safe communication for card players by combinatorial designs for two-step protocols
Citations
| 54 | A theorem in finite projective geometry and some applications to number theory – Singer - 1938 |
| 14 | Bounds on secret key exchange using a random deal of cards – Fischer, Wright - 1996 |
| 13 | On a problem in combinations – Kirkman |
| 10 | The russian cards problem – Ditmarsch |
| 7 | The importance of being formal – Makarychev, Makarychev - 2001 |
| 5 | Model checking a knowledge exchange scenario – Otterloo, Hoek, et al. - 2003 |
| 4 | Killing cluedo – Ditmarsch - 2001 |
| 4 | Oplossing van het mysterie (solution of the murder mystery – Ditmarsch |
| 1 | A complete characterization of a family of key exchange protocols – Mizuki, Shizuya, et al. |
| 1 | Het zeven-kaartenprobleem (the seven cards problem). Nieuw Archief voor Wiskunde – Ditmarsch |
