Efficient and secure multi secret sharing schemes based on boolean XOR and arithmetic modulo

Multi Secret Sharing (MSS) scheme is an efficient method of transmitting more than one secret securely. In ( n , n )-MSS scheme n secrets are used to create n shares and for reconstruction, all n shares are required. In state of the art schemes n secrets are used to construct n or n + 1 shares, but one can recover partial secret information from less than n shares. There is a need to develop an efficient and secure ( n , n )-MSS scheme so that the threshold property can be satisfied. In this paper, we propose three different ( n , n )-MSS schemes. In the first and second schemes, Boolean XOR is used and in the third scheme, we used Modular Arithmetic. For quantitative analysis, Similarity metrics, Structural, and Differential measures are considered. A proposed scheme using Modular Arithmetic performs better compared to Boolean XOR. The proposed ( n , n )-MSS schemes outperform the existing techniques in terms of security, time complexity, and randomness of shares.