Beautifully done.
Solving the Dating Problem with the SENPAI Protocol [pdf]
11–20 of 113 posts
Re: Solving the Dating Problem with the SENPAI Protocol [pdf]
#12> 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.
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]
#13Re: Solving the Dating Problem with the SENPAI Protocol [pdf]
#14There 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.
Re: Solving the Dating Problem with the SENPAI Protocol [pdf]
#15Earlier 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.
Incidently, an MFP like service already exists for this usecase [0].
Re: Solving the Dating Problem with the SENPAI Protocol [pdf]
#16Re: Solving the Dating Problem with the SENPAI Protocol [pdf]
#17Re: Solving the Dating Problem with the SENPAI Protocol [pdf]
#18A 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]
#19Earlier 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.