Technology Used: Java

Dependable and Secure Computing, 2011

Download Projects 2011 Basepaper


Suppose Alice owns a k-anonymous database and needs to determine whether her database, when inserted with a tuple owned by Bob, is still k-anonymous. Also, suppose that access to the database is strictly controlled, because for example data are used for certain experiments that need to be maintained confidential. Clearly, allowing Alice to directly read the contents of the tuple breaks the privacy of Bob (e.g., a patient medical record); on the other hand, the confidentiality of the database managed by Alice is violated once Bob has access to the contents of the database. Thus, the problem is to check whether the database inserted with the tuple is still k-anonymous, without letting Alice and Bob know the contents of the tuple and the database respectively. In this paper, we propose two protocols solving this problem on suppression-based and generalization-based k-anonymous and confidential databases. The protocols rely on well-known cryptographic assumptions, and we provide theoretical analyses to proof their soundness and experimental results to illustrate their efficiency.

By admin

5 thoughts on “Privacy-Preserving Updates to Anonymous and Confidential Databases”
  1. i need video demo of exploiting dynamic resorce allocation for efficient parallel data processing in cloud .wat is cost of the project?

Leave a Reply

Your email address will not be published. Required fields are marked *