A zero-knowledge Poker protocol that achieves confidentiality of the players' strategy or How to achieve an electronic Poker face (1986) [29 citations — 3 self]
Abstract:
This paper proposes a new poker protocol that allows players to keep secret their strategy. This protocol is an extension of the one given by Crepeau in [Cr]. The security will not be based on the knowledge of the entire deck of card at the end of the game, but rather on some independent information linked to the entries of the deck. This protocol achieves every constraints of a real poker game. It is the first complete solution to the mental poker problem. It achieves all the necessary conditions suggested in [Cr]: - 2 - . Uniqueness of cards . Uniform random distribution of cards . Absence of trusted third party . Cheating detection with a very high probability . Complete confidentiality of cards . Minimal effect of coalitions . Complete confidentiality of strategy 2. Review of the protocol in [Cr]
Citations
| 838 | Micali: Probabilistic Encryption – Goldwasser, Silvio - 1984 |
| 718 | The knowledge complexity of interactive proof systems – Goldwasser, Micali, et al. - 1989 |
| 71 | Probabilistic encryption and how to play mental poker keeping secret all partial information – Goldwasser, Micali - 1982 |
| 49 | Cryptographic Protocols – Merritt - 1983 |
| 32 | Zero-Knowledge Simulation for Boolean Circuits – Brassard, Crépeau - 1987 |
| 25 | Mental poker – Shamir, Rivest, et al. - 1979 |
| 24 | A Private Interactive Test of a Boolean Predicate and Minimum-Knowledge Public-Key Cryptosystems – Galil, Haber, et al. - 1985 |
| 19 | A secure poker protocol that minimizes the effect of player coalitions – Crépeau - 1986 |
| 15 | Cryptoprotocols: Subscription to a Public Key, the Secret Blocking and the Multi-Player Mental Poker Game – Yung - 1985 |
| 14 | Mental poker with three or more players – Barany, Furedi - 1983 |
| 1 | All-or-Nothing Disclosure of Secrets", presented at CRYPTO 86 – Brassard, Crepeau, et al. |

