Integer wavelet transform‐based secret image sharing using rook polynomial and hamming code with authentication
Abstract As an effective way to securely transfer secret images, secret image sharing (SIS) has been a noteworthy area of research. Basically in a SIS scheme, a secret image is shared via shadows and could be reconstructed by having the required number of them. A major downside of this method is its...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2024-12-01
|
| Series: | CAAI Transactions on Intelligence Technology |
| Subjects: | |
| Online Access: | https://doi.org/10.1049/cit2.12357 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1841543303474970624 |
|---|---|
| author | Sara Charoghchi Zahra Saeidi Samaneh Mashhadi |
| author_facet | Sara Charoghchi Zahra Saeidi Samaneh Mashhadi |
| author_sort | Sara Charoghchi |
| collection | DOAJ |
| description | Abstract As an effective way to securely transfer secret images, secret image sharing (SIS) has been a noteworthy area of research. Basically in a SIS scheme, a secret image is shared via shadows and could be reconstructed by having the required number of them. A major downside of this method is its noise‐like shadows, which draw the malicious users' attention. In order to overcome this problem, SIS schemes with meaningful shadows are introduced in which the shadows are first hidden in innocent‐looking cover images and then shared. In most of these schemes, the cover image cannot be recovered without distortion, which makes them useless in case of utilising critical cover images such as military or medical images. Also, embedding the secret data in Least significant bits of the cover image, in many of these schemes, makes them very fragile to steganlysis. A reversible IWT‐based SIS scheme using Rook polynomial and Hamming code with authentication is proposed. In order to make the scheme robust to steganalysis, the shadow image is embedded in coefficients of Integer wavelet transform of the cover image. Using Rook polynomial makes the scheme more secure and moreover makes authentication very easy and with no need to share private key to participants. Also, utilising Hamming code lets us embed data with much less required modifications on the cover image which results in high‐quality stego images. |
| format | Article |
| id | doaj-art-4b0c1c71f94547498c3af49fa83fc8d9 |
| institution | Kabale University |
| issn | 2468-2322 |
| language | English |
| publishDate | 2024-12-01 |
| publisher | Wiley |
| record_format | Article |
| series | CAAI Transactions on Intelligence Technology |
| spelling | doaj-art-4b0c1c71f94547498c3af49fa83fc8d92025-01-13T14:05:51ZengWileyCAAI Transactions on Intelligence Technology2468-23222024-12-01961435145010.1049/cit2.12357Integer wavelet transform‐based secret image sharing using rook polynomial and hamming code with authenticationSara Charoghchi0Zahra Saeidi1Samaneh Mashhadi2Cryptography and Data Security Laboratory School of Mathematics and Computer Science Iran University of Science & Technology Tehran IranCryptography and Data Security Laboratory School of Mathematics and Computer Science Iran University of Science & Technology Tehran IranCryptography and Data Security Laboratory School of Mathematics and Computer Science Iran University of Science & Technology Tehran IranAbstract As an effective way to securely transfer secret images, secret image sharing (SIS) has been a noteworthy area of research. Basically in a SIS scheme, a secret image is shared via shadows and could be reconstructed by having the required number of them. A major downside of this method is its noise‐like shadows, which draw the malicious users' attention. In order to overcome this problem, SIS schemes with meaningful shadows are introduced in which the shadows are first hidden in innocent‐looking cover images and then shared. In most of these schemes, the cover image cannot be recovered without distortion, which makes them useless in case of utilising critical cover images such as military or medical images. Also, embedding the secret data in Least significant bits of the cover image, in many of these schemes, makes them very fragile to steganlysis. A reversible IWT‐based SIS scheme using Rook polynomial and Hamming code with authentication is proposed. In order to make the scheme robust to steganalysis, the shadow image is embedded in coefficients of Integer wavelet transform of the cover image. Using Rook polynomial makes the scheme more secure and moreover makes authentication very easy and with no need to share private key to participants. Also, utilising Hamming code lets us embed data with much less required modifications on the cover image which results in high‐quality stego images.https://doi.org/10.1049/cit2.12357hamming codehomogeneous linear recursionIWTrook polynomial(t, n)‐secret image sharing |
| spellingShingle | Sara Charoghchi Zahra Saeidi Samaneh Mashhadi Integer wavelet transform‐based secret image sharing using rook polynomial and hamming code with authentication CAAI Transactions on Intelligence Technology hamming code homogeneous linear recursion IWT rook polynomial (t, n)‐secret image sharing |
| title | Integer wavelet transform‐based secret image sharing using rook polynomial and hamming code with authentication |
| title_full | Integer wavelet transform‐based secret image sharing using rook polynomial and hamming code with authentication |
| title_fullStr | Integer wavelet transform‐based secret image sharing using rook polynomial and hamming code with authentication |
| title_full_unstemmed | Integer wavelet transform‐based secret image sharing using rook polynomial and hamming code with authentication |
| title_short | Integer wavelet transform‐based secret image sharing using rook polynomial and hamming code with authentication |
| title_sort | integer wavelet transform based secret image sharing using rook polynomial and hamming code with authentication |
| topic | hamming code homogeneous linear recursion IWT rook polynomial (t, n)‐secret image sharing |
| url | https://doi.org/10.1049/cit2.12357 |
| work_keys_str_mv | AT saracharoghchi integerwavelettransformbasedsecretimagesharingusingrookpolynomialandhammingcodewithauthentication AT zahrasaeidi integerwavelettransformbasedsecretimagesharingusingrookpolynomialandhammingcodewithauthentication AT samanehmashhadi integerwavelettransformbasedsecretimagesharingusingrookpolynomialandhammingcodewithauthentication |