How to share a secret with cheaters (Q1112786): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q4091421 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3778674 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3777937 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A “Paradoxical” Solution to The Signature Problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3919787 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: How to share a secret / rank | |||
Normal rank |
Revision as of 10:15, 19 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | How to share a secret with cheaters |
scientific article |
Statements
How to share a secret with cheaters (English)
0 references
1988
0 references
This paper demonstrates that \textit{A. Shamir}'s scheme [Commun. ACM 22, 612-613 (1979; Zbl 0414.94021)] is not secure against certain forms of cheating. A small modification to his scheme retains the security and efficiency of the original, is secure against these forms of cheating, and preserves the property that its security does not depend on any unproven assumptions such as the intractability of computing number- theoretic functions.
0 references
secret sharing
0 references
interpolation
0 references
reconstruction
0 references
cheating
0 references
security
0 references