Timeline for Security difference(s) between Shamir's Secret Sharing Scheme and Blakley's Secret Sharing Scheme?
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 21, 2021 at 18:21 | comment | added | JamesTheAwesomeDude | I would hugely appreciate to see some more hard-hitting answers to this, backed by at least citations of others' research, if not in-depth explanations or analysis of the research... | |
| Jan 29, 2017 at 10:15 | vote | accept | e-sushi | ||
| Jan 29, 2017 at 6:56 | history | tweeted | twitter.com/StackCrypto/status/825598407809044480 | ||
| Jan 28, 2017 at 16:15 | comment | added | Ilmari Karonen | ... This paper by E.F. Brickell has a very nice-looking geometric description, but it looks quite different from the other descriptions I've seen. And of course there's Blakley's original paper, but it's pretty hard to follow, its proofs are incomplete, and it appears to describe a scheme that is even less efficient than the other descriptions I've seen (e.g. only reconstructing a set of $t^2+t$ candidate secrets, for a threshold $t$ scheme). | |
| Jan 28, 2017 at 16:14 | comment | added | Ilmari Karonen | While trying to answer this question, I ran into the complication that there seem to be multiple descriptions of "Blakley's secret sharing" around, and it's not at all obvious to me that they're all equivalent or even equally secure. Wikipedia's summary is too vague to be of any use. The slides linked from this answer only show an example of the 3-out-of-3 scheme, and I'm not too sure even that's accurate. ... | |
| Jan 28, 2017 at 15:03 | answer | added | lmnopcdefg | timeline score: 6 | |
| Jan 28, 2017 at 12:23 | history | edited | e-sushi | CC BY-SA 3.0 |
added 10 characters in body
|
| Jan 28, 2017 at 12:10 | history | asked | e-sushi | CC BY-SA 3.0 |