A Strongly Robust Secret Image Sharing Algorithm Based on QR Codes
Secret image sharing (SIS) is an image protection technique based on cryptography. However, traditional SIS schemes have limited noise resistance, making it difficult to ensure reconstructed image quality. To address this issue, this paper proposes a robust SIS scheme based on QR codes, which enable...
Saved in:
Published in | Algorithms Vol. 18; no. 9; p. 535 |
---|---|
Main Authors | , , |
Format | Journal Article |
Language | English |
Published |
22.08.2025
|
Online Access | Get full text |
Cover
Loading…
Summary: | Secret image sharing (SIS) is an image protection technique based on cryptography. However, traditional SIS schemes have limited noise resistance, making it difficult to ensure reconstructed image quality. To address this issue, this paper proposes a robust SIS scheme based on QR codes, which enables the efficient and lossless reconstruction of the secret image without pixel expansion. Moreover, the proposed scheme maintains high reconstruction quality under noisy conditions. In the sharing phase, the scheme compresses the length of shares by optimizing polynomial computation and improving the pixel allocation strategy. Reed–Solomon coding is then incorporated to enhance the anti-noise capability during the sharing process, while achieving meaningful secret sharing using QR codes as carriers. In the reconstruction phase, the scheme further improves the quality of the reconstructed secret image by combining image inpainting algorithms with the error-correction capability of Reed–Solomon codes. The experimental results show that the scheme can achieve lossless reconstruction when the salt-and-pepper noise density is less than d≤0.02, and still maintains high-quality reconstruction when d≤0.13. Compared with the existing schemes, the proposed method significantly improves noise robustness without pixel expansion, while preserving the visual meaning of the QR code carrier, and achieves a secret sharing strategy that combines robustness and practicality. |
---|---|
ISSN: | 1999-4893 1999-4893 |
DOI: | 10.3390/a18090535 |