Reversible data hiding in encrypted images (RDHEI) has been introduced for preserving image privacy and data embedding. RDHEI usually involves three parties; namely, the image provider, data hider, and receiver. On the security with key setting, there are three categories: share independent secret keys (SIK), shared one key (SOK) and share no secret keys (SNK). In SIK, the image provider and data hider must respectively and independently share secret keys with the receiver, whereas in SNK, no secret key is shared. However, the literature works proposed SNK-type schemes by using homomorphic encryption (with exorbitant computation cost). In this paper, we address shared one key (SOK) setting, where only the image provider shares a secret key with the receiver, and the data hider can embed a secret message without any knowledge of this key. To realize our SOK scheme in a simple manner, we propose a new technique by using multi-secret sharing as the underlying encryption, which indeed induces a blow-up issue of the key size. For preserving the efficiency of the key size, we apply a compression by using lightweight cryptographic algorithms. Then, we demonstrate our SOK scheme based on the proposed techniques, and show effectiveness, efficiency, and security by experiments and analysis.
[[abstract]]In this paper, we proposed an improved data hiding scheme to embed secret data in the compressed bitstreams where the quality of the image is maintained even after embedment. The difference in the quantized values for each block is used to determine whether only 1 bit of secret is to be hidden for the block or to toggle bits in the bitmap to hide more bits. The scheme has a high payload and is a no distortion data hiding. Experimental tests with Lena showed that in the 2 × 2 block-sized BTC compressed bitstreams, an additional 10 488 bits were embedded and 416 bits for the 4 × 4 block-sized. The new improved scheme increases payload and is reversible