A Verifiable (n, n) Secret Image Sharing Scheme Using XOR Operations

An (n, n) secret sharing scheme can be superior than (k, n) threshold secret sharing scheme in a scenario where k or more (≤ n) participants can form a clique (a self-serving group) and deceive the rest by misusing the sensitive secret without others knowledge. However, an (n, n) secret sharing scheme guarantees to reveal the secret with presence of all the participants (as all n shares are needed to be submitted). Here, we propose an (n, n) secret image sharing scheme using bit wise XOR operations. The use of boolean based operations assures high performance in construction of shares and reconstruction of the secret. In the proposed scheme, the method of lossless reconstruction of the secret is having time complexity of O(n), where n is the number of shares. Further, the scheme generates scalable shares which are easy to store and transfer on network. In this scheme, we also propose verification of the shares by using simple boolean operations.