Reversible Data Hiding Over Encrypted Images via Preprocessing-Free Matrix Secret Sharing
Zhongyun Hua, Xingyu Liu, Yifeng Zheng, Shuang Yi, Yushu Zhang
Abstract
Cloud service is a natural choice to store and manage the exponentially produced images. Data privacy is one of the most concerned points in cloud-based image services. Reversible data hiding over encrypted images (RDH-EI) is an effective technique to securely store and manage confidential images in the cloud. However, existing RDH-EI schemes have obvious weaknesses such as reliable key management system dependence and single point of failure. To securely store and manage confidential images in the cloud, in this study, we propose a new reversible data hiding strategy via image secret sharing. We first design a secure ( <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">r,n</i> )-threshold preprocessing-free matrix secret sharing (PFMSS) technique. It can directly share <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">m</i> -bit data by matrix multiplication without preprocessing. Using the PFMSS, we further design a secure ( <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">r,n</i> )-threshold reversible data hiding scheme over encrypted images. The content owner divides a confidential image into <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">n</i> shares without accessing to a secret encryption key, and then sends the <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">n</i> shares to <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">n</i> cloud-based image servers from competing providers. For each share, some additional data, e.g., integrity and identification of the image, can be embedded into it and these data can also be losslessly extracted. An authorized receiver can recover the confidential image from <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">r</i> shares. By designing, the content owner doesn’t need to access a secret key when encrypting the image and the scheme can withstand <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">n</i> - <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">r</i> points of failure. Simulation results show that our scheme can ensure image content confidentiality and has a much larger embedding capacity compared to state-of-the-art schemes.