Secret Sharing Schemes Based on Combinatorial Designs.

In secret-sharing schemes, a secret s is encoded as V1 Vn, and Vi is distributed to member Pi. By the access sets, we mean exactly those subsets of {Pi} which can recover the secret s. Previous secret-sharing have utilized the methods of polynomial interpolation [20] and projective geometry [6], among others. In this paper we show how to obtain secret-sharing schemes from combinatorial designs, including orthogonal arrays (QAs) and t - (v, k, 1) designs. [ABSTRACT FROM AUTHOR]