Robust Fabrication of Share to Assure Error Free Dissemination of Secret Data (RFSAEFDSD)

A. Goswami, R. Mukherjee, N. Ghoshal
{"title":"Robust Fabrication of Share to Assure Error Free Dissemination of Secret Data (RFSAEFDSD)","authors":"A. Goswami, R. Mukherjee, N. Ghoshal","doi":"10.1109/WISPNET.2018.8538439","DOIUrl":null,"url":null,"abstract":"In wireless domain, digital communication requires effective data security. The proposed algorithm promotes effective security by incorporating visual cryptography, sharing of secret data through robust fabrication, error identification & correction using the binary repetition code of length 3 and authentication of the secret data through Hash value checking. The effective utilization of two distinct color cover images and the three planes simultaneously justifies robustness in hiding. In addition, the use of mid frequency region of DCT spectrum and pseudorandom casting locations support resistance to some other image processing attacks apart from JPEG compression. The volume of payload is increased considerably by fabricating four bits at a time in a single block. The data correctness is well supported by reducing the computational overhead and introducing error bit correction. At the receiving end, the authorization of a document and its owner is ratified by a Hash function. The experimentation of the algorithm and subsequent analysis of the results depict the credibility of the algorithm in the domain of data security.","PeriodicalId":6858,"journal":{"name":"2018 International Conference on Wireless Communications, Signal Processing and Networking (WiSPNET)","volume":"102 1","pages":"1-5"},"PeriodicalIF":0.0000,"publicationDate":"2018-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 International Conference on Wireless Communications, Signal Processing and Networking (WiSPNET)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WISPNET.2018.8538439","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In wireless domain, digital communication requires effective data security. The proposed algorithm promotes effective security by incorporating visual cryptography, sharing of secret data through robust fabrication, error identification & correction using the binary repetition code of length 3 and authentication of the secret data through Hash value checking. The effective utilization of two distinct color cover images and the three planes simultaneously justifies robustness in hiding. In addition, the use of mid frequency region of DCT spectrum and pseudorandom casting locations support resistance to some other image processing attacks apart from JPEG compression. The volume of payload is increased considerably by fabricating four bits at a time in a single block. The data correctness is well supported by reducing the computational overhead and introducing error bit correction. At the receiving end, the authorization of a document and its owner is ratified by a Hash function. The experimentation of the algorithm and subsequent analysis of the results depict the credibility of the algorithm in the domain of data security.
确保秘密数据无错误传播的鲁棒共享构建(RFSAEFDSD)
在无线领域,数字通信需要有效的数据安全保护。所提出的算法通过结合可视化加密、通过鲁棒制作共享秘密数据、使用长度为3的二进制重复码识别和纠正错误以及通过哈希值检查对秘密数据进行认证来提高有效的安全性。同时有效地利用了两种不同颜色的覆盖图像和三个平面,证明了隐藏的鲁棒性。此外,使用DCT频谱的中频区域和伪随机投射位置支持抵抗除JPEG压缩之外的一些其他图像处理攻击。通过在单个块中一次制造四个比特,有效载荷的体积大大增加。通过减少计算开销和引入错误位校正,可以很好地支持数据的正确性。在接收端,文档及其所有者的授权由哈希函数批准。该算法的实验和后续结果分析表明了该算法在数据安全领域的可靠性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信