A Robust Coverless Image Steganography Algorithm Based on Image Retrieval with SURF Features

4区 计算机科学 Q3 Computer Science Security and Communication Networks Pub Date : 2024-05-18 DOI:10.1155/2024/5034640
Fan Li, Chenyang Liu, Zhenbo Dong, Zhibo Sun, Weipeng Qian
{"title":"A Robust Coverless Image Steganography Algorithm Based on Image Retrieval with SURF Features","authors":"Fan Li, Chenyang Liu, Zhenbo Dong, Zhibo Sun, Weipeng Qian","doi":"10.1155/2024/5034640","DOIUrl":null,"url":null,"abstract":"With the advancement of image steganography, coverless image steganography has gained widespread attention due to its ability to hide information without modifying the carrier of images. However, existing coverless image steganography methods often require both communicating parties to transmit an amount of additional information including image blocks’ locations or a large number of parameters, which will raise a serious suspicion. In light of this issue, we propose a robust coverless image steganography algorithm based on Speeded-Up Robust Features (SURF). Firstly, the proposed method allows both communicating parties to independently create multiple coverless image datasets (CIDs) using random seeds. Then, a mapping rule is designed for creating one-to-one correspondence between hash sequences and images in CIDs. Finally, the secret information will be carried by the images whose hash sequences are equal to the secret segments. At the receiver side, the robust SURF of images is utilized to retrieve the secret information. Experimental results demonstrate that the proposed algorithm outperforms other methods in terms of capacity, robustness, and security. Furthermore, it is worth noting that the proposed method eliminates the need to transmit a large amount of additional information, which is a significant security issue in existing coverless image steganography algorithms.","PeriodicalId":49554,"journal":{"name":"Security and Communication Networks","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2024-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Security and Communication Networks","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1155/2024/5034640","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Computer Science","Score":null,"Total":0}
引用次数: 0

Abstract

With the advancement of image steganography, coverless image steganography has gained widespread attention due to its ability to hide information without modifying the carrier of images. However, existing coverless image steganography methods often require both communicating parties to transmit an amount of additional information including image blocks’ locations or a large number of parameters, which will raise a serious suspicion. In light of this issue, we propose a robust coverless image steganography algorithm based on Speeded-Up Robust Features (SURF). Firstly, the proposed method allows both communicating parties to independently create multiple coverless image datasets (CIDs) using random seeds. Then, a mapping rule is designed for creating one-to-one correspondence between hash sequences and images in CIDs. Finally, the secret information will be carried by the images whose hash sequences are equal to the secret segments. At the receiver side, the robust SURF of images is utilized to retrieve the secret information. Experimental results demonstrate that the proposed algorithm outperforms other methods in terms of capacity, robustness, and security. Furthermore, it is worth noting that the proposed method eliminates the need to transmit a large amount of additional information, which is a significant security issue in existing coverless image steganography algorithms.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于 SURF 特征图像检索的鲁棒无掩码图像隐写术算法
随着图像隐写术的发展,无掩盖图像隐写术因其能够在不改变图像载体的情况下隐藏信息而受到广泛关注。然而,现有的无掩码图像隐写方法往往需要通信双方传输大量的附加信息,包括图像块的位置或大量参数,这将引起严重的怀疑。有鉴于此,我们提出了一种基于加速鲁棒特征(SURF)的鲁棒性无掩码图像隐写算法。首先,该方法允许通信双方使用随机种子独立创建多个无掩码图像数据集(CID)。然后,设计一个映射规则,在哈希序列和 CID 中的图像之间建立一一对应关系。最后,哈希序列与秘密片段相等的图像将携带秘密信息。在接收端,利用图像的鲁棒 SURF 来检索秘密信息。实验结果表明,所提出的算法在容量、鲁棒性和安全性方面都优于其他方法。此外,值得注意的是,所提出的方法无需传输大量额外信息,而这正是现有无掩码图像隐写术算法中的一个重要安全问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Security and Communication Networks
Security and Communication Networks COMPUTER SCIENCE, INFORMATION SYSTEMS-TELECOMMUNICATIONS
自引率
0.00%
发文量
1274
审稿时长
11.3 months
期刊介绍: Security and Communication Networks is an international journal publishing original research and review papers on all security areas including network security, cryptography, cyber security, etc. The emphasis is on security protocols, approaches and techniques applied to all types of information and communication networks, including wired, wireless and optical transmission platforms. The journal provides a prestigious forum for the R&D community in academia and industry working at the inter-disciplinary nexus of next generation communications technologies for security implementations in all network layers. Answering the highly practical and commercial importance of network security R&D, submissions of applications-oriented papers describing case studies and simulations are encouraged as well as research analysis-type papers.
期刊最新文献
HMMED: A Multimodal Model with Separate Head and Payload Processing for Malicious Encrypted Traffic Detection A Robust Coverless Image Steganography Algorithm Based on Image Retrieval with SURF Features Effective and Efficient Android Malware Detection and Category Classification Using the Enhanced KronoDroid Dataset Securing the Transmission While Enhancing the Reliability of Communication Using Network Coding in Block-Wise Transfer of CoAP Exploring the Security Vulnerability in Frequency-Hiding Order-Preserving Encryption
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1