CRJun 10, 2016

Homomorphic Evaluation of Database Queries

arXiv:1606.03304v1
Originality Synthesis-oriented
AI Analysis

This addresses privacy concerns for users querying remote databases, but appears incremental as it builds on existing encryption schemes.

The paper tackles the problem of securely performing database search queries on encrypted data using homomorphic encryption, proposing a new technique compatible with a ring-based fully homomorphic encryption scheme.

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.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes