Invertible Secret Image Sharing With Authentication for Embedding Color Palette Image Into True Color Image

被引:0
作者
Xiong, Lizhi [1 ]
Ding, Rui [1 ]
Yang, Ching-Nung [2 ]
Fu, Zhangjie [1 ]
机构
[1] Nanjing Univ Informat Sci & Technol, Sch Comp Sci, Nanjing 210044, Peoples R China
[2] Natl Dong Hwa Univ, Dept Comp Sci & Informat Engn, Hualien 974301, Taiwan
基金
中国国家自然科学基金;
关键词
Invertible secret image sharing; steganography; authentication; color palette image; STEGANOGRAPHY; QUALITY;
D O I
10.1109/TCSVT.2024.3413024
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Invertible secret image sharing with authentication (ISISA) distributes comprehensible stego images generated from secret images and cover images to involved participants. The secret image and cover image can be correctly recovered after authentication. However, existing ISISA schemes suffer from issues such as a single kind of image, limited embedding capacity, poor visual quality and a lack of authentication capability. To address these issues, this paper provides a novel invertible secret image sharing scheme with authentication for embedding color palette images into true color images. In this scheme, the pixels of the palette secret image and the bits of the cover pixel are used as coefficients of the polynomial. Share is embedded into a true color cover image to generate an intermediate stego image. Authentication information is then derived from the intermediate stego image and hidden in the cover image. The final stego images that resemble the cover image are obtained and sent to authorized participants. At the receiver end, once k stego images are verified, the secret image and cover image can be losslessly recovered for a (k, n)-threshold scheme. The experimental results and theoretical analysis demonstrated the superiority and practicality of the scheme.
引用
收藏
页码:10987 / 10999
页数:13
相关论文
共 37 条
[1]  
Shamir A., How to share a secret, Commun. ACM, 22, 11, pp. 612-613, (1979)
[2]  
Naor M., Shamir A., Visual cryptography, Proc. Workshop Theory Appl. Cryptograph, pp. 1-12, (1994)
[3]  
Yang C.-N., Wu C.-C., Lin Y.-C., k out of n region-based progressive visual cryptography, IEEE Trans. Circuits Syst. Video Technol, 29, 1, pp. 252-262, (2019)
[4]  
Yang C.-N., Yang Y.-Y., On the analysis and design of visual cryptography with error correcting capability, IEEE Trans. Circuits Syst. Video Technol, 31, 6, pp. 2465-2479, (2021)
[5]  
Wu X., An N., Xu Z., Sharing multiple secrets in XOR-based visual cryptography by non-monotonic threshold property, IEEE Trans. Circuits Syst. Video Technol, 33, 1, pp. 88-103, (2023)
[6]  
Wu X., Xu Z., Yan W., Sharing visual secrets among multiple groups with enhanced performance, IEEE Trans. Circuits Syst. Video Technol, 33, 11, pp. 6503-6518, (2023)
[7]  
Thien C.-C., Lin J.-C., Secret image sharing, Comput. Graph, 26, 5, pp. 765-770, (2002)
[8]  
Kanso A., Ghebleh M., An efficient (t, n)-threshold secret image sharing scheme, Multimedia Tools Appl, 76, 15, pp. 16369-16388, (2017)
[9]  
Luo S., Liu Y., Yan X., Yu Y., Secret image sharing scheme with lossless recovery and high efficiency, Signal Process, 206, (2023)
[10]  
Sardar M.K., Adhikari A., A new lossless secret color image sharing scheme with small shadow size, J. Vis. Commun. Image Represent, 68, (2020)