Homomorphic Comparison Methods: Technologies, Challenges, and Opportunities

M. Babenko, A. Tchernykh, E. Golimblevskaia, Luis Bernardo Pulido-Gaytan, A. Avetisyan
{"title":"Homomorphic Comparison Methods: Technologies, Challenges, and Opportunities","authors":"M. Babenko, A. Tchernykh, E. Golimblevskaia, Luis Bernardo Pulido-Gaytan, A. Avetisyan","doi":"10.1109/EnT50437.2020.9431252","DOIUrl":null,"url":null,"abstract":"The use of cloud computing imposes a number of restrictions related to the security and confidentiality of stored and processed data. One of the mechanisms that allows expanding the scope of public cloud services for processing personal and medical data is homomorphic encryption. Homomorphic encryption allows performing arithmetic addition and multiplication operations on encrypted data. To expand the scope of homomorphic encryption, efficient algorithms are needed to implement the operation of comparing encrypted numbers. In this paper we investigate existing algorithms of encrypted numbers comparison for homomorphic encryption schemes operating both with integers and with fixed-precision numbers. We have shown that for homomorphic integer ciphers, there are efficient algorithms for comparing encrypted numbers based on Lagrange interpolation of a function of two variables. We have shown that fixed-precision comparison of encrypted numbers is an open problem.","PeriodicalId":129694,"journal":{"name":"2020 International Conference Engineering and Telecommunication (En&T)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 International Conference Engineering and Telecommunication (En&T)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EnT50437.2020.9431252","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

The use of cloud computing imposes a number of restrictions related to the security and confidentiality of stored and processed data. One of the mechanisms that allows expanding the scope of public cloud services for processing personal and medical data is homomorphic encryption. Homomorphic encryption allows performing arithmetic addition and multiplication operations on encrypted data. To expand the scope of homomorphic encryption, efficient algorithms are needed to implement the operation of comparing encrypted numbers. In this paper we investigate existing algorithms of encrypted numbers comparison for homomorphic encryption schemes operating both with integers and with fixed-precision numbers. We have shown that for homomorphic integer ciphers, there are efficient algorithms for comparing encrypted numbers based on Lagrange interpolation of a function of two variables. We have shown that fixed-precision comparison of encrypted numbers is an open problem.
同态比较方法:技术、挑战和机遇
云计算的使用对存储和处理的数据的安全性和机密性施加了许多限制。允许扩大用于处理个人和医疗数据的公共云服务范围的机制之一是同态加密。同态加密允许对加密数据执行算术加法和乘法运算。为了扩大同态加密的范围,需要有效的算法来实现加密数的比较操作。本文研究了同时操作整数和固定精度数的同态加密方案的现有加密数比较算法。我们已经证明了对于同态整数密码,存在基于两个变量函数的拉格朗日插值的比较加密数的有效算法。我们已经证明了加密数字的固定精度比较是一个开放的问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信