Secret sharing schemes, especially those based on Shamir’s algorithm, are widely recognized for their security. However, these schemes often demand high computational resources due to their polynomial-based nature. Recent works have explored XOR-based methods as a more computationally efficient alternative. For instance, the method proposed in “A Verifiable Secret Image Sharing Scheme (n, n) Through the Use of XOR Operation” demonstrates reduced computational requirements compared to threshold-based methods. However, this approach necessitates an additional secret key to be shared with the combiner and lacks clarity on image resizing techniques. To address these limitations, we propose a XOR-based secret sharing method specifically for grayscale images that eliminates the need for an extra key to be shared with the combiner. Our method ensures secure, lossless, and efficient image sharing without compromising on computational efficiency. This paper details the implementation of our approach and demonstrates its effectiveness through rigorous experimentation and analysis.