Privacy Preserving Updates to Anonymous and Confidential Database (Secure Computing)

Abstract: The main theme of Secure Computing is to provide Data Security which can be well explained by a simple example. Suppose “X” owns a k-anonymous database and needs to determine whether “X” database, when inserted with a tuple owned by “Y”, is still k-anonymous. Clearly, allowing “X” to directly read the contents of the tuple breaks the privacy of “Y”. (e.g., a patient's medical record); In this place, ”Y” not get the privacy of own information because the information of “Y” can be accessed by “X” without the prior knowledge of “Y”. On the other hand, the confidentiality of the database managed by “X” is violated once “Y” has access to the contents of database. Thus, the problem is to check whether the database inserted with the tuple is still k-anonymous, without letting “X” and “Y” knows the contents of the tuple and database respectively. Here, we implement Homomorphism Cryptographic Algorithm to serve the purpose.

Keywords: Generalization and suppression techniques, Anonymous and Confidential Databases, secured computing, Homorphism cryptographic algorithm.