Algebraic operations on encrypted relational databases

作者:

Highlights:

摘要

In this paper, we consider the problem of performing algebraic operations and their extensions with encrypted relational databases. Each tuple of a relation is enciphered by a cryptosystem based on the extended Chinese remainder theorem. We show that one can perform the Projection, the Cartesian Product and their composite operations, such as performing the Projection followed by the Cartesian Product and performing Cartesian Product followed by the Projection, with the encrypted tuples directly without deciphering them. We also show that there does not exist a secure way to protect data for performing Comparison operations, such as Selection, Union, … , etc., with encrypted relational databases.

论文关键词:Relational database,database security,cryptosystem,relational algebra,computing with encrypted tuples

论文评审过程:Received 10 October 1991, Revised 30 June 1992, Available online 17 June 2003.

论文官网地址:https://doi.org/10.1016/0306-4379(93)90042-Y