Advertisement

A Secure Poker Protocol that Minimizes the Effect of Player Coalitions

  • Claude Crépeau
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 218)

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.

Keywords

Partial Information Polynomial Fraction Poker Player Secure Game Probabilistic Encryption 
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

  1. [BF]
    Banary, I. and Furedi, Z. “Mental Poker with Three or More Players”, in Information and Control, 59 (1983), pp. 84–93.CrossRefMathSciNetGoogle Scholar
  2. [BG]
    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.Google Scholar
  3. [CG]
    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.Google Scholar
  4. [FM]
    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.Google Scholar
  5. [GM1]
    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.Google Scholar
  6. [GM2]
    Goldwasser, S. and Micali S., “Probabilistic Encryption”, in J. Comput. System Sci., 28 (1984), pp. 270–299.zbMATHCrossRefMathSciNetGoogle Scholar
  7. [RSA]
    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.zbMATHCrossRefMathSciNetGoogle Scholar
  8. [SRA]
    Shamir, A., Rivest R. and Adleman L., “Mental Poker”, MIT Technical Report, 1978.Google Scholar
  9. [Yu]
    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.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • Claude Crépeau
    • 1
  1. 1.Département d’informatique et de recherche opérationnelleUniversité de MontréalMontréalCanada

Personalised recommendations