Privacy preservation in distributed environment using RSA-CRT

0Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Most data mining applications are based on information sharing and additional challenges, when we are dealing with data that are containing sensitive or private information. There is no common data mining technique available that deals with private information without any leakage. Therefore, the knowledge extracted from such data may disclose the pattern with sensitive/private information. This may put privacy on the individual/group of parties. In the past few years, privacy preserving data mining has attracted the research interest and potential for a wide area of applications. There are many techniques for privacy preservation like cryptography, anonymity, and randomization, etc., experimented for privacy preservation in data mining. In this paper, information system-based approach is considered, so some of the attributes required higher privacy compared to the other attributes. This paper explores the use of cryptography techniques, namely RSA with Chinese remainder theorem (CRT) to encrypt and decrypt the database, when all the parties are trying to find their global result in presence of trusted third party or absence of trusted third party, without disclosing their private information to each other.

Cite

CITATION STYLE

APA

Kumar, R., Pattnaik, P. K., & Sharma, Y. (2016). Privacy preservation in distributed environment using RSA-CRT. In Advances in Intelligent Systems and Computing (Vol. 379, pp. 29–34). Springer Verlag. https://doi.org/10.1007/978-81-322-2517-1_4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free