A New Scheme Based on (t,n)-Secret Image Sharing With Steganography Based on Joseph’s Problem and HLR
نویسندگان
1 Cryptography and Data Security Laboratory, School of Mathematics and Computer Science, Iran University of Science and Technology, Tehran, Iran
2 Cryptography and Data Security Laboratory, School of Mathematics and Computer Science, Iran University of Science and Technology, Tehran, Iran
doi
10.22042/isecure.2025.219355چکیده
The paper presents a novel approach to Secret Image Sharing (SIS) that combines (t, n)-threshold schemes with steganography, utilizing Joseph’s problem and Homogeneous Linear Recursion (HLR) to enhance security. The methodology involves dividing a secret image into shadow images, embedding these shadows into cover images using a Least Significant Bit (LSB) method guided by Joseph’s problem. The study aims to increase the security of SIS while maintaining high visual quality in the stego images. The authors validate their approach through various experiments, demonstrating that the proposed method improves Peak Signal-to-Noise Ratio (PSNR) and Structural Similarity Index (SSIM) compared to existing methods.
