Title: CRT based multi-secret sharing schemes: revisited

Authors: Appala Naidu Tentu; V.Ch. Venkaiah; V. Kamakshi Prasad

Addresses: CR Rao Advanced Institute of Mathematics, Statistics and Computer Science (AIMSCS), University of Hyderabad Campus, Hyderabad, 500046, India ' School of Computer and Information Sciences, University of Hyderabad, Hyderabad, 500046, India ' Department of C.S.E., JNTU College of Engineering, JNTU Hyderabad, 500085, India

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.

Keywords: multi-stage; multi-level; Mignotte's sequence; CRT; Chinese remainder theorem; secret sharing scheme; cheating detection.

DOI: 10.1504/IJSN.2018.090637

International Journal of Security and Networks, 2018 Vol.13 No.1, pp.1 - 9

Accepted: 16 May 2017
Published online: 25 Mar 2018 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article