为云上的大型关系数据降低了复杂性和可靠的完整性保护

Waqas Haider, M. W. Nisar, T. Saba, Muhammad Sharif, Raja Umair Haider, Nadeem Muhammad Bilal, Muhammad Attique Khan
{"title":"为云上的大型关系数据降低了复杂性和可靠的完整性保护","authors":"Waqas Haider, M. W. Nisar, T. Saba, Muhammad Sharif, Raja Umair Haider, Nadeem Muhammad Bilal, Muhammad Attique Khan","doi":"10.1504/IJICS.2021.115347","DOIUrl":null,"url":null,"abstract":"At present, governments and private business operations are highly dependent on relational data applications such as bank accounts, citizen registration, etc. These relational data dependent operations require reliable integrity protection while utilising the cloud computing storage infrastructure. Identification and recovery of stolen bits are a major assistance to the reliable integrity protection services for the sensitive relational data applications. To deal with the problems of detecting and recovering tampering in large relational data at minimum computational complexity, in this paper, N8WA (briefed in Section 2.1) coding-based scheme is presented. Overall the scheme is comprised of two cross functional modules. The first module is labelled as compact code generation using N8WA coding and code registration at registration module (RM). In the second module which is called accurate locating/restoring tampering, utilising the mismatching of different compact codes based on N8WA from RM, the major/minor tampered data is accurately located and restored. Investigational outcome indicates that the scheme ensures the computational complexity of O(n2) while minimum to maximum alterations is accurately localised and restored successfully.","PeriodicalId":164016,"journal":{"name":"Int. J. Inf. Comput. Secur.","volume":"104 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A complexity reduced and reliable integrity protection for large relational data over clouds\",\"authors\":\"Waqas Haider, M. W. Nisar, T. Saba, Muhammad Sharif, Raja Umair Haider, Nadeem Muhammad Bilal, Muhammad Attique Khan\",\"doi\":\"10.1504/IJICS.2021.115347\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"At present, governments and private business operations are highly dependent on relational data applications such as bank accounts, citizen registration, etc. These relational data dependent operations require reliable integrity protection while utilising the cloud computing storage infrastructure. Identification and recovery of stolen bits are a major assistance to the reliable integrity protection services for the sensitive relational data applications. To deal with the problems of detecting and recovering tampering in large relational data at minimum computational complexity, in this paper, N8WA (briefed in Section 2.1) coding-based scheme is presented. Overall the scheme is comprised of two cross functional modules. The first module is labelled as compact code generation using N8WA coding and code registration at registration module (RM). In the second module which is called accurate locating/restoring tampering, utilising the mismatching of different compact codes based on N8WA from RM, the major/minor tampered data is accurately located and restored. Investigational outcome indicates that the scheme ensures the computational complexity of O(n2) while minimum to maximum alterations is accurately localised and restored successfully.\",\"PeriodicalId\":164016,\"journal\":{\"name\":\"Int. J. Inf. Comput. Secur.\",\"volume\":\"104 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-05-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Int. J. Inf. Comput. Secur.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1504/IJICS.2021.115347\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Int. J. Inf. Comput. Secur.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1504/IJICS.2021.115347","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

目前,政府和私营企业运营高度依赖关系数据应用,如银行账户、公民登记等。这些依赖于关系数据的操作在利用云计算存储基础设施时需要可靠的完整性保护。被盗数据的识别和恢复是为敏感关系数据应用提供可靠的完整性保护服务的重要手段。为了以最小的计算复杂度处理大型关系数据中的篡改检测和恢复问题,本文提出了基于N8WA(见2.1节)编码的方案。总体而言,该方案由两个跨功能模块组成。第一个模块被标记为使用N8WA编码和注册模块(RM)的代码注册的紧凑代码生成。第二个模块是准确定位/恢复篡改,利用RM基于N8WA的不同压缩码的不匹配,准确定位和恢复主要/次要篡改数据。研究结果表明,该方案在保证了0 (n2)的计算复杂度的同时,能够准确地定位和恢复最小到最大的变化。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A complexity reduced and reliable integrity protection for large relational data over clouds
At present, governments and private business operations are highly dependent on relational data applications such as bank accounts, citizen registration, etc. These relational data dependent operations require reliable integrity protection while utilising the cloud computing storage infrastructure. Identification and recovery of stolen bits are a major assistance to the reliable integrity protection services for the sensitive relational data applications. To deal with the problems of detecting and recovering tampering in large relational data at minimum computational complexity, in this paper, N8WA (briefed in Section 2.1) coding-based scheme is presented. Overall the scheme is comprised of two cross functional modules. The first module is labelled as compact code generation using N8WA coding and code registration at registration module (RM). In the second module which is called accurate locating/restoring tampering, utilising the mismatching of different compact codes based on N8WA from RM, the major/minor tampered data is accurately located and restored. Investigational outcome indicates that the scheme ensures the computational complexity of O(n2) while minimum to maximum alterations is accurately localised and restored successfully.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信