Crowds: anonymity for Web transactions
ACM Transactions on Information and System Security (TISSEC)
The Decision Diffie-Hellman Problem
ANTS-III Proceedings of the Third International Symposium on Algorithmic Number Theory
k-anonymity: a model for protecting privacy
International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems
Information sharing across private databases
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
The role of cryptography in database security
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Database Security-Concepts, Approaches, and Challenges
IEEE Transactions on Dependable and Secure Computing
Privacy-enhancing k-anonymization of customer data
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Private Updates to Anonymous Databases
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Anonymity for continuous data publishing
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
Privacy-preserving incremental data dissemination
Journal of Computer Security - Selected papers from the Third and Fourth Secure Data Management (SDM) workshops
Privacy-Preserving Updates to Anonymous and Confidential Databases
IEEE Transactions on Dependable and Secure Computing
ICDT'05 Proceedings of the 10th international conference on Database Theory
Anonymous connections and onion routing
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
While creating an anonymous database it is assumed that all data is available at the time of creation. Once record is added to database, it is not deleted or if a user wants to delete person's record from database, it will be removed from it in its next release. Recently there is strong demand for immediate and up-to-date information for anonymous database. Also as anonymous database is derived from original database (nonanonymized), whatever changes made to the original database should be reflected in anonymous database. Bob's tuple should be deleted from Alice's database only if database remains k-anonymous after deletion. Also if tuple deleted from Charles' database it should be removes from Alice database. While performing these operations privacy of data provider (Bob), owner of anonymous database (Alice), and owner of original database (Charles) should be preserved. That is Alice should not know the content of Charles' database and Bob's tuple to be deleted, and Bob and Charles should not have access to Alice database. The existing protocol for updating database does not handle issues of deleting tuple from database. We propose a protocol to address these issues on generalization-based k-anonymous and confidential database by extending the existing protocol for privacy preserving updates to anonymous and confidential database.