Timeline for Shamir Secret Sharing Modular Reduction
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 24, 2014 at 18:13 | history | edited | mikeazo | CC BY-SA 3.0 |
added 555 characters in body
|
| Jan 24, 2014 at 17:35 | comment | added | mikeazo | @poncho, good point. I'll have to dive deeper into the protocol outlined in the paper I linked to see if it mitigates that. | |
| Jan 24, 2014 at 14:33 | comment | added | fgrieu♦ | MPC [thinking] Oh yes, Multi Party Computation. | |
| Jan 24, 2014 at 14:20 | comment | added | poncho | I believe the idea is that recover $k \bmod m$ without anyone being able to learn more about $k$. If so, it doesn't quite work; someone learning $k \bmod m$ and the number of iterations we went through the above procedure can easily rederive the original $k$ value. | |
| Jan 24, 2014 at 13:57 | history | edited | mikeazo | CC BY-SA 3.0 |
added 10 characters in body
|
| Jan 24, 2014 at 13:52 | history | edited | mikeazo | CC BY-SA 3.0 |
added 10 characters in body
|
| Jan 24, 2014 at 13:44 | history | answered | mikeazo | CC BY-SA 3.0 |