How is Blakley's Secret Sharing Scheme perfect? Currently, I am trying to understand Blakley's secret sharing scheme. However, there seem to be multiple descriptions of it, which are very different from another, but everyone states that the scheme would be perfectly secure.

From my understanding it works like this:


a point $S$ in $t$-dimensional space is created with one coordinate being secret and the others randomly selected
$n$ hyperplanes through the point $S$ are created and distributed
to reconstruct the secret, $t$ hyperplanes are required, which will intersect at the point $S$.


However, from my understanding, if someone would possess one or more hyperplanes, they would know that $S$ lies somewhere on that hyperplane (or the intersection of multiple hyperplanes)

So my question is;


how is Blakley's scheme considered perfectly secure when an insider knows that the secret lies on his plane?
Okay so SEJPM's comment just gave me an answer or better made me realize my flaw:

Since the secret is only one coordinate (e.g. $x$) the information that the secret is on a specific infinite line is as much information as having none at all, since guessing $x$ of a point on $y = 5*x$ is worth as much as guessing $x$ of a point on $y = z * x$

The information would only be revealed if the secret would be the entire point, not just one coordinate.