CRT based multi-secret sharing schemes: revisited Online publication date: Sun, 25-Mar-2018
by Appala Naidu Tentu; V.Ch. Venkaiah; V. Kamakshi Prasad
International Journal of Security and Networks (IJSN), Vol. 13, No. 1, 2018
Abstract: Secret sharing is a cryptographic primitive, which is used to distribute a secret among a set of participants in such a way that an authorised subset of participants can uniquely reconstruct the secret and an unauthorised subset can get no information about the secret. In this paper, we propose multi-stage multi-secret sharing scheme based on Mignotte's sequence and multi-level multi-secret sharing scheme based on Asmuth's Bloom sequence. The advantage of the proposed schemes is that the secret space is larger than that of the existing schemes. There is no leakage of information through public values. Novelty of these schemes is that the participants can reuse their shares for each new set of secrets without refreshing their shares. Moreover, the first scheme can verify the honesty of both the dealer and participants. The correctness of the proposed schemes is discussed and shows that the proposed schemes are computationally secure.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
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 Security and Networks (IJSN):
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 subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook