{"title":"确保秘密数据无错误传播的鲁棒共享构建(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":"{\"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}","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}
Robust Fabrication of Share to Assure Error Free Dissemination of Secret Data (RFSAEFDSD)
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.