Remarks on the multiple assignment secret sharing scheme
Ghodosi, Hossein, Pieprzyk, Josef, and Safavi-Naini, Rei (1997) Remarks on the multiple assignment secret sharing scheme. Lecture notes in computer science, 1334 . pp. 72-80.
|PDF - Repository staff only - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader|
The paper analyses the multiple assignment secret sharing scheme, presented at the GLOBECOM'87 Conference, and contains three technical comments. First it is proved that the proposed multiple assignment secret sharing scheme is not perfect. In fact, the non-perfectness of the scheme is due to the non-perfectness of a certain type of Shamir secret sharing scheme defined in the paper. Next, it is shown that both the extended multiple assignment secret sharing scheme and the extended Shamir secret sharing scheme are not secure, i.e., unauthorized sets of participants can recover the secret.
© 1997 Springer Verlag. The published version of this article can be accessed via Springer Link. Use hypertext links above.
|Keywords:||Secret sharing, Perfect secrecy|
|FoR Codes:||08 INFORMATION AND COMPUTING SCIENCES > 0806 Information Systems > 080609 Information Systems Management @ 0%|
01 MATHEMATICAL SCIENCES > 0101 Pure Mathematics > 010101 Algebra and Number Theory @ 0%
08 INFORMATION AND COMPUTING SCIENCES > 0806 Information Systems > 080610 Information Systems Organisation @ 0%
|Deposited On:||21 Sep 2006|
|Last Modified:||02 Nov 2012 08:42|
Last 12 Months: 0
Repository Staff Only: item control page