Fully homomorphic encryption for data privacy in entity resolution

Abstract

In this paper, we have detailed some basic implementations of string algorithms with FHE that are useful in blocking and scoring entity resolution systems. Integrating these string operations with FHE is valuable not only as a step to implementing the blocking and scoring method of entity resolution with FHE but also for computer science in general. In its current state, FHE cannot be used commercially because it is far too slow. But as the hardware for FHE continues to improve, there will be more and more practical applications for FHE. These simple string operations serve as primitives in different search and database applications. They have universal value to any process that requires string matching. Here we have taken the first steps to implementing them with FHE.