Secure Optimal k-NN on Encrypted Cloud Data using Homomorphic Encryption with Query Users

K. Shankar, M. Ilayaraja
{"title":"Secure Optimal k-NN on Encrypted Cloud Data using Homomorphic Encryption with Query Users","authors":"K. Shankar, M. Ilayaraja","doi":"10.1109/ICCCI.2018.8441290","DOIUrl":null,"url":null,"abstract":"In cloud computing, research on security issues among outsourced encrypted data is trending topic. It has broad applications in area-based management, classification, and clustering. As any other normal utilized query for online applications, secure k-Nearest Neighbors (k-NN) calculation on encrypted cloud data is highly being considered now a days, and a few advanced answers have been produced. This paper proposed an innovative plan for encrypting the outsourced database and query points. The new plan can adequately support k-Nearest Neighbor (KNN) computation while preserving data privacy and query privacy. To improve the performance of the system, the Opposition-based Particle Swarm Optimization (OPSO) optimization algorithm is utilized to secure the data by Homomorphic Encryption (HE) method. The broad hypothetical and test assessments exhibit the adequacy of our plan with regards to security and performance.","PeriodicalId":141663,"journal":{"name":"2018 International Conference on Computer Communication and Informatics (ICCCI)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 International Conference on Computer Communication and Informatics (ICCCI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCCI.2018.8441290","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

In cloud computing, research on security issues among outsourced encrypted data is trending topic. It has broad applications in area-based management, classification, and clustering. As any other normal utilized query for online applications, secure k-Nearest Neighbors (k-NN) calculation on encrypted cloud data is highly being considered now a days, and a few advanced answers have been produced. This paper proposed an innovative plan for encrypting the outsourced database and query points. The new plan can adequately support k-Nearest Neighbor (KNN) computation while preserving data privacy and query privacy. To improve the performance of the system, the Opposition-based Particle Swarm Optimization (OPSO) optimization algorithm is utilized to secure the data by Homomorphic Encryption (HE) method. The broad hypothetical and test assessments exhibit the adequacy of our plan with regards to security and performance.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于查询用户同态加密的云数据安全最优k-NN
在云计算领域,外包加密数据的安全问题是研究的热点。它在基于区域的管理、分类和聚类等方面有着广泛的应用。与在线应用的其他常用查询一样,加密云数据上的安全k-最近邻(k-NN)计算现在受到高度关注,并产生了一些高级答案。本文提出了一种对外包数据库和查询点进行加密的创新方案。新方案能够在保证数据隐私和查询隐私的同时,充分支持k-最近邻(KNN)计算。为了提高系统的性能,采用基于对立的粒子群优化算法(OPSO)对数据进行同态加密(HE)保护。广泛的假设和测试评估显示了我们的计划在安全性和性能方面的充分性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Critical review of machine learning approaches to apply big data analytics in DDoS forensics Detection of the effect of exercise on APG signals Categorisation of security threats for smart home appliances Rotation-based LTE downlink resource scheduling using queue status monitoring Design and Analysis of Booth Multiplier with Optimised Power Delay Product
×
引用
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