M. Yung. Cryptoprotocols: subscription to a public key, the secret blocking and the multi-player mental poker game. In CRYPTO 1984.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....of special purpose cryptographic tasks. Secret sharing [95, 98] is a multi party protocol in which a designated party distributes a message for later recovery by some authorized subcollection of the remaining parties. Bit commitment [19, 81] is a two party version of secret sharing. Mental poker [106, 45, 29, 31, 32] is a multi party protocol for producing, and partially applying, a random permutation (i.e. shu e and deal a deck of cards) Secret ballot election schemes [28, 17] are essentially a special case of secure multi party computation in which the function is a simple sum of ones and zeros. 20 3. ....

M. Yung. Cryptoprotocols: subscription to a public key, the secret blocking and the multi-player mental poker game. In CRYPTO 1984.

.... to the security of remotely keyed encryption see Blaze et al. [10] Interactive Encryption 31 The second setting resembles the one studied by Goldwasser, Micali, and Tong [46] in which they constructed an interactive public key cryptosystem secure against chosen ciphertext attack (see also [34, 67]) An interactive public key cryptosystem requires a public le storing information for each message recipient, but this information alone is not sucient for encrypting messages. The additional information needed is chosen interactively by the sender and receiver. To the best of our knowledge, ....

M. Yung, Cryptoprotocols: Subscription to a Public Key, the Secret Blocking and the Multi-Player Mental Poker Game, Advances in Cryptology { Crypto'84, Lecture Notes in Computer Science No. 196, pp. 439-453, 1985. 54

....and each card is encoded by the quadratic residuosity of 2 Theta 6 six numbers w.r.t. two products of prime numbers. Picking up a card implies the publishing of an integer factorization. Due to lack of space we cannot mention the variety of approaches to mental poker [SRA 78, BaFu 83, FoMe 85, Yung 85, Cr ep 86, GMW 87] made so far. A sufficient and complete solution of mental poker is presented in [Cr ep 87] It achieves: Uniform random distribution of cards, absence of a trusted third party, cheating detection, complete confidentiality of cards, minimal effect of coalition, and complete ....

M. Yung, Cryptoprotocols: Subscription to a Public Key, The Secret Blocking and the Multi-Player Mental Poker Game, Advances in Cryptology: Proc. of Crypto 84, LNCS 196, Spring, pp. 439-453, 1985. 24

.... to the security of remotely keyed encryption see Blaze et al. [10] Interactive Encryption The second setting resembles the one studied by Goldwasser, Micali, and Tong [45] in which they constructed an interactive public key cryptosystem secure against chosen ciphertext attack (see also [34, 66]) An interactive public key cryptosystem requires a public file storing information for each message recipient, but this information alone is not sufficient for encrypting messages. The additional information needed is chosen interactively by the sender and receiver. To the best of our ....

M. Yung, Cryptoprotocols: Subscription to a Public Key, the Secret Blocking and the Multi-Player Mental Poker Game, Advances in Cryptology -- Crypto'84, Lecture Notes in Computer Science No. 196, pp. 439--453, 1985.

....according to which they would select a partner (for obvious reasons sometimes) they should find out nothing about their mutual tastes except for the fact that they were not compatible in the case were the protocol answers in that direction. Also, the widely studied mental poker problem [42, 34, 31, 1, 45, 18, 19, 33]: Alice and Bob want to play a fair game of poker in a setting where they cannot meet and exchange physical cards. More seriously, a simple identification system can be set up as a particular case of the secure two party computation with the function f taken to be the boolean predicate x = y. This ....

M. Yung. Cryptoprotocols: Subscription to a public key, the secret blocking and the multiplayer mental poker game. In G. R. Blakley and D. C. Chaum, editors, Advances in Cryptology: Proceedings of Crypto '84, volume 196 of Lecture Notes in Computer Science, pages 439--453. Springer-Verlag, 1985.

....encryption [9] Unfortunately, their scheme does not extend to a larger number of players. Several protocols that have been proposed so far address the multiplayer problem instance. Unfortunately, they all make special assumptions, such as the players inability to establish secret communications [19] or the existence of a trusted third party [8] In 1985, Cr epeau came up with a protocol for playing Mental Poker that minimizes the effect of player coalitions [2] and one year later, he even presented an enhanced version of the protocol that does not require that players reveal their cards at ....

Yung, M. Cryptoprotocols: Subscription to a Public Key, the Secret Blocking and the Multi-Player Mental Poker Game. In Advances in Cryptology --- CRYPTO '84 (1985), G. Blakley and D. Chaum, Eds., Springer-Verlag, pp. 439 -- 453. This article was processed using the L a T E X macro package with LLNCS style

.... different mode of operation was used to achieve CC secure message transmission: interactive protocols ( telephone conversations) rather than PKC (mail sending) In interactive protocols the parties exchange messages, and indeed the solutions suggested by Goldwasser, Micali and Tong [22] Yung [36] and Galil, Haber and Yung [13] were all inherently interactive. This, of course, did not solve the open problem regarding PKC) The first two were given without the exact notion of security and used exchange of new cryptographic keys via interaction. The third one uses interactive proof systems ....

M. Yung, Cryptoprotocols: Subscription To a Public Key, Proceedings of Crypto 84, SpringerVerlag, 1985, pp 439-453.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC