Computing with Fully Homomorphic Encryption
Constructions, Characteristics and Comparisons
A. Bulboaca (TU Delft - Electrical Engineering, Mathematics and Computer Science)
Evangelia Anna Markatou – Mentor (TU Delft - Cyber Security)
T.J. Coopmans – Graduation committee member (TU Delft - QCD/Coopmans Group)
More Info
expand_more
Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.
Abstract
In the digital economy, individual data sovereignty is a requirement for sustainable and secure development. With an increase in the number of outsourced computations, due to the adoption of web services, artificial intelligence and research-based innovation, privacy became one of the main concerns for individuals and third parties alike. Fully Homomorphic Encryption (FHE) addresses this gap by enabling secure computations on encrypted data. This paper reviews and presents the FHE literature in a structural manner, covering the topics of mathematical constructions, security, efficiency and functionality. In doing so, it highlights the current state-of-the-art techniques and provides a systemic comparison with other privacy enhancing mechanisms. In addition, it discusses its applicability in the practical domain, such as Confidential Machine Learning, Medical Data Analysis and Recommender Systems, mentioning potential impediments and their solutions for mass adoption.