Computationally perfect compartmented secret sharing schemes based on MDS codes Online publication date: Sat, 21-Feb-2015
by Appala Naidu Tentu; Prabal Paul; V.Ch. Venkaiah
International Journal of Trust Management in Computing and Communications (IJTMCC), Vol. 2, No. 4, 2014
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³), where n is the number of participants and m is the number of compartments.
Online publication date: Sat, 21-Feb-2015
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Trust Management in Computing and Communications (IJTMCC):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email email@example.com