A Novel XOR-based Visual Secret Sharing Scheme with Random Grid

R. Pati, A. Nag
{"title":"A Novel XOR-based Visual Secret Sharing Scheme with Random Grid","authors":"R. Pati, A. Nag","doi":"10.6029/smartcr.2015.05.004","DOIUrl":null,"url":null,"abstract":"The basic concept of secret image sharing is to encrypt a secret image into a number of meaningless share images. Except for all the images, no information should leak out from any of the share images. The original secret image is printed onto transparencies, and stacking these transparencies directly reveals the original image. The advantage lies in the fact that no computational cost is encountered, and only the human visual system is required to decode the secret image. The visual secret sharing scheme is to encrypt a secret image into a set of share images to increase the encryption capacity. However, the schemes available use a codebook, and used pixel expansion to encrypt secret images into share images. In general, pixel expansion of twice the original order is seen. It is neither practical nor the best solution when secret images are more in number. This paper proposes a novel visual secret sharing scheme that can share a binary secret image on two share images with no codebook requirement. The experimental result reveals that the proposed approach has high contrast and also has an excellent recovery quality of the secret image. The recovered secret image type is lossless.","PeriodicalId":377081,"journal":{"name":"Smart Comput. Rev.","volume":"83 7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Smart Comput. Rev.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.6029/smartcr.2015.05.004","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

The basic concept of secret image sharing is to encrypt a secret image into a number of meaningless share images. Except for all the images, no information should leak out from any of the share images. The original secret image is printed onto transparencies, and stacking these transparencies directly reveals the original image. The advantage lies in the fact that no computational cost is encountered, and only the human visual system is required to decode the secret image. The visual secret sharing scheme is to encrypt a secret image into a set of share images to increase the encryption capacity. However, the schemes available use a codebook, and used pixel expansion to encrypt secret images into share images. In general, pixel expansion of twice the original order is seen. It is neither practical nor the best solution when secret images are more in number. This paper proposes a novel visual secret sharing scheme that can share a binary secret image on two share images with no codebook requirement. The experimental result reveals that the proposed approach has high contrast and also has an excellent recovery quality of the secret image. The recovered secret image type is lossless.
一种基于xor的随机网格可视化秘密共享方案
秘密图像共享的基本概念是将一个秘密图像加密为多个无意义的共享图像。除了所有映像之外,任何共享映像都不应该泄露任何信息。原始秘密图像被打印到透明片上,叠加这些透明片直接显示原始图像。其优点在于不需要计算成本,只需要人类视觉系统来解码秘密图像。可视化秘密共享方案是将一个秘密图像加密为一组共享图像,以增加加密容量。然而,现有的方案使用一个码本,并使用像素扩展将秘密图像加密为共享图像。一般情况下,可以看到像素扩展到原顺序的两倍。当秘密图像数量较多时,它既不实用,也不是最佳解决方案。本文提出了一种新的视觉秘密共享方案,该方案可以在不需要码本的情况下在两个共享图像上共享一个二进制秘密图像。实验结果表明,该方法具有较高的对比度和较好的秘密图像恢复质量。恢复的秘密图像类型是无损的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信