Improved resilience of secret sharing scheme with augmented multifarious features

The requirement of greater flexibility and additional functionality in conventional secret sharing schemes is posed in many practical applications. To meet the flexibility requirements of applications, an extension of a secret sharing scheme with multiple features is proposed. The matrix projection property assorted with Lagrange’s interpolation, matrix subtraction, asymmetric key exchange algorithm, Pythagorean triples, AND-OR circuit structure design, and Least Significant Bit technique to implement the proposed scheme. The scheme is multifarious in a way that it supports different features such as verifiability of reconstructed secret, cheater/s identification, periodical renewal of shares, the flexibility of deciding access structure, and embedding of shares for enhanced security. Further flexibility is provided to the user in the selection of one, all, or any number of required features to support the applications. The scheme is applicable for sharing secret data of various forms like text, number, monochrome and multi-chrome images. The implementation of the proposed scheme is critically analysed with the help of experimentation. It is further compared with existing techniques and the results show that the proposed scheme satisfies relatively better accuracy, improved security, lesser time complexity, and lesser storage requirements while providing multiple features for secret sharing.