期刊
OPTICS COMMUNICATIONS
卷 285, 期 7, 页码 1725-1735出版社
ELSEVIER
DOI: 10.1016/j.optcom.2011.12.003
关键词
Secret image sharing steganography; Authentication; Stego-image; Parity bit; Symmetric bivariate polynomial
类别
资金
- National Science Council [NSC 99-2631-H-259-001-]
- Testbed@TWISC, National Science Council [NSC 100-2219-E-006-001]
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. (C) 2011 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据