Abstract
We define strongly ideal secret sharing schemes to be ideal secret sharing schemes in which certain natural requirements are placed on the decoder. We prove an information-theoretic characterization of perfect schemes, and use it to determine which access structures can be encoded by strongly ideal schemes. We also discuss a hierarchy of secret sharing schemes that are more powerful than strongly ideal schemes.
Article PDF
Similar content being viewed by others
References
J. C. Benaloh and J. Leichter, Generalized secret sharing and monotone functions,Advances in Cryptology—Crypto '88 Proceedings, Springer-Verlag, Berlin, 1988, pp. 27–35.
E. F. Brickell, Some ideal secret sharing schemes,Journal of Combinatorial Mathematics and Combinatorial Computing, vol. 6 (1989), pp. 105–113.
E. F. Brickell and D. M. Davenport, On the classification of ideal secret sharing schemes,Advances in Cryptology—Crypto '89 Proceedings, Springer-Verlag, Berlin, 1989, pp. 278–285.
M. Ito, A. Saito, and T. Nishizeki, Secret sharing scheme realizing general access structure,Proceedings of the IEEE Global Telecommunications Conference Globecom '87, Tokyo, IEEE Communications Society Press, Washington, DC, 1987, pp. 99–102.
A. Shamir, How to share a secret,Communications of the ACM vol. 22 (1979), no. 11, pp. 612–613.
G. Simmons, An introduction to shared secret and/or shared control schemes and their applications, inContemporary Cryptology: the Science of Information (ed. G. J. Simmons), IEEE Press, New York, 1992.
Author information
Authors and Affiliations
Additional information
Communicated by Ernest F. Brickell
Rights and permissions
About this article
Cite this article
Phillips, S.J., Phillips, N.C. Strongly ideal secret sharing schemes. J. Cryptology 5, 185–191 (1992). https://doi.org/10.1007/BF02451114
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02451114