Separable High Capacity Reversible Data Hiding Algorithm for Encrypted Images

  • Ghadeer Written by
  • Update: 29/08/2022

Separable High Capacity Reversible Data Hiding Algorithm for Encrypted Images

Iyad Jafar

Computer Engineering Department, The University of Jordan,

Jordan

This email address is being protected from spambots. You need JavaScript enabled to view it.

Khalid Darabkh

Computer Engineering Department, The University of Jordan,

Jordan

This email address is being protected from spambots. You need JavaScript enabled to view it.

Fahed Jubair

Computer Engineering Department, The University of Jordan,

Jordan

This email address is being protected from spambots. You need JavaScript enabled to view it.

Abstract: This paper presents a separable Reversible Data Hiding Algorithm for Encrypted Images (RDHEI) that consists of three phases. The encryption phase in the algorithm circularly shifts the columns in the image by a random amount, blocks the image into equal and regular blocks and maps them to irregular blocks generated based on Hilbert filling curve, and finally complements a random subset of the blocks. The embedding phase is essentially an adapted version of the modification of the prediction errors algorithm that is applied to each block in the encrypted image independently. In the decryption phase, and since the algorithm is separable, the user can extract the data only, decrypt the image only, or can perform both actions depending on the type of keys he has. When compared to a very similar and recent algorithm, performance evaluation proved the ability of the proposed algorithm in increasing the embedding capacity with reasonable quality of the directly decrypted image. In terms of the security, the analytical and quantitative assessment showed the superiority of the proposed algorithm in protecting the encrypted image.

Keywords: Encryption, embedding capacity, privacy, reversible data hiding.

Received April 23, 2021, accepted December 2, 2021

https://doi.org/10.34028/iajit/19/5/13

Full text

Read 243 times Last modified on Wednesday, 31 August 2022 13:04
Top
We use cookies to improve our website. By continuing to use this website, you are giving consent to cookies being used. More details…