A Reversible Data Hiding Scheme in Encrypted Domain for Secret Image Sharing Based on Chinese Remainder Theorem

Schemes of reversible data hiding in encrypted domain (RDH-ED) based on symmetric or public key encryption are mainly applied the scenarios end-to-end communication. To provide security guarantees for multi-party scenarios, a RDH-ED scheme secret image sharing Chinese remainder theorem (CRT) is presented. In application ( $t$ , notation="LaTeX">$n$ ) sharing, an first shared into different shares ciphertext. Only when not less than obtained, can be reconstructed. our scheme, additional could embedded shares. realize extraction from and reconstructed separably, two methods proposed: one homomorphic difference expansion (HDE-ED) that supports by utilizing addition homomorphism CRT sharing; other (DE-IS) marked before reconstruction. Experimental results demonstrate proposed only maintain threshold function system, but also obtain better reversibility efficiency compared with most existing algorithms. The maximum embedding rate HDE-ED reach 0.500 bits per pixel average DE-IS 0.4652 pixel.