Timeline for Cryptography and Availability
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 6, 2012 at 2:12 | comment | added | Henry Cohn | Oops, I misread the problem, sorry. But now it sounds impossible to me: if R can be reconstructed from any two of the I's, no matter what the third one is, then it can't depend on any of them (and must be constant). | |
| Sep 5, 2012 at 20:31 | comment | added | Shanti | @will: Thanks. I'll try there. @Henry: This one is something similar to the reverse of secret sharing where you want to reach one matrix from 3 not creating 3 matrix forom one. Secret sharing is not an efficient way of doing it specially for large number of elements in a big matrix. I am looking for an efficient algorithms | |
| Sep 5, 2012 at 19:55 | comment | added | Henry Cohn | This is off topic here (since it's not really a research question in mathematics), but if I understand the question right then "secret sharing" may be what you're looking for. | |
| Sep 5, 2012 at 19:44 | comment | added | Will Jagy | try math.stackexchange.com/questions?sort=active | |
| Sep 5, 2012 at 18:49 | history | asked | Shanti | CC BY-SA 3.0 |