Multi-Stage Secret Sharing Schemes Based on Asmuth’s Bloom Sequence

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

Multi-Stage Secret Sharing Schemes Based on Asmuth’s Bloom Sequence

Appala Naidu Tentu ¹, V. Kamakshi Prasad ², V. Ch. Venkaiah ³

Affiliations
1 Jawaharlal Nehru Technological University, Hyderabad, India
2 Department of Computer Science Engineering, JNTU, Hyderabad, India
3 School of Computer and Information Science (SCIS), University of Hyderabad, India

We have proposed secret sharing scheme that uses the Mignotte's sequence proposed in our previous paper in [15]. Another secret sharing scheme that uses the Asmuth-Bloom’s sequence are proposed in this paper. The proposed secret sharing scheme is based on the Chinese Remainder Theorem (CRT). Novelty of the proposed scheme is that the shares of the participants are reusable that means even for the every new secret the shares are same. Also only one share needs to be kept by each participant even for the multi-secret sharing scheme. Further, the scheme is verifiable means that verifying the honesty of the participants in the reconstruction phase. Correctness and complexity is discussed at the end.