Abstract
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.
Support for this project was provided in part by the Australian Research Council under the reference number A49530480 and the ATERB grant
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
A. Shamir, “How to Share a Secret,” Communications of the ACM, vol. 22, pp. 612–613, Nov. 1979.
G. Blakley, “Safeguarding cryptographic keys,” in Proceedings of AFIPS 1979 National Computer Conference, vol. 48, pp. 313–317, 1979.
D. Chaum, “Computer Systems Established, Maintained, and Trusted by Mutually Suspicious Groups,” tech. rep., Memorandum No. UCB/ERL M/79/10, University of California, Berkeley, CA, Feb. 1979.
M. Ito, A. Saito, and T. Nishizeki, “Secret Sharing Scheme Realizing General Access Structure,” in Proceedings IEEE Global Telecommun. Conf., Globecom '87, pp. 99–102, Washington: IEEE Communications Soc. Press, 1987.
J. Benaloh and J. Leichter, “Generalized Secret Sharing and Monotone Functions,” in Advances in Cryptology — Proceedings of CRYPTO '88 (S. Goldwasser, ed.), vol. 403 of Lecture Notes in Computer Science, pp. 27–35, Springer-Verlag, 1990.
G. Simmons, “How to (Really) Share a Secret,” in Advances in Cryptology — Proceedings of CRYPTO '88 (S. Goldwasser, ed.), vol. 403 of Lecture Notes in Computer Science, pp. 390–448, Springer-Verlag, 1990.
G. Simmons, “Robust Shared Secret Schemes or ‘How to be Sure You Have the Right Answer Even Though You Don't Know the Question',” in 18th Annual Conference on Numerical mathematics and Computing, vol. 68 of Congressus Numerantium, (Manitoba, Canada), pp. 215–248, Winnipeg, May 1989.
G. Simmons, “Prepositioned Shared Secret and/or Shared Control Schemes,” in Advances in Cryptology — Proceedings of EUROCRYPT '89 (J.-J. Quisquater and J. Vandewalle, eds.), vol. 434 of Lecture Notes in Computer Science, pp. 436–467, Springer-Verlag, 1990.
D. Stinson, “An Explication of Secret Sharing Schemes,” Designs, Codes and Cryptography, vol. 2, pp. 357–390, 1992.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag
About this paper
Cite this paper
Ghodosi, H., Pieprzyk, J., Safavi-Naini, R. (1997). Remarks on the multiple assignment secret sharing scheme. In: Han, Y., Okamoto, T., Qing, S. (eds) Information and Communications Security. ICICS 1997. Lecture Notes in Computer Science, vol 1334. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0028463
Download citation
DOI: https://doi.org/10.1007/BFb0028463
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63696-0
Online ISBN: 978-3-540-69628-5
eBook Packages: Springer Book Archive