Proceedings of CRYPTO 84 on Advances in cryptology
A secure poker protocol that minimizes the effect of player coalitions
Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
Proceedings on Advances in cryptology---CRYPTO '86
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Wallet Databases with Observers
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
Efficient Mental Card Shuffling via Optimised Arbitrary-Sized Benes Permutation Network
ISC '02 Proceedings of the 5th International Conference on Information Security
Publicly verifiable secret sharing
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
A threshold cryptosystem without a trusted party
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
Communication efficient shuffle for mental poker protocols
Information Sciences: an International Journal
Hi-index | 0.00 |
There is a broad literature on distributed card games over communications networks, collectively known as mental poker. Like in any distributed protocol, avoiding the need for a Trusted Third Party (TTP) in mental poker is highly desirable, because really trusted TTPs are not always available and seldom free. This paper deals with the player dropout problem in mental poker without a TTP. A solution based on zero-knowledge proofs is proposed. While staying TTP-free, our proposal allows the game to continue after player dropout.