Blakley's scheme ( Secret Sharing)
Jump to navigation
Jump to search
Time Complexity
$O(t^{3})$ for secret computation? (requires linear solver)
Space Complexity
$O(t)$ per person, $O(t^{2})$ to figure out secret words
(Each person needs to keep track of coefficients of hyperplane; figuring out secret requires O(t) hyperplanes, with O(t) coefficients)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1979