Secret sharing is a technique for protecting sensitive data, such as cryptographic keys, precisely during transmission over internet. Well known secret sharing schemes in literature include Shamir, Blakley and Asmuth-Bloom leading to high computational complexity during both sharing and reconstructing phase and most of the popular secret sharing schemes are based on above schemes. Apart from those secret sharing technique, we are suggesting a scheme which deploys simple graphical masking, done by simple ANDing for share generation and reconstruction can be done by simple ORing the qualified set of shares. Not only that, it generates compressed shares that lead to strong protection of the secret image. Nevertheless it confirms confidentiality and integrity as well. This scheme is highly useful where low end processors are used but security is a major challenge.