Euclidean Division Method for the Homomorphic Scheme CKKS
| Autor: | Elena Golimblevskaia, Mikhail Babenko |
|---|---|
| Rok vydání: | 2021 |
| Předmět: |
0303 health sciences
Theoretical computer science Computer science business.industry Euclidean division Data theft Homomorphic encryption Cloud computing Cryptography 02 engineering and technology Division (mathematics) Encryption 03 medical and health sciences Cipher 0202 electrical engineering electronic engineering information engineering 020201 artificial intelligence & image processing business Computer Science::Cryptography and Security 030304 developmental biology |
| Zdroj: | 2021 IEEE Conference of Russian Young Researchers in Electrical and Electronic Engineering (ElConRus). |
| Popis: | The use of cloud computing can reduce the economic costs of maintaining IT infrastructure, but at the same time, the likelihood of confidential data theft increases. To reduce the likelihood of it, cloud computing uses homomorphic encryption. However, a homomorphic cipher only allows adding and multiplying encrypted numbers; in some cases, a division operation is required to implement algorithms. To implement the division operation with encrypted numbers it is necessary to implement the encrypted number comparison operation. Considering that the operation of comparing encrypted numbers is carried out using numerical methods, it is necessary to adapt the existing algorithms for Euclidean division. In this article, we propose a two-stage algorithm for Euclidean division of numbers encrypted using the CKKS scheme and investigate its properties. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|