In this Paper we uses a clustering algorithm as a pre-process for privacy preserving methods to i... more In this Paper we uses a clustering algorithm as a pre-process for privacy preserving methods to improve the diversity of anonymized data. T-closeness, which requires that the distribution of a sensitive attribute in any equivalence class is close to the distribution of the attribute in the overall table (i.e., the distance between the two distributions should be no more than a threshold t). We review Paillier`s Encryption and application to privacy preserving computation outsourcing and secure system (e.g. Online voting). Our construction begins with a somewhat homomorphic encryption scheme that works when the function is the scheme’s own decryption function. We will show how, anonymization and encryption works together for better privacy preserving in data mining.
In this Paper we uses a clustering algorithm as a pre-process for privacy preserving methods to i... more In this Paper we uses a clustering algorithm as a pre-process for privacy preserving methods to improve the diversity of anonymized data. T-closeness, which requires that the distribution of a sensitive attribute in any equivalence class is close to the distribution of the attribute in the overall table (i.e., the distance between the two distributions should be no more than a threshold t). We review Paillier`s Encryption and application to privacy preserving computation outsourcing and secure system (e.g. Online voting). Our construction begins with a somewhat homomorphic encryption scheme that works when the function is the scheme’s own decryption function. We will show how, anonymization and encryption works together for better privacy preserving in data mining.
Uploads
Papers by Divya Rathod