DYNAMIC MULTI-SECRET SHARING SCHEME WITH CHEATER DETECTION

Abstract

Secret sharing scheme are used are primarily used in cryptosystem for distributing shares of a secret among a set of entities in such a way that the secret can be reconstructed only with certain combination of shares. These schemes are mainly used in applications where there is no single trusted entity. In this thesis we propose a Dynamic Multi-Secret Sharing Scheme with cheater detection mechanism. The proposed scheme has advantage of Lin –Yen‟s scheme in which each participant has only one secret share for reconstructed multiple secrets. In addition, proposed scheme does not require any secure channel between any participant and the dealer during secret share distribution phase. Analysis shows that the proposed scheme is as secure as the scheme which uses secure channel for distribution of share.