Journals Proceedings

International Journal of Advances in Computer Networks and Its Security

Distributed privacy preserving data mining: a Framework for k-anonymity based on feature set Partitioning approach of vertically fragmented Databases

Author(s) : JALPA PATEL, KEYUR RANA

Abstract

Recently, many data mining algorithms for discovering and exploiting patterns in data are developed and the amount of data about individuals that is collected and stored continues to rapidly increase. However, databases containing information about individuals may be sensitive and data mining algorithms run on such data sets may violate individual privacy. Also most organizations collect and share information for their specific needs very frequently. In such cases it is important for each organization to make sure that the privacy of the individual is not violated or sensitive information is not revealed. In this paper we have proposed a novel method to provide privacy to the data when the data is vertically partitioned and distributed over sites. In this work we presented trusted third party framework along with an application that generates k-anonymous dataset from two vertically partitioned sources without disclosing data from one site to other. K- anonymity constraint is satisfied using feature set partitioning method, which uses a genetic algorithm to search for optimal feature set partition and conventional asymmetric cryptographic technique will be used in case of trusted third party model. So in order to preserve privacy of the data trusted third party has been used and such data is first anonymized at local party using feature set partitioning method and then global classification and anonymization done at the trusted third party. We have proposed algorithm and tested different data sets for vertically partitions.

No fo Author(s) : 2
Page(s) : 62 - 66
Electronic ISSN : 2250 - 3757
Volume 4 : Issue 3
Views : 595   |   Download(s) : 171