The week's pick
Random Articles
Reseach Article
Using Clustering Approach Privacy Preserving Update to Anonymous and Confidential Databases
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 116 - Number 11 |
| Year of Publication: 2015 |
| Authors: Pravin Patil, Vinod Ingale, Sonali Patil |
10.5120/20383-2641
|
Pravin Patil, Vinod Ingale, Sonali Patil . Using Clustering Approach Privacy Preserving Update to Anonymous and Confidential Databases. International Journal of Computer Applications. 116, 11 ( April 2015), 36-38. DOI=10.5120/20383-2641
Abstract
In order to update k-anonymous and confidential database, the suppression based and generalization based updating protocol technique has been proposed. These protocols check whether the database inserted with the new tuple is still k - anonymous without knowing the content of the table and database respectively. But these methods will not work if initial database is empty. Also, if the incoming tuple that fails the test of these updating protocols, there is no solution for which action to be taken. So, in this paper we propose two solutions based on pending tuple set (i. e. a collection of all tuples that fails anonymous property of database) namely the private extraction of k-anonymous part of pending tuple set or k-anonymization of pending tuple set by privately suppressing entries.
References
- L. Sweeney. "K-anonymity: a model for protecting privacy". International Journal on Uncertainty, Fuzziness and Knowledge-based Systems, 2002
- P. Samarti. Protecting respondent'sprivacy in microdata release. IEEE Transactions on knowledge and Data Engineering,vol. 13,no. 6,pp. 1010-1027,Nov/Dec. 2001.
- US Department of Health & Human Services, Office for Civil Rights. Summary of the HIPAA Privacy Rule, 2003.
- S. Zhong, Z. Yang, R. N. Wright. "Privacy-enhancing k-anonymization of customer data". In Proc. ACM Symposium on Principles of Database Systems (PODS), 2005.
- P. Samarati and L. Sweeney. Optimal anonymity using k-similar, a new clustering algorithm. Under review,2003.
- V. Ciriani, S. De Capitani di Vimercati, S. Foresti, and P. Samarati "k Anonymity"Universitµa degli Studi di Milano, 26013 Crema, Italia fciriani, decapita, foresti.
- A. Meyerson and R. Williams. On the complexity of optimal k-anonymity. In Proc. 22nd ACMSIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, Paris, France, June 2004.
- A. Trombetta, E. Bertino. "Private updates to anonymous databases". In Proc. Int'l Conf. on Data Engineering (ICDE),Atlanta,Georgia,US 2006.
- N. R. Adam, J. C. Wortmann. "Security-control methods for statistical databases: a comparative study", ACM Computing Surveys 1989
- Alberto Trombetta,Wei Jiang, Elisa Bertino and Lorenzo Bossi "Privacy-Preserving Updates to Anonymous and Confidential Databases" 2011.
- O. Goldreich. Foundations of Cryptography. Volume 2, Basic Applications, Cambridge University Press, 2004
- U. Maurer. The role of cryptography in database security. In Proc. of ACM SIGMOD Int'l Conf. on Management of Data,Paris,France,2004.
- R. Canetti, Y. Ishai, R. Kumar, m. K. Reiter, R. Rubinfeld, R. N. Wright. Selective private function evaluation with application to private statistics. In Proc. of ACM Symposium on Principles of Distributed Computing (PODC), Newport, Rhode Island, USA, 2001.
Index Terms
Keywords