基于视觉密码(SCOSVC)的最优共享秘密通信新技术

J. K. Mandal, S. Ghatak
{"title":"基于视觉密码(SCOSVC)的最优共享秘密通信新技术","authors":"J. K. Mandal, S. Ghatak","doi":"10.1109/ISED.2011.49","DOIUrl":null,"url":null,"abstract":"In this paper a novel (2, m + 1) visual cryptographic technique has been proposed, where m number of secret images has been encrypted based on a randomly generated master as a common share for all secrets which is decodable with any of the shares in conjunction with master share out of m + 1 generated shares. Instead of generating new pixels for share except the master share, hamming weight of the blocks of the secret images has been modified using random function to generate shares corresponding to the secrets. The proposed scheme is secure and very easy to implement like other existing techniques of visual cryptography. At the decoding end the secrets are revealed by stacking the master share on any one share corresponding to the secrets in any arbitrary order with proper alignment directly by human visual system where shares are printed on different transparencies which conforms the optimality of using shares. The aspect ratio and dimension of the secret images and the generated shares with respect to the source images remains constant during the process.","PeriodicalId":349073,"journal":{"name":"2011 International Symposium on Electronic System Design","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":"{\"title\":\"A Novel Technique for Secret Communication through Optimal Shares Using Visual Cryptography (SCOSVC)\",\"authors\":\"J. K. Mandal, S. Ghatak\",\"doi\":\"10.1109/ISED.2011.49\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper a novel (2, m + 1) visual cryptographic technique has been proposed, where m number of secret images has been encrypted based on a randomly generated master as a common share for all secrets which is decodable with any of the shares in conjunction with master share out of m + 1 generated shares. Instead of generating new pixels for share except the master share, hamming weight of the blocks of the secret images has been modified using random function to generate shares corresponding to the secrets. The proposed scheme is secure and very easy to implement like other existing techniques of visual cryptography. At the decoding end the secrets are revealed by stacking the master share on any one share corresponding to the secrets in any arbitrary order with proper alignment directly by human visual system where shares are printed on different transparencies which conforms the optimality of using shares. The aspect ratio and dimension of the secret images and the generated shares with respect to the source images remains constant during the process.\",\"PeriodicalId\":349073,\"journal\":{\"name\":\"2011 International Symposium on Electronic System Design\",\"volume\":\"22 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-12-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"10\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 International Symposium on Electronic System Design\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISED.2011.49\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 International Symposium on Electronic System Design","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISED.2011.49","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10

摘要

本文提出了一种新颖的(2,m + 1)视觉加密技术,该技术基于随机生成的master作为所有秘密的共享,对m个秘密图像进行加密,该共享与m + 1生成的master共享中的任何一个共享都可以解码。使用随机函数修改秘密图像块的hamming权重,生成与秘密对应的共享,而不是生成除主共享外的新共享像素。与其他现有的视觉密码技术一样,该方案具有安全、易于实现的特点。在解码端,通过人类视觉系统直接将主共享以任意排列顺序叠加在与密钥对应的共享上,并将共享打印在不同的透明度上,从而实现了共享使用的最优性。在此过程中,秘密图像和生成的共享相对于源图像的宽高比和尺寸保持不变。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Novel Technique for Secret Communication through Optimal Shares Using Visual Cryptography (SCOSVC)
In this paper a novel (2, m + 1) visual cryptographic technique has been proposed, where m number of secret images has been encrypted based on a randomly generated master as a common share for all secrets which is decodable with any of the shares in conjunction with master share out of m + 1 generated shares. Instead of generating new pixels for share except the master share, hamming weight of the blocks of the secret images has been modified using random function to generate shares corresponding to the secrets. The proposed scheme is secure and very easy to implement like other existing techniques of visual cryptography. At the decoding end the secrets are revealed by stacking the master share on any one share corresponding to the secrets in any arbitrary order with proper alignment directly by human visual system where shares are printed on different transparencies which conforms the optimality of using shares. The aspect ratio and dimension of the secret images and the generated shares with respect to the source images remains constant during the process.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信