Chaos based efficient selective image encryption

Due to social networks, demand for sharing multimedia data is significantly increased in last decade. However, lower complexity and frequent security breaches on public network such as Internet make it easy for eavesdroppers to approach the actual contents without any hurdle. Many encryption algorithms has been developed by researchers to increase the security of such traffic and make it difficult for eavesdroppers to access actual data. However, these traditional algorithms increase the communication overhead, computational cost and also do not provide security against new attacks. These issues in recent algorithms motivate the researchers to further explore this area and proposed such algorithms which have lower overhead, more efficiency than the existing techniques and equip with requirements of next generations multimedia networks. To address all these issues and keeping in mind the future of next generation multimedia networks, we proposed a secure and light-weight encryption scheme for digital images. The proposed technique initially divide plaintext image in a number of blocks and correlation coefficients of each block are then calculated. The block with the maximum correlation coefficient values are pixel-wise XORed with the random numbers generated from a skew tent map based on a pre-defined threshold value. At last, the whole image is permuted via two random sequences generated from TD-ERCS chaotic map. Experimental results shows higher security via checking correlation, entropy, histogram, diffusion characteristic and key sensitivity of the proposed scheme.