Recent Advances in Non-perfect Secret Sharing Schemes

摘要

A secret sharing scheme is non-perfect if some subsets of players that cannot recover the secret have partial information about it. This paper is a survey of the recent advances in non-perfect secret sharing schemes. We provide an overview of the techniques for constructing efficient non-perfect secret sharing schemes, bounds on the efficiency of these schemes, and results on the characterization of the ideal ones. We put special emphasis on the connections between non-perfect secret sharing schemes and polymatroids, matroids, information theory, and coding theory.