4 ms·
> In his presentation of the original protocol, Aaronson suggests that zero-knowledge proofs can be used to prevent cheating. However, we find this approach uns
by Kalium 10y ago
> 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.
- mrob 10y agoZKP 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.
- gizmo686 10y agoExcept 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.
- jeremysalwen 10y agoGarbled circuits can be used for the ZKP protocol, and in this case the circuit would just be a single AND gate. https://www.math.ucla.edu/~tdokos/notes_files/garbledCircuits.pdf https://www.math.ucla.edu/~tdokos/notes_files/garbledCircuit...
- rakoo 10y ago> An unavoidable issue with group SENPAI exchanges is the problem of love triangles [...] The authors’ recom- mended solution is polyamory [...] We remark that this situation is just generally shitty, and seri- ously, what do you expect us to even do here? I love this