视觉多媒体中隐写术的信息理论界限

IF 3.8 2区 计算机科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS
Hassan Y. El-Arsh , Amr Abdelaziz , Ahmed Elliethy , H.A. Aly , T. Aaron Gulliver
{"title":"视觉多媒体中隐写术的信息理论界限","authors":"Hassan Y. El-Arsh ,&nbsp;Amr Abdelaziz ,&nbsp;Ahmed Elliethy ,&nbsp;H.A. Aly ,&nbsp;T. Aaron Gulliver","doi":"10.1016/j.jisa.2025.103966","DOIUrl":null,"url":null,"abstract":"<div><div>Steganography in visual multimedia embeds data into an image or video cover object and produces a corresponding stego object with some distortion. Establishing an upper bound on the maximum embedding rate, subject to a target distortion threshold, is challenging due to the difficulties introduced by the Gibbs modeling of visual multimedia objects. This paper introduces an analytic optimization approach to establish a generalized upper bound on the maximum embedding rate in visual multimedia cover objects with a particular target probability of detection by any steganographic detector. To that end, we show that the parametric form of the correlated multivariate quantized Gaussian distribution supersedes the Gibbs family in the achievable embedding rate with a bounded relative entropy between the cover and stego objects’ distributions. Our solution provides an analytical form of the upper bound in terms of the WrightOmega function and agrees with the well-known Square Root Law (SRL) for steganography.</div></div>","PeriodicalId":48638,"journal":{"name":"Journal of Information Security and Applications","volume":"89 ","pages":"Article 103966"},"PeriodicalIF":3.8000,"publicationDate":"2025-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Information-theoretic bounds for steganography in visual multimedia\",\"authors\":\"Hassan Y. El-Arsh ,&nbsp;Amr Abdelaziz ,&nbsp;Ahmed Elliethy ,&nbsp;H.A. Aly ,&nbsp;T. Aaron Gulliver\",\"doi\":\"10.1016/j.jisa.2025.103966\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Steganography in visual multimedia embeds data into an image or video cover object and produces a corresponding stego object with some distortion. Establishing an upper bound on the maximum embedding rate, subject to a target distortion threshold, is challenging due to the difficulties introduced by the Gibbs modeling of visual multimedia objects. This paper introduces an analytic optimization approach to establish a generalized upper bound on the maximum embedding rate in visual multimedia cover objects with a particular target probability of detection by any steganographic detector. To that end, we show that the parametric form of the correlated multivariate quantized Gaussian distribution supersedes the Gibbs family in the achievable embedding rate with a bounded relative entropy between the cover and stego objects’ distributions. Our solution provides an analytical form of the upper bound in terms of the WrightOmega function and agrees with the well-known Square Root Law (SRL) for steganography.</div></div>\",\"PeriodicalId\":48638,\"journal\":{\"name\":\"Journal of Information Security and Applications\",\"volume\":\"89 \",\"pages\":\"Article 103966\"},\"PeriodicalIF\":3.8000,\"publicationDate\":\"2025-01-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Information Security and Applications\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S2214212625000043\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Information Security and Applications","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2214212625000043","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

视觉多媒体中的隐写术是将数据嵌入到图像或视频覆盖对象中,并产生相应的隐写对象。由于视觉多媒体对象的Gibbs建模所带来的困难,建立受目标失真阈值约束的最大嵌入率的上界是具有挑战性的。本文介绍了一种解析优化方法,用于建立具有特定目标被任何隐写检测器检测概率的视觉多媒体覆盖对象的最大嵌入率的广义上界。为此,我们证明了相关多元量化高斯分布的参数形式在可实现的嵌入率上取代了Gibbs族,并且覆盖对象和隐藏对象分布之间的相对熵有界。我们的解决方案提供了赖特加函数的上界的解析形式,并符合著名的根号定律(SRL)用于隐写。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Information-theoretic bounds for steganography in visual multimedia
Steganography in visual multimedia embeds data into an image or video cover object and produces a corresponding stego object with some distortion. Establishing an upper bound on the maximum embedding rate, subject to a target distortion threshold, is challenging due to the difficulties introduced by the Gibbs modeling of visual multimedia objects. This paper introduces an analytic optimization approach to establish a generalized upper bound on the maximum embedding rate in visual multimedia cover objects with a particular target probability of detection by any steganographic detector. To that end, we show that the parametric form of the correlated multivariate quantized Gaussian distribution supersedes the Gibbs family in the achievable embedding rate with a bounded relative entropy between the cover and stego objects’ distributions. Our solution provides an analytical form of the upper bound in terms of the WrightOmega function and agrees with the well-known Square Root Law (SRL) for steganography.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Journal of Information Security and Applications
Journal of Information Security and Applications Computer Science-Computer Networks and Communications
CiteScore
10.90
自引率
5.40%
发文量
206
审稿时长
56 days
期刊介绍: Journal of Information Security and Applications (JISA) focuses on the original research and practice-driven applications with relevance to information security and applications. JISA provides a common linkage between a vibrant scientific and research community and industry professionals by offering a clear view on modern problems and challenges in information security, as well as identifying promising scientific and "best-practice" solutions. JISA issues offer a balance between original research work and innovative industrial approaches by internationally renowned information security experts and researchers.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信