用户友好的基于xor的随机网格可视化秘密共享

Tzuo-Yau Fan, H. Chao
{"title":"用户友好的基于xor的随机网格可视化秘密共享","authors":"Tzuo-Yau Fan, H. Chao","doi":"10.1049/iet-ifs.2017.0546","DOIUrl":null,"url":null,"abstract":"This study proposes a user-friendly XOR-based visual secret sharing scheme using random grids. In some visual secret sharing schemes, problems such as pixel expansion or noisy and meaningless shares may be encountered. In the proposed scheme, different regions in the shared image will have different brightness levels depending on the cover image's pixel values so that the generated shares contain information regarding the cover image and are not just a meaningless noisy image. This can overcome the difficulty in recovering the secret image in cases wherein the shares were mixed up by mistake. Furthermore, the dimension of the share is the same as the secret image and there are no pixel expansion problems. The size of the recovered secret image is consistent with the size of the original secret image, and there are no changes in scaling. Lastly, although one of the generated share is a complementary cover image, the image quality of the recovered secret image is still favourable when the secret image is recovered. The experimental and analysis results demonstrate that the proposed scheme is more effective than other schemes.","PeriodicalId":13305,"journal":{"name":"IET Inf. Secur.","volume":"58 4 1","pages":"398-403"},"PeriodicalIF":0.0000,"publicationDate":"2018-08-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"User-friendly XOR-based visual secret sharing by random grid\",\"authors\":\"Tzuo-Yau Fan, H. Chao\",\"doi\":\"10.1049/iet-ifs.2017.0546\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This study proposes a user-friendly XOR-based visual secret sharing scheme using random grids. In some visual secret sharing schemes, problems such as pixel expansion or noisy and meaningless shares may be encountered. In the proposed scheme, different regions in the shared image will have different brightness levels depending on the cover image's pixel values so that the generated shares contain information regarding the cover image and are not just a meaningless noisy image. This can overcome the difficulty in recovering the secret image in cases wherein the shares were mixed up by mistake. Furthermore, the dimension of the share is the same as the secret image and there are no pixel expansion problems. The size of the recovered secret image is consistent with the size of the original secret image, and there are no changes in scaling. Lastly, although one of the generated share is a complementary cover image, the image quality of the recovered secret image is still favourable when the secret image is recovered. The experimental and analysis results demonstrate that the proposed scheme is more effective than other schemes.\",\"PeriodicalId\":13305,\"journal\":{\"name\":\"IET Inf. Secur.\",\"volume\":\"58 4 1\",\"pages\":\"398-403\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-08-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IET Inf. Secur.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1049/iet-ifs.2017.0546\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IET Inf. Secur.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1049/iet-ifs.2017.0546","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

摘要

本研究提出了一种用户友好的基于xor的随机网格可视化秘密共享方案。在一些视觉秘密共享方案中,可能会遇到像素扩展或有噪声和无意义共享等问题。在该方案中,共享图像中的不同区域将根据封面图像的像素值具有不同的亮度水平,从而生成的共享图像包含有关封面图像的信息,而不仅仅是无意义的噪声图像。这可以克服在错误地混淆股份时恢复秘密图像的困难。此外,共享的维度与秘密图像相同,不存在像素扩展问题。恢复的秘密图像大小与原始秘密图像大小一致,且缩放没有变化。最后,虽然生成的共享中有一个是互补的封面图像,但当秘密图像被恢复时,恢复的秘密图像的图像质量仍然很好。实验和分析结果表明,该方案比其他方案更有效。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
User-friendly XOR-based visual secret sharing by random grid
This study proposes a user-friendly XOR-based visual secret sharing scheme using random grids. In some visual secret sharing schemes, problems such as pixel expansion or noisy and meaningless shares may be encountered. In the proposed scheme, different regions in the shared image will have different brightness levels depending on the cover image's pixel values so that the generated shares contain information regarding the cover image and are not just a meaningless noisy image. This can overcome the difficulty in recovering the secret image in cases wherein the shares were mixed up by mistake. Furthermore, the dimension of the share is the same as the secret image and there are no pixel expansion problems. The size of the recovered secret image is consistent with the size of the original secret image, and there are no changes in scaling. Lastly, although one of the generated share is a complementary cover image, the image quality of the recovered secret image is still favourable when the secret image is recovered. The experimental and analysis results demonstrate that the proposed scheme is more effective than other schemes.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Revisit Two Memoryless State-Recovery Cryptanalysis Methods on A5/1 Improved Lattice-Based Mix-Nets for Electronic Voting Adaptive and survivable trust management for Internet of Things systems Comment on 'Targeted Ciphers for Format-Preserving Encryption' from Selected Areas in Cryptography 2018 Time-specific encrypted range query with minimum leakage disclosure
×
引用
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