Steganography and authentication in image sharing without parity bits |
| |
| Authors: | Ching-Nung Yang Jin-Fwu Ouyang Lein Harn |
| |
| Institution: | 1. CSIE Dept., National Dong Hwa University, Taiwan;2. CSEE Dept., University of Missouri, Kansas City, USA;1. School of Information Science and Technology, Sun Yat-sen University, Guangzhou 510006, China;2. School of Software, Sun Yat-sen University, Guangzhou 510006, China;1. School of Information Science and Technology, Sun Yat-sen University, Guangzhou 510006, China;2. School of Software, Sun Yat-sen University, Guangzhou 510006, China;1. Department of Information Management, Tamkang University, Taiwan, ROC;2. Department of Information Management, National Central University, Taiwan, ROC;3. Computer Center, National Open University, Taiwan, ROC;1. Department of computer science and engineering, XI’AN university of technology, 710048, China;2. Department of CSIE, National Dong Hwa University, Hualien Country, Taiwan |
| |
| Abstract: | 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. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
