Robust Secret Image Sharing Scheme Against Noise in Shadow Images
The (k, n)-threshold secret image sharing scheme is an image protection method, whose security comes partly from precise mathematical calculations, and even a little change in shadow images will lead to a false recovered image. Thus, it is crucial to recover the secret image information in the prese...
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2021-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/9345738/ |
| _version_ | 1818418332932505600 |
|---|---|
| author | Yuyuan Sun Yuliang Lu Xuehu Yan Lintao Liu Longlong Li |
| author_facet | Yuyuan Sun Yuliang Lu Xuehu Yan Lintao Liu Longlong Li |
| author_sort | Yuyuan Sun |
| collection | DOAJ |
| description | The (k, n)-threshold secret image sharing scheme is an image protection method, whose security comes partly from precise mathematical calculations, and even a little change in shadow images will lead to a false recovered image. Thus, it is crucial to recover the secret image information in the presence of possible noise on shadow images, which has rarely been considered in previous work. In this paper, a robust (k, n)-threshold polynomial-based secret image sharing scheme(RPSIS) against noise on shadow images is proposed, which depends on the randomness of the sharing phase without any other techniques, such as steganography. Additionally, pixel expansion caused by the direct application of error correction codes is avoided. Experimental results and theoretical proof confirm the effectiveness of our scheme. The shadow images of the scheme are of the same size as secret image and the security of the scheme is also maintained with no information leakage. Even though the shadow images are modified by noise, the original secret image can be reconstructed without loss under the error correction capability, which provides more possibilities for the practical application of secret image sharing. |
| first_indexed | 2024-12-14T12:21:00Z |
| format | Article |
| id | doaj.art-b92d7b20857846f797f66bd8da14fb7e |
| institution | Directory Open Access Journal |
| issn | 2169-3536 |
| language | English |
| last_indexed | 2024-12-14T12:21:00Z |
| publishDate | 2021-01-01 |
| publisher | IEEE |
| record_format | Article |
| series | IEEE Access |
| spelling | doaj.art-b92d7b20857846f797f66bd8da14fb7e2022-12-21T23:01:28ZengIEEEIEEE Access2169-35362021-01-019232842330010.1109/ACCESS.2021.30568939345738Robust Secret Image Sharing Scheme Against Noise in Shadow ImagesYuyuan Sun0https://orcid.org/0000-0002-7492-0315Yuliang Lu1https://orcid.org/0000-0002-8502-9907Xuehu Yan2https://orcid.org/0000-0001-6388-1720Lintao Liu3https://orcid.org/0000-0002-0071-6741Longlong Li4National University of Defense Technology, Hefei, ChinaNational University of Defense Technology, Hefei, ChinaNational University of Defense Technology, Hefei, ChinaNational University of Defense Technology, Hefei, ChinaNational University of Defense Technology, Hefei, ChinaThe (k, n)-threshold secret image sharing scheme is an image protection method, whose security comes partly from precise mathematical calculations, and even a little change in shadow images will lead to a false recovered image. Thus, it is crucial to recover the secret image information in the presence of possible noise on shadow images, which has rarely been considered in previous work. In this paper, a robust (k, n)-threshold polynomial-based secret image sharing scheme(RPSIS) against noise on shadow images is proposed, which depends on the randomness of the sharing phase without any other techniques, such as steganography. Additionally, pixel expansion caused by the direct application of error correction codes is avoided. Experimental results and theoretical proof confirm the effectiveness of our scheme. The shadow images of the scheme are of the same size as secret image and the security of the scheme is also maintained with no information leakage. Even though the shadow images are modified by noise, the original secret image can be reconstructed without loss under the error correction capability, which provides more possibilities for the practical application of secret image sharing.https://ieeexplore.ieee.org/document/9345738/Polynomialsecret image sharingrandom elementserror-correction codesrobustness |
| spellingShingle | Yuyuan Sun Yuliang Lu Xuehu Yan Lintao Liu Longlong Li Robust Secret Image Sharing Scheme Against Noise in Shadow Images IEEE Access Polynomial secret image sharing random elements error-correction codes robustness |
| title | Robust Secret Image Sharing Scheme Against Noise in Shadow Images |
| title_full | Robust Secret Image Sharing Scheme Against Noise in Shadow Images |
| title_fullStr | Robust Secret Image Sharing Scheme Against Noise in Shadow Images |
| title_full_unstemmed | Robust Secret Image Sharing Scheme Against Noise in Shadow Images |
| title_short | Robust Secret Image Sharing Scheme Against Noise in Shadow Images |
| title_sort | robust secret image sharing scheme against noise in shadow images |
| topic | Polynomial secret image sharing random elements error-correction codes robustness |
| url | https://ieeexplore.ieee.org/document/9345738/ |
| work_keys_str_mv | AT yuyuansun robustsecretimagesharingschemeagainstnoiseinshadowimages AT yulianglu robustsecretimagesharingschemeagainstnoiseinshadowimages AT xuehuyan robustsecretimagesharingschemeagainstnoiseinshadowimages AT lintaoliu robustsecretimagesharingschemeagainstnoiseinshadowimages AT longlongli robustsecretimagesharingschemeagainstnoiseinshadowimages |