How is Blakley's Secret Sharing Scheme perfect?












2














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?










share|improve this question









New contributor




Ceriath is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
















  • 2




    If I give you a line, can you find my secret point on it?
    – kelalaka
    yesterday










  • 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
    – Ceriath
    yesterday






  • 1




    OK, better formulation: If I give you a line, can you find the x-coordinate of my secret point on it?
    – SEJPM
    yesterday










  • 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
    – kelalaka
    yesterday


















2














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?










share|improve this question









New contributor




Ceriath is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
















  • 2




    If I give you a line, can you find my secret point on it?
    – kelalaka
    yesterday










  • 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
    – Ceriath
    yesterday






  • 1




    OK, better formulation: If I give you a line, can you find the x-coordinate of my secret point on it?
    – SEJPM
    yesterday










  • 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
    – kelalaka
    yesterday
















2












2








2







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?










share|improve this question









New contributor




Ceriath is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.











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






share|improve this question









New contributor




Ceriath is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.











share|improve this question









New contributor




Ceriath is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.









share|improve this question




share|improve this question








edited yesterday









kelalaka

5,97022041




5,97022041






New contributor




Ceriath is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.









asked yesterday









CeriathCeriath

314




314




New contributor




Ceriath is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.





New contributor





Ceriath is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.






Ceriath is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.








  • 2




    If I give you a line, can you find my secret point on it?
    – kelalaka
    yesterday










  • 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
    – Ceriath
    yesterday






  • 1




    OK, better formulation: If I give you a line, can you find the x-coordinate of my secret point on it?
    – SEJPM
    yesterday










  • 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
    – kelalaka
    yesterday
















  • 2




    If I give you a line, can you find my secret point on it?
    – kelalaka
    yesterday










  • 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
    – Ceriath
    yesterday






  • 1




    OK, better formulation: If I give you a line, can you find the x-coordinate of my secret point on it?
    – SEJPM
    yesterday










  • 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
    – kelalaka
    yesterday










2




2




If I give you a line, can you find my secret point on it?
– kelalaka
yesterday




If I give you a line, can you find my secret point on it?
– kelalaka
yesterday












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
– Ceriath
yesterday




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
– Ceriath
yesterday




1




1




OK, better formulation: If I give you a line, can you find the x-coordinate of my secret point on it?
– SEJPM
yesterday




OK, better formulation: If I give you a line, can you find the x-coordinate of my secret point on it?
– SEJPM
yesterday












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
– kelalaka
yesterday






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
– kelalaka
yesterday












1 Answer
1






active

oldest

votes


















2














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.






share|improve this answer










New contributor




Ceriath is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.


















  • And you can use the link I provided to make it more formal. as $r leq (t-1)$
    – kelalaka
    yesterday











Your Answer





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
});


}
});






Ceriath is a new contributor. Be nice, and check out our Code of Conduct.










draft saved

draft discarded


















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









2














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.






share|improve this answer










New contributor




Ceriath is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.


















  • And you can use the link I provided to make it more formal. as $r leq (t-1)$
    – kelalaka
    yesterday
















2














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.






share|improve this answer










New contributor




Ceriath is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.


















  • And you can use the link I provided to make it more formal. as $r leq (t-1)$
    – kelalaka
    yesterday














2












2








2






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.






share|improve this answer










New contributor




Ceriath is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.









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.







share|improve this answer










New contributor




Ceriath is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.









share|improve this answer



share|improve this answer








edited yesterday









kelalaka

5,97022041




5,97022041






New contributor




Ceriath is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.









answered yesterday









CeriathCeriath

314




314




New contributor




Ceriath is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.





New contributor





Ceriath is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.






Ceriath is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.












  • And you can use the link I provided to make it more formal. as $r leq (t-1)$
    – kelalaka
    yesterday


















  • And you can use the link I provided to make it more formal. as $r leq (t-1)$
    – kelalaka
    yesterday
















And you can use the link I provided to make it more formal. as $r leq (t-1)$
– kelalaka
yesterday




And you can use the link I provided to make it more formal. as $r leq (t-1)$
– kelalaka
yesterday










Ceriath is a new contributor. Be nice, and check out our Code of Conduct.










draft saved

draft discarded


















Ceriath is a new contributor. Be nice, and check out our Code of Conduct.













Ceriath is a new contributor. Be nice, and check out our Code of Conduct.












Ceriath is a new contributor. Be nice, and check out our Code of Conduct.
















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.





Some of your past answers have not been well-received, and you're in danger of being blocked from answering.


Please pay close attention to the following guidance:


  • 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.


To learn more, see our tips on writing great answers.




draft saved


draft discarded














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





















































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







Popular posts from this blog

1300-talet

1300-talet

Display a custom attribute below product name in the front-end Magento 1.9.3.8