Abstract
What can we expect from a poker protocol? How close to reality can we come?
From the outset of this research , we realized that a cryptographic protocol could achieve more security than its real life counterpart (with physical cards). But every protocol proposed until now was far from offering all the possibilities of a real deck of cards or could not acheive the full security we were expecting.
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Banary, I. and Furedi, Z. “Mental Poker with Three or More Players”, in Information and Control, 59 (1983), pp. 84–93.
Blum, M. and Goldwasser, S. “An Efficient Probabilistic Public-Key Encryption Scheme which Hides All Partial Information”, in Advances in Cryptology: Proc. of Crypto 84, G. R. Blakley and D. Chaum, eds., Lecture Notes in Computer Science 196, Springer-Verlag, Berlin, 1985, pp.289–299.
Chor, B. and Goldreich, O., “RSA/Rabin Least Significant Bits Are 1/2+1/poly(log n) Secure”, in Advances in Cryptology: Proc. of Crypto 84, G. R. Blakley and D. Chaum, eds., Lecture Notes in Computer Science 196, Springer-Verlag, Berlin, 1985, pp.303–313.
Fortune, S. and Merrit, M., “Poker Protocols”, in Advances in Cryptology: Proc. of Crypto 84, G. R. Blakley and D. Chaum, eds., Lecture Notes in Computer Science 196, Springer-Verlag, Berlin, 1985, pp.454–464.
Goldwasser, S. and Micali S., “Probabilistic Encryption and How to Play Mental Poker Keeping Secret All Partial Information”, in Proceedings of the 14th Annual ACM symp. on Theory of computing, ACM-SIGACT, May 1982, pp. 365–377.
Goldwasser, S. and Micali S., “Probabilistic Encryption”, in J. Comput. System Sci., 28 (1984), pp. 270–299.
Rivest, R., Shamir, A. and Adleman L., “A Method for Obtaining Digital Signatures and Public-Key Cryptosystems”, in Communications of the ACM 21,2 (February 1978), pp. 120–126.
Shamir, A., Rivest R. and Adleman L., “Mental Poker”, MIT Technical Report, 1978.
Yung, M., “Cryptoprotocols: Subscription to a Public Key, The Secret Blocking and the Multi-Player Mental Poker Game”, in Advances in Cryptology: Proc. of Crypto 84, G. R. Blakley and D. Chaum, eds., Lecture Notes in Computer Science 196, Springer-Verlag, Berlin, 1985, pp.439–453.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1986 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Crépeau, C. (1986). A Secure Poker Protocol that Minimizes the Effect of Player Coalitions. In: Williams, H.C. (eds) Advances in Cryptology — CRYPTO ’85 Proceedings. CRYPTO 1985. Lecture Notes in Computer Science, vol 218. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-39799-X_8
Download citation
DOI: https://doi.org/10.1007/3-540-39799-X_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16463-0
Online ISBN: 978-3-540-39799-1
eBook Packages: Springer Book Archive