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.