Hacker News Board Hacker News, browsed like a classic message board
Live data from Hacker News

Solving the Dating Problem with the SENPAI Protocol [pdf]

sigtbd.csail.mit.edu

Post reply on HN
Print view View original

1–10 of 113 posts

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

#5

Post by Kalium »

> 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.

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

#6

Post by joshuakcockrell »

JacksonGariety wrote: post #2

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.

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

#8

Post by mrob »

Kalium wrote: 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.
Post reply on HN