Steganography and authentication in image sharing without parity bits

作者：Yang Ching Nung^*; Ouyang Jin Fwu; Harn Lein

来源：Optics Communications, 2012, 285(7): 1725-1735.

DOI：10.1016/j.optcom.2011.12.003

• Secret image sharing steganography
• Authentication
• Stego-image
• Parity bit
• Symmetric bivariate polynomial

Recently, a polynomial-based (k, n) steganography and authenticated image sharing (SAIS) scheme was proposed to share a secret image into n stego-images. At the same time, one can reconstruct a secret image with any k or more than k stego-images, but one cannot obtain any information about the secret from fewer than k stego-images. The beauty of a (k, n)-SAIS scheme is that it provides the threshold property (i.e., k is the threshold value), the steganography (i.e., stego-images look like cover images), and authentication (i.e., detection of manipulated stego-images). All existing SAIS schemes require parity bits for authentication. In this paper, we present a novel approach without needing parity bits. In addition, our (k, n)-SAIS scheme provides better visual quality and has higher detection ratio with respect to all previous (k, n)-SAIS schemes.

• 出版日期2012-4-1
• 单位东华大学