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 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.

Authors

Institutions

Publication Details

Journal
Algorithms
Published
2025-08-22
DOI
https://doi.org/10.3390/a18090535
Primary Topic
Advanced Steganography and Watermarking Techniques
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Strongly Robust Secret Image Sharing Algorithm Based on QR Codes

Canyu Chen, Xianglong Wan, Pengcheng Huang
Algorithms
Advanced Steganography and Watermarking Techniques
article

A Strongly Robust Secret Image Sharing Algorithm Based on QR Codes

Canyu Chen, Xianglong Wan, Pengcheng Huang
article en

Abstract

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.

AlgorithmsVol. 18(9)
Xiamen University of Technology (CN)
Natural Science Foundation of Fujian Province
Openalex Percentile: Top 79%
Advanced Steganography and Watermarking Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.