Security Issues of Privacy Preserving In Data Mining

Authors(2) :-Mohammed.K, P.V. Ramesh

Security is one of the most important properties of an information system must satisfy, in which systems the need to share information among different, not trusted entities, the protection of sensible information has a relevant role. Thus privacy is becoming an increasingly important issue in many data mining applications. For that privacy secure distributed computation, which was done as part of a larger body of research in the theory of cryptography, has achieved remarkable results. These results were shown using generic constructions that can be applied to any function that has an efficient representation as a circuit. A relatively new trend shows that classical access control techniques are not sufficient to guarantee privacy when data mining techniques are used in a malicious way. Privacy preserving data mining algorithms have been recently introduced with the aim of preventing the discovery of sensible information. In this paper we will describe the implementation of cryptography in that data mining for privacy preserving.

Authors and Affiliations

Department of Computer Science, RIIMS College, Tirupati, India
P.V. Ramesh
Department of Computer Science, RIIMS College, Tirupati, India

Privacy preserving, Cryptography, Data Mining, Security.

  1. Feng He,Ting Wang ,”Research and Application of Secure Multi-party Computation in Several Computational Geometry Problems”, In American Journal of Engineering & Tech. Research,Vol.11,No.9, pp.2514-2519,2011.
  2. Zulfa Shaikh,Poonm Garg,”A Comparative Study of Available Protocols during Privacy Preservation in Secure Multi-party Computation”, In Journal of Emerging trends in Computing & Information Science,Vol.2,No.5,pp.219-221,May 2011.
  3. D. Beaver, S. Micali and P. Rogaway, The round complexity of secure protocols, Proc. of 22nd ACM Symposium on Theory of Computing (STOC), pp. 503-513, 1990.
  4. M. Bellare and S. Micali, Non-Interactive Oblivious Transfer and Applications, Advances in Cryptology - CRYPTO ’89. Lecture Notes in Computer Science, Vol. 435, Springer-Verlag, 1997, pp. 547-557.
  5. M. Ben-Or, S. Goldwasser and A. Wigderson, Completeness theorems for non cryptographic fault tolerant distributed computation, Proceedings of the 20th Annual Symposium on the Theory of Computing (STOC), ACM, 1988, pp. 19.
  6. D. Chaum, C. Crepeau and I. Damgard, Multiparty unconditionally secure protocols, Proceedings of the 20th Annual Symposium on the Theory of Computing (STOC), ACM, 1988, pp. 1119.
  7. S. Even, O. Goldreich and A. Lempel. A Randomized Protocol for Signing Contracts. Communications of the ACM, 28(6):637-647, 1985.
  8. O. Goldreich. Foundations of Cryptography: Volume 2 { Basic Applications. Cambridge University Press, 2004

Publication Details

Published in : Volume 3 | Issue 4 | March-April 2018
Date of Publication : 2018-04-30
License:  This work is licensed under a Creative Commons Attribution 4.0 International License.
Page(s) : 1097-1103
Manuscript Number : CSEIT1833533
Publisher : Technoscience Academy

ISSN : 2456-3307

Cite This Article :

Mohammed.K, P.V. Ramesh, "Security Issues of Privacy Preserving In Data Mining", International Journal of Scientific Research in Computer Science, Engineering and Information Technology (IJSRCSEIT), ISSN : 2456-3307, Volume 3, Issue 4, pp.1097-1103, March-April-2018.
Journal URL :

Article Preview