scholarly journals A Review on Security Techniques for Privacy-Preserving in Data Mining

Author(s):  
K. S Chandwani ◽  
Anjali Mishra ◽  
Ayushi Desai ◽  
Priyanka Kushwaha ◽  
Sonal Nikose ◽  
...  

As the rise in the data mining algorithm the extraction of knowledge from the large data is getting easy. But due to this new problem of Privacy of the knowledge from the stored data at various servers is introduced. So, it is required to provide privacy of the sensitive data from the data miners. This paper focuses on various approaches implemented by the miners for preserving of information at individual level, class level, etc. A detail description with limitation of different techniques security of privacy preserving is explained.

2011 ◽  
Vol 11 (ASAT CONFERENCE) ◽  
pp. 1-17
Author(s):  
Fahmy Aly ◽  
Fakhry Medhat ◽  
M. Hanafy ◽  
EI-Zeweidy Aly

Author(s):  
Raghvendra Kumar ◽  
Prasant Kumar Pattnaik ◽  
Priyanka Pandey

This chapter used privacy preservation techniques (Data Modification) to ensure Privacy. Privacy preservation is another important issue. A picture, where number of clients owning their clustered databases (Iris Database) wish to run a data mining algorithm on the union of their databases, without revealing any unnecessary information and requires the privacy of the privileged information. There are numbers of efficient protocols are required for privacy preserving in data mining. This chapter presented various privacy preserving protocols that are used for security in clustered databases. The Xln(X) protocol and the secure sum protocol are used in mutual computing, which can defend privacy efficiently. Its focuses on the data modification techniques, where it has been modified our distributed database and after that sanded that modified data set to the client admin for secure data communication with zero percentage of data leakage and also reduce the communication and computation complexity.


Computation ◽  
2021 ◽  
Vol 9 (1) ◽  
pp. 6
Author(s):  
Maria Eleni Skarkala ◽  
Manolis Maragoudakis ◽  
Stefanos Gritzalis ◽  
Lilian Mitrou

Distributed medical, financial, or social databases are analyzed daily for the discovery of patterns and useful information. Privacy concerns have emerged as some database segments contain sensitive data. Data mining techniques are used to parse, process, and manage enormous amounts of data while ensuring the preservation of private information. Cryptography, as shown by previous research, is the most accurate approach to acquiring knowledge while maintaining privacy. In this paper, we present an extension of a privacy-preserving data mining algorithm, thoroughly designed and developed for both horizontally and vertically partitioned databases, which contain either nominal or numeric attribute values. The proposed algorithm exploits the multi-candidate election schema to construct a privacy-preserving tree-augmented naive Bayesian classifier, a more robust variation of the classical naive Bayes classifier. The exploitation of the Paillier cryptosystem and the distinctive homomorphic primitive shows in the security analysis that privacy is ensured and the proposed algorithm provides strong defences against common attacks. Experiments deriving the benefits of real world databases demonstrate the preservation of private data while mining processes occur and the efficient handling of both database partition types.


Sign in / Sign up

Export Citation Format

Share Document