On Ideal Non-perfect Secret Sharing Schemes

Abstract. This paper first extends the result of Blakley and Kabatianski [3] to general non-perfect SSS using information-theoretic arguments. Furthermore, we refine Okada and Kurosawa’s lower bound [12] into a much more precise information-theoretic characterization of non-perfect secret sharing idealness. In the light of this generalization, we establish that ideal schemes do not always have a matroidal morphology. As an illustration of this result, we design an ad-hoc ideal non-perfect scheme and analyze it in the last section.

• Type: Conference
• Year: 1997
• Where: SPW
• Authors: Pascal Paillier
• Keywords: Information-theoretic Arguments, Kurosawa’s Lower Bound, Precise Information-theoretic Characterization, Security Privacy, SPW 1997