Abstract
Secret sharing is a cryptographic tool to ensure reliable and secure access to information. Counting-based secret sharing is a new secret sharing technique that generate the preprocessing shares using simple replacements operations of specific bits. This work considers addressing the challenges within the shares generation process of original multimedia counting based secret sharing scheme by studying the limitations in the number of shares, according to the range, trying to avoid the number of zero-bits boundaries within the original secret target key hindering the system performance. We also overcome the weakness of bits similarities between shares and the secret target key to enhance security. The research proposes a verification tool to test the shares proper validity in relation to the secret target key providing interesting features. The enhanced shares generation methods is found obtaining attractive results showing that our proposed scheme achieve high level of security, reliability and efficiency, compared to the original secret sharing work.