Open AccessReversible secret image sharing with steganography and dynamic embedding
Author(s) -
Hu WeiTong,
Li MingChu,
Guo Cheng,
Ren YiZhi
Publication year - 2012
Publication title -
security and communication networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.446
H-Index - 43
eISSN - 1939-0122
pISSN - 1939-0114
DOI - 10.1002/sec.567
Subject(s) - cover (algebra) , steganography , embedding , computer science , image sharing , secret sharing , image (mathematics) , distortion (music) , pixel , information hiding , scheme (mathematics) , theoretical computer science , artificial intelligence , computer vision , algorithm , cryptography , mathematics , telecommunications , mechanical engineering , amplifier , mathematical analysis , bandwidth (computing) , engineering
ABSTRACT Many traditional steganography methods do not disperse and hide secret data smoothly over all the capacity of cover images. Rather, they severely modify part of the cover image(s) to embed secret data, which results in stego images that have poor visual quality. In addition, there are still some secret image‐sharing approaches that cannot reveal the secret image losslessly without pixel expansion or extra storage or restore distortion‐free cover image(s) if they use steganography. In this paper, a novel scheme, which is based on Shamir's ( t , n )‐threshold scheme (1979) and Galois Field GF(2 8 ) and uses dynamic embedding and least significant bit construction, is proposed to solve the issues mentioned above. Our experimental results showed that the dynamic embedding performance in our scheme was satisfactory and that both the secret image and the cover image can be restored losslessly without pixel expansion or extra storage. Copyright © 2012 John Wiley & Sons, Ltd.