Homomorphic Evaluation of Database Queries

TL;DR

This paper explores how homomorphic encryption can be used to securely perform database search queries, proposing a new technique compatible with ring-based fully homomorphic encryption schemes.

Contribution

It introduces a novel database search method leveraging homomorphic encryption, enhancing data privacy during remote query processing.

Findings

Demonstrates secure search query execution over encrypted data

Proposes compatibility with Braserski's ring-based FHE scheme

Enhances privacy-preserving data retrieval methods

Abstract

Homomorphic encryption is an encryption method that enables computing over encrypted data. This has a wide range of real world ramifications such as being able to blindly compute a search result sent to a remote server without revealing its content. This paper discusses how database search queries can be made secure using a homomorphic encryption scheme. We propose a new database search technique that can be used with the ring-based fully homomorphic encryption scheme proposed by Braserski.