Enhanced MORE Algorithm for Fully Homomorphic Encryption Based on Secret Information Moduli Set

K. J. Muhammed, K. Gbolagade
{"title":"Enhanced MORE Algorithm for Fully Homomorphic Encryption Based on Secret Information Moduli Set","authors":"K. J. Muhammed, K. Gbolagade","doi":"10.1109/IEEM44572.2019.8978501","DOIUrl":null,"url":null,"abstract":"Cloud Computing has offers incredible benefits in terms of data storage and data processing. However, data protection and privacy issues when it comes to data processing on the cloud has triggered several challenges for the existing crypto-systems. In this paper, we propose symmetric based Fully Homomorphic Encryption (FHE) scheme with Matrix Operation for Randomization and Encryption (MORE) that allows arbitrary computation on an encrypted data. The proposed scheme uses Secret Information Moduli Set (SIMS) to preserved data privacy and enhanced the existing MORE scheme. The result shows that the proposed scheme (MORESIMS) tradeoff 2% execution time compared to MORE scheme with high level of security and better storage overhead of n x n based on presented security analysis.","PeriodicalId":255418,"journal":{"name":"2019 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IEEM44572.2019.8978501","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

Cloud Computing has offers incredible benefits in terms of data storage and data processing. However, data protection and privacy issues when it comes to data processing on the cloud has triggered several challenges for the existing crypto-systems. In this paper, we propose symmetric based Fully Homomorphic Encryption (FHE) scheme with Matrix Operation for Randomization and Encryption (MORE) that allows arbitrary computation on an encrypted data. The proposed scheme uses Secret Information Moduli Set (SIMS) to preserved data privacy and enhanced the existing MORE scheme. The result shows that the proposed scheme (MORESIMS) tradeoff 2% execution time compared to MORE scheme with high level of security and better storage overhead of n x n based on presented security analysis.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于秘密信息模集的全同态加密增强MORE算法
云计算在数据存储和数据处理方面提供了令人难以置信的好处。然而,当涉及到云上的数据处理时,数据保护和隐私问题给现有的加密系统带来了一些挑战。在本文中,我们提出了基于对称的全同态加密(FHE)方案,该方案具有随机化和加密的矩阵运算(MORE),允许对加密数据进行任意计算。该方案利用秘密信息模集(Secret Information Moduli Set, SIMS)保护数据隐私,并对现有的MORE方案进行了改进。结果表明,基于所提出的安全性分析,与具有高安全性和更好的存储开销(n × n)的MORE方案相比,所提出的方案(MORESIMS)节省了2%的执行时间。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Locating Humanitarian Relief Effort Facility Using P-Center Method A Method of Fault Identification Considering High Fix Priority in Open Source Project Model-based Systems Engineering Process for Supporting Variant Selection in the Early Product Development Phase A Method of Parameter Estimation in Flexible Jump Diffusion Process Models for Open Source Maintenance Effort Management Kanban-CONWIP Hybrid Model for Improving Productivity of an Electrostatic Coating Process
×
引用
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