Live data from Hacker News

Solving the Dating Problem with the SENPAI Protocol [pdf]

sigtbd.csail.mit.edu

11–20 of 113 posts

Re: Solving the Dating Problem with the SENPAI Protocol [pdf]

#11
> Unfortunately, this protocol is completely dependent on the trustworthiness of Trent, as they receive all of Alice and Bob’s information and are entirely free to manipulate the results of the protocol. If Trent has been compromised, perhaps by a nation-state adversary, Alice and Bob’s love life will be completely in the hands of a malicious attacker

Beautifully done.

Re: Solving the Dating Problem with the SENPAI Protocol [pdf]

#12
post #8
post #5

> In his presentation of the original protocol, Aaronson suggests that zero-knowledge proofs can be used to prevent cheating. However, we find this approach unsatisfying, partly because zero-knowledge proofs would make the protocol much more unwieldy and time-consuming, and partly because we have no clue how to actually implement ZKP in this context I am in love with the honesty in this.

ZKP is also useless in this case because there's no way to enforce dating if the ZKP finds a match. Anybody who wants to detect a crush can simply lie about having one themself.

Except the presented protocol already does not prevent this attack (which they acknowledge in the paper).

ZKP still provides the property that cheating will be detected, which is all that is required to satisfy the papers security definition.

Re: Solving the Dating Problem with the SENPAI Protocol [pdf]

#14

There is a dating problem?

> The problem concerns two agents Alice and Bob (or Alex and Bob, or Alice and Beatrice), each of whom may or may not have a crush on the other. Each is initially unaware of the other’s feelings, and if they have a crush, they would like to know whether the other does as well; however, each would like to reveal their crush only if the other shares the interest.

This does not just apply to crushes but also more specific sexual interests. Unfortunately, the fact that you want your partner to use a service such as this already leaks that your interest is unusual or socially frowned upon.

Re: Solving the Dating Problem with the SENPAI Protocol [pdf]

#15

Earlier quoted context omitted.

> The problem concerns two agents Alice and Bob (or Alex and Bob, or Alice and Beatrice), each of whom may or may not have a crush on the other. Each is initially unaware of the other’s feelings, and if they have a crush, they would like to know whether the other does as well; however, each would like to reveal their crush only if the other shares the interest.

This does not just apply to crushes but also more specific sexual interests. Unfortunately, the fact that you want your partner to use a service such as this already leaks that your interest is unusual or socially frowned upon.

That is not necessarily a problem. I would not mind leaking the fact that there exists a sexual interest I have that is embarrassing, as long as I do not leak what that interest is. In fact, I have publicly said that I have sexual preferences that I do not want to be known on multiple occasions.

Incidently, an MFP like service already exists for this usecase [0].

[0] http://mojoupgrade.com/

Re: Solving the Dating Problem with the SENPAI Protocol [pdf]

#17
post #13

Earlier quoted context omitted.

I thought Tinder had it solved...

Tinder is Trent in this protocol. As long as both Alice and Bob trust Trent, that works. But Trent can cheat.

And then the Russians might control our love lives!

Re: Solving the Dating Problem with the SENPAI Protocol [pdf]

#18
For those not getting the reference, "senpai" is a Japanese honorific used to address one's upper classman in school.

A common trope in Japanese medium is that a character will have a crush on a senpai (equivalent to a prefect or hall monitor in that context), only for them to be utterly oblivious to it.

http://tvtropes.org/pmwiki/pmwiki.php/Main/SempaiKohai

This is a witty paper, as other commenters are noting.

Re: Solving the Dating Problem with the SENPAI Protocol [pdf]

#19

Earlier quoted context omitted.

> The problem concerns two agents Alice and Bob (or Alex and Bob, or Alice and Beatrice), each of whom may or may not have a crush on the other. Each is initially unaware of the other’s feelings, and if they have a crush, they would like to know whether the other does as well; however, each would like to reveal their crush only if the other shares the interest.

This does not just apply to crushes but also more specific sexual interests. Unfortunately, the fact that you want your partner to use a service such as this already leaks that your interest is unusual or socially frowned upon.

What percentage of people have an interest like that though? If I had to pull a number from nowhere I would say at least 50%, so using the service shouldn't be particularly damning.

Re: Solving the Dating Problem with the SENPAI Protocol [pdf]

#20
post #17
post #13

Earlier quoted context omitted.

Tinder is Trent in this protocol. As long as both Alice and Bob trust Trent, that works. But Trent can cheat.

And then the Russians might control our love lives!

I'm prepared to give them a go at this point, they can't do a worse job of it than me.
Post reply on HN