Cryptographic techniques have been used intensively in the past to show how to play multiparty games in an adversarial scenario. We now investigate the cryptographic power of a deck of cards in a solitary scenario. In particular, we show how a person can select a random permutation satisfying a certain criterion dixreetly (without knowing which one was picked) using a simple deck of cards. We also show how it is possible using cards to play games of partial information such-as POKER, BRIDGE and other carda games in solitary.
CITATION STYLE
Crépeau, C., & Kilian, J. (1994). Discreet solitary games. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 773 LNCS, pp. 319–330). Springer Verlag. https://doi.org/10.1007/3-540-48329-2_27
Mendeley helps you to discover research relevant for your work.