How is Blakley's Secret Sharing Scheme perfect?
$begingroup$
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?
secret-sharing
edited Jan 8 at 12:35
kelalaka
8,60022351
asked Jan 8 at 12:20
CeriathCeriath
32610
$endgroup$
add a comment |
$begingroup$
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?
secret-sharing
edited Jan 8 at 12:35
kelalaka
8,60022351
asked Jan 8 at 12:20
CeriathCeriath
32610
$endgroup$
2
$begingroup$
If I give you a line, can you find my secret point on it?
$endgroup$
– kelalaka
Jan 8 at 12:31
$begingroup$
since a line is infinite, i can't. But from my understanding perfect means, that no information at all is revealed about the secret, while in this case it would reveal that it is somewhere on that line
$endgroup$
– Ceriath
Jan 8 at 12:38
2
$begingroup$
OK, better formulation: If I give you a line, can you find the x-coordinate of my secret point on it?
$endgroup$
– SEJPM♦
Jan 8 at 12:41
$begingroup$
Defn: A secret sharing scheme is called perfect if the probability of deception has the same value for all illegal constellations of participants. and see page 21
$endgroup$
– kelalaka
Jan 8 at 12:44
add a comment |
$begingroup$
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?
secret-sharing
edited Jan 8 at 12:35
kelalaka
8,60022351
asked Jan 8 at 12:20
CeriathCeriath
32610
$endgroup$
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?
secret-sharing
secret-sharing
edited Jan 8 at 12:35
kelalaka
8,60022351
asked Jan 8 at 12:20
CeriathCeriath
32610
edited Jan 8 at 12:35
kelalaka
8,60022351
asked Jan 8 at 12:20
CeriathCeriath
32610
edited Jan 8 at 12:35
kelalaka
8,60022351
edited Jan 8 at 12:35
kelalaka
8,60022351
edited Jan 8 at 12:35
kelalaka
8,60022351
8,60022351
asked Jan 8 at 12:20
CeriathCeriath
32610
asked Jan 8 at 12:20
CeriathCeriath
32610
asked Jan 8 at 12:20
CeriathCeriath
32610
32610
2
$begingroup$
If I give you a line, can you find my secret point on it?
$endgroup$
– kelalaka
Jan 8 at 12:31
$begingroup$
since a line is infinite, i can't. But from my understanding perfect means, that no information at all is revealed about the secret, while in this case it would reveal that it is somewhere on that line
$endgroup$
– Ceriath
Jan 8 at 12:38
2
$begingroup$
OK, better formulation: If I give you a line, can you find the x-coordinate of my secret point on it?
$endgroup$
– SEJPM♦
Jan 8 at 12:41
$begingroup$
Defn: A secret sharing scheme is called perfect if the probability of deception has the same value for all illegal constellations of participants. and see page 21
$endgroup$
– kelalaka
Jan 8 at 12:44
add a comment |
2
$begingroup$
If I give you a line, can you find my secret point on it?
$endgroup$
– kelalaka
Jan 8 at 12:31
$begingroup$
since a line is infinite, i can't. But from my understanding perfect means, that no information at all is revealed about the secret, while in this case it would reveal that it is somewhere on that line
$endgroup$
– Ceriath
Jan 8 at 12:38
2
$begingroup$
OK, better formulation: If I give you a line, can you find the x-coordinate of my secret point on it?
$endgroup$
– SEJPM♦
Jan 8 at 12:41
$begingroup$
Defn: A secret sharing scheme is called perfect if the probability of deception has the same value for all illegal constellations of participants. and see page 21
$endgroup$
– kelalaka
Jan 8 at 12:44
2
2
$begingroup$
If I give you a line, can you find my secret point on it?
$endgroup$
– kelalaka
Jan 8 at 12:31
$begingroup$
If I give you a line, can you find my secret point on it?
$endgroup$
– kelalaka
Jan 8 at 12:31
$begingroup$
since a line is infinite, i can't. But from my understanding perfect means, that no information at all is revealed about the secret, while in this case it would reveal that it is somewhere on that line
$endgroup$
– Ceriath
Jan 8 at 12:38
$begingroup$
since a line is infinite, i can't. But from my understanding perfect means, that no information at all is revealed about the secret, while in this case it would reveal that it is somewhere on that line
$endgroup$
– Ceriath
Jan 8 at 12:38
2
2
$begingroup$
OK, better formulation: If I give you a line, can you find the x-coordinate of my secret point on it?
$endgroup$
– SEJPM♦
Jan 8 at 12:41
$begingroup$
OK, better formulation: If I give you a line, can you find the x-coordinate of my secret point on it?
$endgroup$
– SEJPM♦
Jan 8 at 12:41
$begingroup$
Defn: A secret sharing scheme is called perfect if the probability of deception has the same value for all illegal constellations of participants. and see page 21
$endgroup$
– kelalaka
Jan 8 at 12:44
$begingroup$
Defn: A secret sharing scheme is called perfect if the probability of deception has the same value for all illegal constellations of participants. and see page 21
$endgroup$
– kelalaka
Jan 8 at 12:44
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
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.
edited Jan 8 at 12:49
kelalaka
8,60022351
answered Jan 8 at 12:47
CeriathCeriath
32610
$endgroup$
$begingroup$
And you can use the link I provided to make it more formal. as $r leq (t-1)$
$endgroup$
– kelalaka
Jan 8 at 12:52
add a comment |
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "281"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: false,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: null,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcrypto.stackexchange.com%2fquestions%2f66337%2fhow-is-blakleys-secret-sharing-scheme-perfect%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
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.
edited Jan 8 at 12:49
kelalaka
8,60022351
answered Jan 8 at 12:47
CeriathCeriath
32610
$endgroup$
$begingroup$
And you can use the link I provided to make it more formal. as $r leq (t-1)$
$endgroup$
– kelalaka
Jan 8 at 12:52
add a comment |
$begingroup$
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.
edited Jan 8 at 12:49
kelalaka
8,60022351
answered Jan 8 at 12:47
CeriathCeriath
32610
$endgroup$
$begingroup$
And you can use the link I provided to make it more formal. as $r leq (t-1)$
$endgroup$
– kelalaka
Jan 8 at 12:52
add a comment |
$begingroup$
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.
edited Jan 8 at 12:49
kelalaka
8,60022351
answered Jan 8 at 12:47
CeriathCeriath
32610
$endgroup$
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.
edited Jan 8 at 12:49
kelalaka
8,60022351
answered Jan 8 at 12:47
CeriathCeriath
32610
edited Jan 8 at 12:49
kelalaka
8,60022351
edited Jan 8 at 12:49
kelalaka
8,60022351
edited Jan 8 at 12:49
kelalaka
8,60022351
8,60022351
answered Jan 8 at 12:47
CeriathCeriath
32610
answered Jan 8 at 12:47
CeriathCeriath
32610
answered Jan 8 at 12:47
CeriathCeriath
32610
32610
$begingroup$
And you can use the link I provided to make it more formal. as $r leq (t-1)$
$endgroup$
– kelalaka
Jan 8 at 12:52
add a comment |
$begingroup$
And you can use the link I provided to make it more formal. as $r leq (t-1)$
$endgroup$
– kelalaka
Jan 8 at 12:52
$begingroup$
And you can use the link I provided to make it more formal. as $r leq (t-1)$
$endgroup$
– kelalaka
Jan 8 at 12:52
$begingroup$
And you can use the link I provided to make it more formal. as $r leq (t-1)$
$endgroup$
– kelalaka
Jan 8 at 12:52
add a comment |
Thanks for contributing an answer to Cryptography Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcrypto.stackexchange.com%2fquestions%2f66337%2fhow-is-blakleys-secret-sharing-scheme-perfect%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
2
$begingroup$
If I give you a line, can you find my secret point on it?
$endgroup$
– kelalaka
Jan 8 at 12:31
$begingroup$
since a line is infinite, i can't. But from my understanding perfect means, that no information at all is revealed about the secret, while in this case it would reveal that it is somewhere on that line
$endgroup$
– Ceriath
Jan 8 at 12:38
2
$begingroup$
OK, better formulation: If I give you a line, can you find the x-coordinate of my secret point on it?
$endgroup$
– SEJPM♦
Jan 8 at 12:41
$begingroup$
Defn: A secret sharing scheme is called perfect if the probability of deception has the same value for all illegal constellations of participants. and see page 21
$endgroup$
– kelalaka
Jan 8 at 12:44