Timeline for Can two traitors safely reveal themselves to each other?
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 20, 2020 at 18:19 | vote | accept | kcghost | ||
| Jun 20, 2020 at 12:02 | answer | added | SEJPM | timeline score: 1 | |
| Jun 20, 2020 at 10:33 | comment | added | SEJPM | All decent secure two-party protocols can compute AND gates (e.g. Yao and its modern derivative HalfGates or GMW). You can also turn a socialist-millionaire's protocol into an AND gate by having both pick random values if they input 0 and else pick a fixed value. I think there are also optimized protocols that only compute one AND, but I couldn't find any right now. | |
| Jun 20, 2020 at 10:27 | review | First posts | |||
| Jun 20, 2020 at 12:53 | |||||
| Jun 20, 2020 at 10:25 | history | asked | kcghost | CC BY-SA 4.0 |