期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
Integer wavelet transform-based secret image sharing using rook polynomial and hamming code with authentication
1
作者 Sara Charoghchi Zahra Saeidi Samaneh Mashhadi 《CAAI Transactions on Intelligence Technology》 2024年第6期1435-1450,共16页
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 havin... 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. 展开更多
关键词 hamming code homogeneous linear recursion IWT rook polynomial (t n)-secret image sharing
在线阅读 下载PDF
A verifiable essential secret image sharing scheme based on HLRs(VESIS-(t,s,k,n))
2
作者 Massoud Hadian Dehkordi Seyed Taghi Farahi Samaneh Mashhadi 《CAAI Transactions on Intelligence Technology》 SCIE EI 2024年第2期388-410,共23页
In traditional secret image sharing schemes,a secret image is shared among shareholders who have the same position.But if the shareholders have two different positions,essential and non‐essential,it is necessary to u... In traditional secret image sharing schemes,a secret image is shared among shareholders who have the same position.But if the shareholders have two different positions,essential and non‐essential,it is necessary to use essential secret image sharing schemes.In this article,a verifiable essential secret image sharing scheme based on HLRs is proposed.Shareholder's share consists of two parts.The first part is produced by the shareholders,which prevents the fraud of dealers.The second part is a shadow image that is produced by using HLRs and the first part of share.The verification of the first part of the shares is done for the first time by using multilinear and bilinear maps.Also,for verifying shadow images,Bloom Filters are used for the first time.The proposed scheme is more efficient than similar schemes,and for the first part of the shares,has formal security. 展开更多
关键词 Bloom Filter CRYPTOGRAPHY Essential Secret Image Sharing Verifiability
在线阅读 下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部