Blakley secret sharing scheme
E831737
The Blakley secret sharing scheme is a threshold cryptographic method that hides a secret as the intersection point of multiple hyperplanes, requiring a minimum number of shares (hyperplanes) to reconstruct it.
Observed surface forms (1)
| Surface form | Occurrences |
|---|---|
| Blakley | 2 |
Statements (49)
| Predicate | Object |
|---|---|
| instanceOf |
information-theoretic secret sharing scheme
ⓘ
secret sharing scheme ⓘ threshold cryptographic scheme ⓘ |
| advantage | conceptually simple geometric interpretation ⓘ |
| application |
distributed trust
ⓘ
key management ⓘ secure multiparty control of cryptographic keys ⓘ |
| basedOn | intersection of hyperplanes ⓘ |
| category | key management protocol ⓘ |
| comparedWith | Shamir secret sharing scheme NERFINISHED ⓘ |
| condition | t ≤ n ⓘ |
| contemporaryWith | Shamir secret sharing scheme NERFINISHED ⓘ |
| differenceFromShamirScheme | uses geometric hyperplanes instead of polynomial interpolation ⓘ |
| disadvantage | shares may leak geometric information about the secret space if not over large fields ⓘ |
| field |
cryptography
ⓘ
information security ⓘ information theory NERFINISHED ⓘ |
| generalizationOf | geometric secret sharing ⓘ |
| goal | distribute trust among multiple participants ⓘ |
| hasProperty |
information-theoretic security
ⓘ
linear secret sharing ⓘ perfect secret sharing ⓘ threshold property ⓘ |
| influenced | later geometric secret sharing schemes ⓘ |
| introducedBy | George R. Blakley NERFINISHED ⓘ |
| introducedIn | 1979 ⓘ |
| protects | cryptographic keys ⓘ |
| publishedIn | Proceedings of the National Computer Conference NERFINISHED ⓘ |
| reconstructionMethod | compute unique point common to all given hyperplanes ⓘ |
| reconstructionRequires | intersection of at least t hyperplanes ⓘ |
| representsSecretAs | point in a vector space ⓘ |
| representsSharesAs | hyperplanes containing the secret point ⓘ |
| requires | minimum number of shares to reconstruct secret ⓘ |
| requiresComputation | solving systems of linear equations ⓘ |
| requiresParameter |
number of participants n
ⓘ
threshold t ⓘ |
| secret | unique intersection point of hyperplanes ⓘ |
| securityGuarantee | fewer than t shares reveal no information about the secret ⓘ |
| securityModel | honest-but-curious adversaries for basic construction ⓘ |
| share | equation of a hyperplane ⓘ |
| shareGenerationMethod | choose random hyperplanes through secret point ⓘ |
| shareSpace | t-dimensional or higher-dimensional vector space ⓘ |
| thresholdType | (t,n)-threshold scheme NERFINISHED ⓘ |
| titleOfOriginalPaper | Safeguarding cryptographic keys ⓘ |
| typicalImplementationDomain | finite field GF(q) GENERATED ⓘ |
| uses |
finite fields
ⓘ
geometric construction ⓘ hyperplanes ⓘ linear algebra ⓘ |
Referenced by (3)
Full triples — surface form annotated when it differs from this entity's canonical label.
this entity surface form:
Blakley
this entity surface form:
Blakley