二值图像的概率秘密共享方案

Abhishek Mishra, Ashutosh Gupta
{"title":"二值图像的概率秘密共享方案","authors":"Abhishek Mishra, Ashutosh Gupta","doi":"10.1109/CCINTELS.2015.7437896","DOIUrl":null,"url":null,"abstract":"Secure key management is the motivating factor for secret sharing. There are numerous practical situations when it is possible that a single secret key can unlock multiple files. Consider the case when this secret key is lost due to the computer crash or system does not boot, then it is nearly impossible to access those multiple files. In this paper, a probabilistic (2, n) SS scheme based on XOR operation is proposed for binary images. The scheme relies on random generation of matrices over which mathematical and boolean operations are performed to generate secrets. The experimental results shows that the scheme has satisfactory contrast, less prone to security attacks along with reasonable computation time.","PeriodicalId":131816,"journal":{"name":"2015 Communication, Control and Intelligent Systems (CCIS)","volume":"&NA; 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Probabilistic secret sharing scheme for binary images\",\"authors\":\"Abhishek Mishra, Ashutosh Gupta\",\"doi\":\"10.1109/CCINTELS.2015.7437896\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Secure key management is the motivating factor for secret sharing. There are numerous practical situations when it is possible that a single secret key can unlock multiple files. Consider the case when this secret key is lost due to the computer crash or system does not boot, then it is nearly impossible to access those multiple files. In this paper, a probabilistic (2, n) SS scheme based on XOR operation is proposed for binary images. The scheme relies on random generation of matrices over which mathematical and boolean operations are performed to generate secrets. The experimental results shows that the scheme has satisfactory contrast, less prone to security attacks along with reasonable computation time.\",\"PeriodicalId\":131816,\"journal\":{\"name\":\"2015 Communication, Control and Intelligent Systems (CCIS)\",\"volume\":\"&NA; 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 Communication, Control and Intelligent Systems (CCIS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CCINTELS.2015.7437896\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 Communication, Control and Intelligent Systems (CCIS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CCINTELS.2015.7437896","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

安全密钥管理是秘密共享的激励因素。在许多实际情况下,单个密钥可以解锁多个文件。考虑由于计算机崩溃或系统无法启动而丢失此密钥的情况,那么几乎不可能访问这些多个文件。本文提出了一种基于异或运算的二值图像概率(2,n) SS方案。该方案依赖于随机生成的矩阵,在这些矩阵上执行数学和布尔运算来生成秘密。实验结果表明,该方案具有令人满意的对比度,不易受到安全攻击,且计算时间合理。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Probabilistic secret sharing scheme for binary images
Secure key management is the motivating factor for secret sharing. There are numerous practical situations when it is possible that a single secret key can unlock multiple files. Consider the case when this secret key is lost due to the computer crash or system does not boot, then it is nearly impossible to access those multiple files. In this paper, a probabilistic (2, n) SS scheme based on XOR operation is proposed for binary images. The scheme relies on random generation of matrices over which mathematical and boolean operations are performed to generate secrets. The experimental results shows that the scheme has satisfactory contrast, less prone to security attacks along with reasonable computation time.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信