This paper introduces an innovative approach to securely and efficiently share a single secret image in a system with limited resources. Although traditional secret sharing techniques are efficient, they often require significant processing and storage resources, making them impractical in environments with limitations. While there are existing counting based secret sharing techniques applicable to systems with limited resources, that handle numerical data, text, watermarking, and steganography, schemes designed specifically for multimedia images exhibit some noticeable gaps. By employing bit-flip and parallel bit-counting techniques, our proposed model offers a counting-based single-image sharing solution to bridge this gap. The core components of our scheme encompass share generation of share and recovering of the secret. In share generation, we utilize a bit-flip operation to create the shares, and for enhanced confidentiality, a reverse bit operation is applied before distribution on a cloud network. In the case of secret reconstruction which follows the perfect secret sharing scheme, parallel bit operations are employed. By integrating all the shares and using parallel bit-counting techniques at the bit level, the secret image is successfully recovered. The experimental results showcase the average level of randomness in the shares generated by our method. Metrics like PSNR, RMSE, and correlation are used to assess the effectiveness of the suggested scheme, yielding compelling results. This approach has a significant drawback in that if the quantity of shares drops below the required threshold ‘n’, reconstruction of the secret image becomes impossible.