| Mental Poker |
Article Index for Mental |
Website Links For Mental |
Information AboutMental Poker |
| CATEGORIES ABOUT MENTAL POKER | |
| algorithms | |
| cryptography | |
|
problem. The name stems from the Card Game Poker which is one of the games that these kind of problems apply to. A similar problem is Flipping A Coin Over Distance . The problem can be descibed as this: "How must one go about to allow only authorized actors to have access to certain information while not using a trusted arbiter?". The reason one would want to elimiante the trusted third-party is the problems that arise from trying to determine whether the third party can be trusted or not. In poker, this could translate to: "How can we make sure no player is stacking the deck or peeking at other players' cards when we are shuffling the deck ourselves?". For a physical game of cards this would be simple if the players were sitting face to face and observing each other. However if the players are not sitting at the same location but instead are at widely separate locations and pass the entire deck between them using for instance Mail , this suddenly becomes very difficult. And for electronic card cames, such as Online Poker , where the mechanics of the game are hidden from the user, this is impossible unless the method used is such that it cannot allow that sort of cheating to happen. Several protocols for doing this have been suggested, the first by Adi Shamir , Ron Rivest and Len Adleman (the creators of the RSA -encyption protocol). SHUFFLING CARDS USING COMMUTATIVE ENCRYPTION One possible Algorithm for Shuffling cards without the use of a trusted third party is to use a Commutative encryption scheme. A commutative scheme means that if some data is encrypted more than once, the order in which you decrypt this data will not matter. Example: Alice has a Plaintext message. She encrypts this, producing a garbled Ciphertext which she gives this to Bob . Bob encrypts the ciphertext again, using the same scheme as Alice but with another Key . When decrypting this double encrypted message, if the encryption scheme is commutative, it will not matter who decrypts first. The algorithm An algorithm for shuffling cards using commutative encryption would be as follows: # Alice and Bob agree on a certain "deck" of cards. In practice, this means they agree on a set of numbers or other data that each represents a card. # Alice picks an encryption key A and uses this to encrypt each card of the deck. # Alice shuffles the cards. # Alice passes the encrypted and shuffled deck to Bob. With the encryption in place, Bob cannot know which card is which. # Bob picks an encryption key B and uses this to encrypt each card of the encrypted and shuffled deck. # Bob shuffles the deck. # Bob passes the double encrypted and shuffled deck back to Alice. # Alice decrypts each card using her key A. This still leaves Bob's encryption in place though so she cannot know which card is which. # Alice picks one encryption key for each card (A1, A2, etc) and encrypts them individually. # Alice passes the deck to Bob. # Bob decrypts each card using his key B. This still leaves Alice's individual encryption in place though so he cannot know which card is which. # Bob picks one encryption key for each card (B1, B2, etc) and encrypts them individually. # Bob passes the deck back to Alice. # Alice publishes the deck for everyone playing (in this case only Alice and Bob, see below on expansion though). The deck is now shuffled. This algorithm may be expanded for an arbitrary number of players. Players Carol , Dave and so forth need only repeat steps 2-4 and 8-10. During the game, Alice and Bob will pick cards from the deck, identified in which order they are placed in the shuffled deck. When either player wants to see their cards, they will request the corresponding keys from the other player. That player, upon checking that the requesting player is indeed entitled to look at the cards, passes the individual keys for those cards to the other player. The check is to ensure that the player does not try to request keys for cards that does not belong to that player. Example: Alice has picked cards 1 to 5 in the shuffled deck. Bob has picked cards 6 to 10. Bob requests to look at his allotted cards. Alice agrees that Bob is entitled to look at cards 6 to 10 and gives him her individual card keys A6 to A10. Bob decrypts his cards by using both Alice's keys and his own for these cards, B6 to B10. Bob can now see the cards. Alice cannot know which cards Bob has because she does not have access to Bob keys B6 to B10 which are required to decrypt the cards. Weakness Depending on the deck agreed upon, this algorithm may be weak. When encrypting data, certain properties of this data may be preserved from the plaintext to the ciphertext. This may be used to "tag" certain cards. Therefore, the parties must agree on a deck where no cards have properties that are preserved during encryption. REFERENCES |
|
|