Abstract
We describe a practical fully homomorphic encryption (FHE) scheme based on homomorphisms between rings and show that it enables very efficient computation on encrypted data. Our encryption though is private-key; public information is only used to operate on encrypted data without decrypting it. Still, we show that our method allows for a third party search on encrypted data.
Original language | English |
---|---|
Pages (from-to) | 17-27 |
Number of pages | 10 |
Journal | Groups Complexity Cryptology |
Volume | 10 |
Issue number | 1 |
Early online date | 19 Apr 2018 |
DOIs | |
Publication status | Published - 1 May 2018 |