Advertisement

A zero-knowledge Poker protocol that achieves confidentiality of the players’ strategy or How to achieve an electronic Poker face

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

Keywords

Quadratic Residue Boolean Circuit Experienced Player Poker Player 26th Annual IEEE Symposium 
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.

11. 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. [BC]
    Brassard, G. and Crépeau C., “Zero-Knowledge Simulation of Boolean Circuits”, presented at CRYPTO 86.Google Scholar
  3. [BCR]
    Brassard G., Crépeau C. and Robert J.-M., “All-or-Nothing Disclosure of Secrets”, presented at CRYPTO 86.Google Scholar
  4. [Cr]
    C. Crépeau, “A Secure Poker Protocol That Minimizes the Effect of Player Coalitions”, Advances in Cryptology: Proceedings of CRYPTO 85, H. C. Williams ed., Lecture Notes in Computer Science 218, Springer-Verlag, Berlin, 1986, pp73–86.Google Scholar
  5. [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
  6. [GHY]
    Galil, Z., S. Haber and M. Yung, “A Private Interactive Test of a Boolean Predicate and Minimum-Knowledge Public-Key Cryptosystems” Proceedings of the 26th Annual IEEE Symposium on the Foundations of Computer Science, 1985, pp. 360–371.Google Scholar
  7. [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
  8. [GM2]
    Goldwasser, S. and Micali S., “Probabilistic Encryption” in J. Comput. System Sci., 28 (1984), pp. 270–299.zbMATHCrossRefMathSciNetGoogle Scholar
  9. [GMR]
    Goldwasser, S., S. Micali and C. Rackoff, “The Knowledge Complexity of Interactive Proof-Systems” Proceedings of the 17th Annual ACM Symposium on the Theory of Computing, 1985, pp. 291–304.Google Scholar
  10. [SRA]
    Shamir, A., Rivest R. and Adleman L., “Mental Poker” MIT Technical Report, 1978.Google Scholar
  11. [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 1987

Authors and Affiliations

  • Claude Crépeau
    • 1
  1. 1.Laboratory for Computer ScienceM.I.T.CambridgeUSA

Personalised recommendations