Data Hiding in Encrypted Image Based Using Cryptographic Algorithm

Abstract

Reversible information covering up in scrambled pictures (RDHEI) has been presented for protecting picture security and information inserting. RDHEI typically includes three gatherings; to be specific, the picture supplier, information hider, and recipient. On the security with key setting, there are three classes: share autonomous mystery keys (SIK), shared one key (SOK) and offer no mysterious keys (SNK). In SIK, the picture supplier and information hider should separately what's more, freely share secret keys with the collector, though in SNK, no mysterious key is shared. Notwithstanding, the writing works proposed SNK-type plans by utilizing homomorphic encryption (with excessive calculation cost). In this paper, we address shared one key (SOK) setting, where just the picture supplier shares a mysterious key with the recipient, and the information hider can insert a mysterious message with no information on this key. To understand our SOK conspire in a straightforward way, we propose another method by utilizing multi-secret sharing as the hidden encryption, which surely initiates an explode issue of the key size. For safeguarding the proficiency of the key size, we apply a pressure by utilizing lightweight cryptographic calculations. At that point, we show our SOK plot dependent on the proposed methods, and show viability, productivity, and security by tests and investigation.