Abstract.
A characterization of ideal secret sharing schemes with an arbitrary number of keys is derived in terms of balanced maximum-order correlation immune functions. In particular, it is proved that a matroid is an associated matroid for a binary ideal secret sharing scheme if and only if it is representable over the binary field. Access structure characterization of connected binary ideal schemes is established and a general method for their construction is pointed out.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
Author information
Authors and Affiliations
Additional information
Received 16 April 1993 and revised 10 October 1996
Rights and permissions
About this article
Cite this article
Golic, J. On Matroid Characterization of Ideal Secret Sharing Schemes . J. Cryptology 11, 75–86 (1998). https://doi.org/10.1007/s001459900036
Published:
Issue Date:
DOI: https://doi.org/10.1007/s001459900036