Abstract

Image privacy protection and management face many challenges, such as privacy disclosure, copyright dispute, and traceability difficulties, with the development of big data. Reversible data hiding in encrypted images (RDHEI) has been widely considered as an effective means to tackle these challenges. In this paper, a RDHEI based on time-varying Huffman coding table (TV-HCT) method is proposed to improve the security, embedding rate (ER) and efficiency. First, the initial HCT is generated according to the prediction errors of an image, which can improve compression performance. And then, the TV-HCT is obtained by scrambling equal-length codewords in the initial HCT using timestamps. This realizes the time variability of compression coding stream (CCS) of an image in that the image TV-HCT has large change space. Analysis shows that the average change space of TV-HCT in UCID is 3.97×10 <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">327</sup> , and the average ER of three databases is more than 0.44 bpp higher than the existing algorithms. Finally, the CCS is encrypted using the designed index class scrambling method to balance complexity and security. The proposed method not only strengthens the security against brute force attack and differential attack, but also improves ER and efficiency of the RDHEI technique. Experimental results and performance analysis demonstrate that the proposed algorithm outperforms the state-of-the-art RDHEI algorithms in terms of the security, ER and complexity.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call