Comments on “the measurement of factorial indeterminacy”.pdfVIP

* Multi-Secret Sharing Schemes EXTENDEDABSTRACT Carlo Blundo, Alfred0 De Santis, Giovanni Di Crescenzo, Antonio Giorgio Gaggia, and Ugo Vaccaro Dipartimento di Informatica ed Applicazioni, Universiti di Salerno, 84081 Baronissi (SA), Italy {carblu,ads ,giodic,antgio ,uv)@udsab.dia.unisa.it Abstract. A multi-secret sharing scheme is a protocol to share m arbi- trarily related secrets s1,. . .,sm among a set of participants P.In this paper we put forward a general theory of multi-secret sharing schemes by using an information theoretical framework. We prove lower bounds on the size of information held by each participant for various access structures. Finally, we prove the optimality of the bounds by providing protocols. 1 Introduction A secret sharing scheme is a technique to share a secret s among a set P‘ of participants in such a way that only qualified subsets, pooling together their in- formation, can reconstruct the secret s; but subsets of participants that are not enabled to recover the secret have no information on it. Secret sharing schemes are useful in any important action that requires the concurrence of several de- signed people to be initiated, as launching a missile, opening a bank vault or even opening a safety deposit box. Secret sharing schemes are also used in man- agement of cryptographic keys and multi-party secure protocols (see [lo), [2] ). Secret sharing schemes were introduced by Shamir [lG]and Blakley [3]. They analyzed the case when only subsets A of