基于稳定块条件的抗 JPEG 重压缩的稳健秘密图像共享

IF 8.4 1区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS IEEE Transactions on Multimedia Pub Date : 2024-03-30 DOI:10.1109/TMM.2024.3407694
Yue Jiang;Kejiang Chen;Wei Yan;Xuehu Yan;Guozheng Yang;Kai Zeng
{"title":"基于稳定块条件的抗 JPEG 重压缩的稳健秘密图像共享","authors":"Yue Jiang;Kejiang Chen;Wei Yan;Xuehu Yan;Guozheng Yang;Kai Zeng","doi":"10.1109/TMM.2024.3407694","DOIUrl":null,"url":null,"abstract":"<inline-formula><tex-math>$(k,n)$</tex-math></inline-formula>\n Threshold secret image sharing (SIS) hides a secret image within \n<inline-formula><tex-math>$n$</tex-math></inline-formula>\n shadows, and at least \n<inline-formula><tex-math>$k$</tex-math></inline-formula>\n shadows are needed for recovery. Due to the popularity and frequency of JPEG recompression, there is a need for robust secret image sharing (ROSIS) designed for JPEG images that is resilient to recompression for practical SIS applications. The current state-of-the-art ROSIS, which relies on error-correcting codes (ECC), is effective only for JPEG compression with quality factors (QFs) of 99 and 100. However, it generates noise-like shadow images that are confined to the spatial domain. In this paper, we present SBC-ROSIS (Robust Secret Image Sharing Scheme Resistant to JPEG Recompression Based on Stable Block Condition), a novel ROSIS scheme that utilizes a stable block condition to guarantee the invariance of discrete cosine transform (DCT) coefficients during JPEG recompression, significantly enhancing the robustness of the scheme. By employing a polynomial-based secret sharing (SS) algorithm, we construct DCT blocks that adhere to stable block condition either directly or through strategic global regulation. Additionally, we carefully consider the similarity between the generated DCT blocks and the original cover DCT blocks. Furthermore, we devised a tailored evaluation methodology specifically for ROSIS. Extensive experimental results indicate that SBC-ROSIS can effectively process JPEG images, achieving a balance among security, robustness, concealment, and adherence to the \n<inline-formula><tex-math>$(k, n)$</tex-math></inline-formula>\n threshold, without relying on steganography, ECC, or pixel expansion, and demonstrating robust performance in realistic recompression scenarios.","PeriodicalId":13273,"journal":{"name":"IEEE Transactions on Multimedia","volume":"26 ","pages":"10446-10461"},"PeriodicalIF":8.4000,"publicationDate":"2024-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Robust Secret Image Sharing Resistant to JPEG Recompression Based on Stable Block Condition\",\"authors\":\"Yue Jiang;Kejiang Chen;Wei Yan;Xuehu Yan;Guozheng Yang;Kai Zeng\",\"doi\":\"10.1109/TMM.2024.3407694\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<inline-formula><tex-math>$(k,n)$</tex-math></inline-formula>\\n Threshold secret image sharing (SIS) hides a secret image within \\n<inline-formula><tex-math>$n$</tex-math></inline-formula>\\n shadows, and at least \\n<inline-formula><tex-math>$k$</tex-math></inline-formula>\\n shadows are needed for recovery. Due to the popularity and frequency of JPEG recompression, there is a need for robust secret image sharing (ROSIS) designed for JPEG images that is resilient to recompression for practical SIS applications. The current state-of-the-art ROSIS, which relies on error-correcting codes (ECC), is effective only for JPEG compression with quality factors (QFs) of 99 and 100. However, it generates noise-like shadow images that are confined to the spatial domain. In this paper, we present SBC-ROSIS (Robust Secret Image Sharing Scheme Resistant to JPEG Recompression Based on Stable Block Condition), a novel ROSIS scheme that utilizes a stable block condition to guarantee the invariance of discrete cosine transform (DCT) coefficients during JPEG recompression, significantly enhancing the robustness of the scheme. By employing a polynomial-based secret sharing (SS) algorithm, we construct DCT blocks that adhere to stable block condition either directly or through strategic global regulation. Additionally, we carefully consider the similarity between the generated DCT blocks and the original cover DCT blocks. Furthermore, we devised a tailored evaluation methodology specifically for ROSIS. Extensive experimental results indicate that SBC-ROSIS can effectively process JPEG images, achieving a balance among security, robustness, concealment, and adherence to the \\n<inline-formula><tex-math>$(k, n)$</tex-math></inline-formula>\\n threshold, without relying on steganography, ECC, or pixel expansion, and demonstrating robust performance in realistic recompression scenarios.\",\"PeriodicalId\":13273,\"journal\":{\"name\":\"IEEE Transactions on Multimedia\",\"volume\":\"26 \",\"pages\":\"10446-10461\"},\"PeriodicalIF\":8.4000,\"publicationDate\":\"2024-03-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Transactions on Multimedia\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10542386/\",\"RegionNum\":1,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Multimedia","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10542386/","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

$(k,n)$阈值秘密图像共享(SIS)将秘密图像隐藏在$n$阴影中,恢复时至少需要$k$阴影。由于 JPEG 重压缩的流行和频繁,需要为 JPEG 图像设计一种鲁棒的秘密图像共享(ROSIS),它对实际 SIS 应用中的重压缩具有弹性。目前最先进的 ROSIS 依赖于纠错码(ECC),仅对质量系数(QF)为 99 和 100 的 JPEG 压缩有效。然而,它生成的阴影图像类似于噪声,仅限于空间域。在本文中,我们提出了 SBC-ROSIS(基于稳定块条件的抗 JPEG 压缩的稳健秘密图像共享方案),这是一种新型 ROSIS 方案,它利用稳定块条件来保证离散余弦变换(DCT)系数在 JPEG 重新压缩过程中的不变性,从而显著增强了该方案的稳健性。通过采用基于多项式的秘密共享(SS)算法,我们直接或通过战略性全局调节构建了符合稳定块条件的 DCT 块。此外,我们还仔细考虑了生成的 DCT 块与原始覆盖 DCT 块之间的相似性。此外,我们还专门为 ROSIS 设计了一套量身定制的评估方法。广泛的实验结果表明,SBC-ROSIS 可以有效地处理 JPEG 图像,在安全性、鲁棒性、隐蔽性和遵守 $(k, n)$ 门限之间实现了平衡,而不依赖于隐写术、ECC 或像素扩展,并在现实的重新压缩场景中表现出稳健的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Robust Secret Image Sharing Resistant to JPEG Recompression Based on Stable Block Condition
$(k,n)$ Threshold secret image sharing (SIS) hides a secret image within $n$ shadows, and at least $k$ shadows are needed for recovery. Due to the popularity and frequency of JPEG recompression, there is a need for robust secret image sharing (ROSIS) designed for JPEG images that is resilient to recompression for practical SIS applications. The current state-of-the-art ROSIS, which relies on error-correcting codes (ECC), is effective only for JPEG compression with quality factors (QFs) of 99 and 100. However, it generates noise-like shadow images that are confined to the spatial domain. In this paper, we present SBC-ROSIS (Robust Secret Image Sharing Scheme Resistant to JPEG Recompression Based on Stable Block Condition), a novel ROSIS scheme that utilizes a stable block condition to guarantee the invariance of discrete cosine transform (DCT) coefficients during JPEG recompression, significantly enhancing the robustness of the scheme. By employing a polynomial-based secret sharing (SS) algorithm, we construct DCT blocks that adhere to stable block condition either directly or through strategic global regulation. Additionally, we carefully consider the similarity between the generated DCT blocks and the original cover DCT blocks. Furthermore, we devised a tailored evaluation methodology specifically for ROSIS. Extensive experimental results indicate that SBC-ROSIS can effectively process JPEG images, achieving a balance among security, robustness, concealment, and adherence to the $(k, n)$ threshold, without relying on steganography, ECC, or pixel expansion, and demonstrating robust performance in realistic recompression scenarios.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
IEEE Transactions on Multimedia
IEEE Transactions on Multimedia 工程技术-电信学
CiteScore
11.70
自引率
11.00%
发文量
576
审稿时长
5.5 months
期刊介绍: The IEEE Transactions on Multimedia delves into diverse aspects of multimedia technology and applications, covering circuits, networking, signal processing, systems, software, and systems integration. The scope aligns with the Fields of Interest of the sponsors, ensuring a comprehensive exploration of research in multimedia.
期刊最新文献
Improving Network Interpretability via Explanation Consistency Evaluation Deep Mutual Distillation for Unsupervised Domain Adaptation Person Re-identification Collaborative License Plate Recognition via Association Enhancement Network With Auxiliary Learning and a Unified Benchmark VLDadaptor: Domain Adaptive Object Detection With Vision-Language Model Distillation Camera-Incremental Object Re-Identification With Identity Knowledge Evolution
×
引用
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