Timeline for Testing whether a secret value is zero without security bits (in SPDZ)
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 31, 2018 at 0:00 | history | tweeted | twitter.com/StackCrypto/status/1057422019069906944 | ||
| Oct 30, 2018 at 9:25 | answer | added | pscholl | timeline score: 3 | |
| Oct 14, 2018 at 12:53 | comment | added | Dragos | If you want to see whether [x] is zero you can retrieve a random [r] and then Open([x] * [r]). Checking whether [x] > 0 or [x] < 0 it's more complicated and I am not aware of any method computing this without some special preprocessed random bits [b] (using SPDZ). | |
| Oct 14, 2018 at 2:27 | history | edited | user1387682 | CC BY-SA 4.0 |
edited title
|
| Oct 14, 2018 at 0:49 | history | asked | user1387682 | CC BY-SA 4.0 |