메뉴 건너뛰기




Volumn 218 LNCS, Issue , 1986, Pages 73-86

A Secure Poker Protocol that Minimizes the Effect of Player Coalitions

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

EID: 84945299487     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-39799-X_8     Document Type: Conference Paper
Times cited : (30)

References (9)
  • 1
    • 0020835509 scopus 로고
    • Mental Poker with Three or More Players
    • Banary, I. and Furedi, Z. “Mental Poker with Three or More Players”, in Infomarion and Control, 59 (1983), pp. 84-93.
    • (1983) Infomarion and Control , vol.59 , pp. 84-93
    • Banary, I.1    Furedi, Z.2
  • 2
    • 84949995981 scopus 로고
    • An Efficienr Probabilistic Public-Key Encryption Scheme which Hides All Partial Information
    • G. R. Blakley and D. Chaum, eds., Lecture Notes in Compurer Science 196, Springer-Verlag,Berlin
    • Blum, M. and Goldwasser, S. “An Efficienr Probabilistic Public-Key Encryption Scheme which Hides All Partial Information”, in Advnnces in Cryprology: Proc. of Crypt0 84, G. R. Blakley and D. Chaum, eds., Lecture Notes in Compurer Science 196, Springer-Verlag, Berlin, 1985, pp.289-299.
    • (1985) Advnnces in Cryprology: Proc. of Crypt0 84 , pp. 289-299
    • Blum, M.1    Goldwasser, S.2
  • 3
    • 77649264175 scopus 로고
    • RSA/Rabin Least Significant Bits Are 1/2+1/poly(Log n) Secure
    • G. R. Blakley and D. Chaum, eds., Lecture Notes in Computer Science 196, Springer-Verlag, Berlin
    • Chor, B. and Goldreich, O., “RSA/Rabin Least Significant Bits Are 1/2+1/poly(log n) Secure”, in Advances in Cryptology: Proc. of Crypro 84, G. R. Blakley and D. Chaum, eds., Lecture Notes in Computer Science 196, Springer-Verlag, Berlin, 1985, pp.303-313.
    • (1985) Advances in Cryptology: Proc. of Crypro 84 , pp. 303-313
    • Chor, B.1    Goldreich, O.2
  • 4
    • 84911880660 scopus 로고
    • Poker Protocols
    • G. R. Blakley and D. Chaum, eds., Lecture Notes in Computer Science 196, Springer-Verlag, Berlin
    • Fortune, S. and Menit, 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.
    • (1985) Advances in Cryptology: Proc. of Crypto 84 , pp. 454-464
    • Fortune, S.1    Menit, M.2
  • 5
    • 85050160774 scopus 로고
    • Probabilistic Encryption and How to Play Mental Poker Keeping Secret All Partial Information
    • ACM-SIGACT, May
    • 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.
    • (1982) Proceedings of the 14Th Annual ACM Symp. on Theory of Computing , pp. 365-377
    • Goldwasser, S.1    Micali, S.2
  • 7
    • 0017930809 scopus 로고
    • A Method for Obtaining Digital Signatures and Public-Key Cryptosystems
    • February
    • 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.
    • (1978) Communications of the ACM 21,2 , pp. 120-126
    • Rivest, R.1    Shamir, A.2    Adleman, L.3
  • 9
    • 85034667555 scopus 로고
    • Cryptoprotocols: Subscription to a Public Key, The Secret Blocking and the Multi-Player Mental Poker Game
    • G. R. Blakley and D. Chaum, eds., Lecture Notes in Computer Science 196, Springer-Verlag, Berlin
    • 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.
    • (1985) Advances in Cryptology: Proc. of Crypto 84 , pp. 439-453
    • Yung, M.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.