Talk:Socialist millionaire problem/Archive 1
Latest comment: 13 years ago by 70.116.69.206 in topic Clarify what an attacker can do
 | This is an archive of past discussions about Socialist millionaire problem. Do not edit the contents of this page. If you wish to start a new discussion or revive an old one, please do so on the current talk page. |
| Archive 1 |
Poorly writte
Article uses variable it never introduces, namely alpha and beta. In general, the article feels like it was written as a blob of cut & paste errors.
Clarify what an attacker can do
- An active attacker, capable of arbitrarily interfering with Alice and Bob's communication (a man-in-the-middle) cannot learn more than a passive attacker, and cannot affect the outcome of the protocol other than to make it fail.
What does make it fail mean here?
- Alice and Bob wish to learn if x = y without allowing either party to learn anything else about the other's secret value.
It would help to be clear on what the outcomes for Alice and Bob are. They initiate this procedure and get a result. What are the possible results? Is it binary, just equals or not equals, or is there also a "unable to determine" result they can discern? If it's binary, then failure is presumably causing them to get the not equals response, because it's the equals response that they will respond to by sharing secrets. 70.116.69.206 (talk) 19:00, 1 April 2013 (UTC)