Stack Exchange Network

Stack Exchange network consists of 175 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.

Visit Stack Exchange

Questions tagged [mental-poker]

Mental poker is the common description for a set of cryptographic problems related to playing a fair game over a distance without the need for any trusted third party.

1
vote
1answer
45 views

Is it safe to publicly announce the prime number in Shamir three-pass protocol

So say, I want to use a prime number p for anyone that wants to communicate with me using Shamir's Three Pass Protocol. I will be maintaining my secret keypair (encryption exponent, decryption ...
-3
votes
1answer
112 views

I have created an algorithm that should allow two untrusted parties to securely shuffle a deck of cards. Does this algorithm work, and is it secure? [closed]

I was reading the Mental Poker page on Wikipedia, and I've been trying to think of a different shuffling algorithm that doesn't require commutative encryption. I've written up a proof-of-concept with ...
2
votes
0answers
130 views

Understanding ElGamal encryption for a Mental Poker Case

I am looking to understand ElGamal encryption as it is used in a specic context described below. I am interested in creating a practical form of Mental Poker for games other than poker developed by ...
1
vote
1answer
129 views

Would this mental poker algorithm work?

I had an idea for a Mental Poker algorithm. Since I'm a n00b, there is likely to be things wrong with it. But since I'm a n00b, I am not able to detect the problems yet. Would this algorithm ensure ...
0
votes
1answer
154 views

Isn't Socialist Millionaires vulnerable if Alice's and Bob's message are picked from a shared list?

I'm interested in a situation where Alice and Bob each pick cards from a deck of 52, and want to test if they picked the same card without revealing what the card is (a "mental poker" situation). The ...
1
vote
2answers
166 views

Is there a cryptographic way (a la mental poker) two people can determine if they both Like each other, without revealing their personal preferences?

Specifically: Alice and Bob want to know if they like each other, but won't admit it if the other person doesn't reciprocate. (They're teenagers, or physicists.) They don't trust anyone else, so want ...
8
votes
1answer
276 views

Is there a mental poker algorithm that does not rely on commutative encryption?

The algorithm for mental poker that I saw on Wikipedia and everywhere else relies on an encryption algorithm such that $E_k(E_j(P)) = E_j(E_k(P))$, but I can't find a modern and secure algorithm for ...
2
votes
0answers
158 views

A question or few about Mental Poker

I have spent some time studying the "Mental Poker" protocol (sometimes called SRA), initially proposed by Shamir, Rivest, and Adleman -- http://people.csail.mit.edu/~rivest/ShamirRivestAdleman-...
7
votes
1answer
514 views

Cryptographic system with double keys with reversible order

While reading Shamir, Rivest and Adleman's paper on "Mental Poker", I've met a mention of system such that $E_a(E_b(x)) = E_b(E_a(x))$, without however disclosing details on it, with $E_a(x)$ being “...
2
votes
0answers
199 views

Relaxed trust criterion for mental poker server?

I've read a lot about protocols for mental poker without a trusted server, but I'm interested in the possibility of a faster, more practical protocol that relaxes that criterion a bit and "trusts" a ...
0
votes
1answer
525 views

How to secure a mental poker protocol? [closed]

I would like to implement a mental poker protocol in a secure fashion. How should I go about that without (preferably) infringing on the Mental Poker Framework patent?
3
votes
1answer
423 views

Mental Poker with untrusted server (i.e. no peer to peer)

The question of implementing peer to peer mental poker has already been asked on stackoverflow. And there appears to be an implementation called LibTMCG. Also on this site a question was asked about ...
5
votes
3answers
650 views

Is there a public key semantically secure cryptosystem for which one can prove in zero knowledge the equivalence of two plaintexts?

If Alice encrypts two messages $a$ and $b$, such that $x=E(a)$, $y=E(b)$. Can Alice prove (without revealing $a$, $b$ or the private key) that $a = b$? Obviously the proof must not be too long and it ...