498
Views
0
CrossRef citations to date
0
Altmetric
Mathematics of Cryptography and Coding in the Quantum Era

A note on fully homomorphic encryption of real-life data

&
Pages 381-385 | Received 26 May 2021, Accepted 26 Sep 2021, Published online: 20 Oct 2021
 

Abstract

The purpose of this short paper is to explain the difference between encrypting real-life data and encrypting elements with a ring structure in the context of fully homomorphic encryption (FHE). Specifically, our encryption of real-life data is in two stages. First, we use a private-key embedding of real-life data in a ring; this embedding does not have to be fully homomorphic. This private embedding, speaking informally, takes most of the security burden off the second part of our encryption procedure, namely FHE between rings. The whole encryption function is then not fully homomorphic, but we show that it still provides for the most popular functionalities one expects from FHE, including private search on encrypted data.

Disclosure statement

No potential conflict of interest was reported by the author(s).

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.