Secure and Efficient Query Processing Technique for Encrypted Databases in Cloud

Sultan Almakdi, B. Panda
{"title":"Secure and Efficient Query Processing Technique for Encrypted Databases in Cloud","authors":"Sultan Almakdi, B. Panda","doi":"10.1109/ICDIS.2019.00026","DOIUrl":null,"url":null,"abstract":"Cloud computing is an attractive environment for both organizations and individual users, as it provides scalable computing and storage services at an affordable price. However, privacy and confidentiality are two challenges that trouble most users. Data encryption, using a powerful encryption algorithm such as the Advanced Encryption Standard (AES), is one solution that can allay users' concerns, but other challenges with searching over encrypted data have arisen. Researchers have proposed many different schemes to execute Standard Query Language (SQL) queries over encrypted data by encrypting the data with more than one encryption algorithm. However, other researchers have proposed systems based on the fragmentation of encrypted data. In this paper, we propose bit vector-based model (BVM), a secure database system that works as an intermediary between users and the cloud provider. In BVM, before the encryption and outsourcing processes, the query manager (QM) takes each record from the main table, parses it, builds a bit vector for it, and stores it. The BV stores bits, zero and one, and its length equals the total number of sub-columns for all sensitive columns. BVM aims to reduce the range of retrieved encrypted records that are related to a user's query from the cloud. In our model, the cloud provider cannot deduce information from the encrypted data nor can infer which encryption algorithm was used to encrypt data. We implement BVM and run different experiments to compare our model with the methods in which data are not encrypted in the cloud. Our evaluation shows that BVM reduces the range of the retrieved encrypted records from the cloud to less than 35 percent of encrypted records. As a result, our model avoids unnecessary decryption processes that affect delay times.","PeriodicalId":181673,"journal":{"name":"2019 2nd International Conference on Data Intelligence and Security (ICDIS)","volume":"208 1-2","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 2nd International Conference on Data Intelligence and Security (ICDIS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDIS.2019.00026","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

Cloud computing is an attractive environment for both organizations and individual users, as it provides scalable computing and storage services at an affordable price. However, privacy and confidentiality are two challenges that trouble most users. Data encryption, using a powerful encryption algorithm such as the Advanced Encryption Standard (AES), is one solution that can allay users' concerns, but other challenges with searching over encrypted data have arisen. Researchers have proposed many different schemes to execute Standard Query Language (SQL) queries over encrypted data by encrypting the data with more than one encryption algorithm. However, other researchers have proposed systems based on the fragmentation of encrypted data. In this paper, we propose bit vector-based model (BVM), a secure database system that works as an intermediary between users and the cloud provider. In BVM, before the encryption and outsourcing processes, the query manager (QM) takes each record from the main table, parses it, builds a bit vector for it, and stores it. The BV stores bits, zero and one, and its length equals the total number of sub-columns for all sensitive columns. BVM aims to reduce the range of retrieved encrypted records that are related to a user's query from the cloud. In our model, the cloud provider cannot deduce information from the encrypted data nor can infer which encryption algorithm was used to encrypt data. We implement BVM and run different experiments to compare our model with the methods in which data are not encrypted in the cloud. Our evaluation shows that BVM reduces the range of the retrieved encrypted records from the cloud to less than 35 percent of encrypted records. As a result, our model avoids unnecessary decryption processes that affect delay times.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
云环境下加密数据库安全高效的查询处理技术
云计算对组织和个人用户都是一个有吸引力的环境,因为它以可承受的价格提供可伸缩的计算和存储服务。然而,隐私和机密性是困扰大多数用户的两个挑战。使用高级加密标准(Advanced encryption Standard, AES)等功能强大的加密算法进行数据加密是一种可以减轻用户担忧的解决方案,但是在搜索加密数据时也出现了其他挑战。研究人员提出了许多不同的方案,通过使用多种加密算法对加密数据进行加密,从而对加密数据执行标准查询语言(SQL)查询。然而,其他研究人员提出了基于加密数据碎片的系统。在本文中,我们提出了位向量模型(BVM),这是一个安全的数据库系统,作为用户和云提供商之间的中介。在BVM中,在加密和外包流程之前,查询管理器(QM)从主表中获取每条记录,对其进行解析,为其构建位向量,并存储它。BV存储位,0和1,它的长度等于所有敏感列的子列的总数。BVM旨在减少从云中检索到的与用户查询相关的加密记录的范围。在我们的模型中,云提供商不能从加密的数据中推断出信息,也不能推断出使用了哪种加密算法来加密数据。我们实现了BVM,并运行了不同的实验,将我们的模型与未在云中加密数据的方法进行比较。我们的评估表明,BVM将从云中检索到的加密记录的范围减少到加密记录的35%以下。因此,我们的模型避免了影响延迟时间的不必要的解密过程。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Platform-Agnostic Language to Map Control Primitives to SCADA Communication Protocols Selection of Optimal Closure Relationships for Multiphase Flow using a Genetic Algorithm Data Dependencies Preserving Shuffle in Relational Database Improved Mix Column Computation of Cryptographic AES Physiological Measurement for Emotion Recognition in Virtual Reality
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1