Computationally perfect compartmented secret sharing schemes based on MDS codes. (1st January 2014)

• Record Type: Journal Article
• Authors: Tentu, Appala Naidu; Paul, Prabal; Venkaiah, V.Ch.
• Is Part Of: International journal on trust management in computing and communications. Volume 2:Number 4(2014)
• Page Start: 353
• Page End: 378
• Publication Date: 2014-01-01
• Subjects: compartmented access structure -- computationally perfect -- ideal -- MDS code -- secret sharing scheme; Data protection -- Periodicals; Database management -- Periodicals; Computer security -- Periodicals; Electronic data processing departments -- Security measures -- Periodicals; 005.8
• DOI: 10.1504/IJTMCC.2014.067378
• Languages: English
• ISSNs: 2048-8378

Abstract

Two compartmented secret sharing schemes are proposed in this paper. Constructions of the proposed schemes are based on the maximum distance separable (MDS) codes. One of the proposed schemes is perfect in classical sense and the other scheme, what we call, is computationally perfect. By computationally perfect, we mean, an authorised set can always reconstruct the secret in polynomial time whereas for an unauthorised set this is computationally hard. This is in contrast to some of the existing schemes in the literature, in which an authorised set can recover the secret only with certain probability. Also, in our schemes unlike in some of the existing schemes, the size of the ground field need not be extremely large. One of the proposed schemes is shown to be ideal and the information rate for the other scheme is 1/2. Both the schemes are efficient and require O ( mn 3 ), where n is the number of participants and m is the number of compartments.