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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Apostol, T.: Introduction to Analytical Number Theory, Student edn. Springer International (1989)
Boneh, D., Shacham, H.: Fast variants of RSA. Crypto Bytes, Springer 5(1), 1–9 (2002)
Sun, H.M., Wu, M.E.: An approach towards rebalanced RSA-CRT with short public exponent. Cryptology ePrint Archive: Report 2005/053 (2005)
Agrawal, S., Krishnan, V., Haritsa, J.R.: On addressing efficiency concerns in privacy-preserving mining. In: Proceedings of the 9th International Conference on Database Systems for Advanced Applications. LNCS 2973, pp. 113–124. Springer-Verlag, Jeju Island
Peng, Z., Yun-Hai, T., Shi-Wei, T., Dong-Qing, Y., Xiu-Li, M.: An effective method for privacy preserving association rule mining. J. Softw. 17(8), 1764–1773 (2006)
Linedell, Y., Pinkas, B.: Secure multiparty computation for privacy-preserving data mining. J. Privacy Confidentiality 1(1) 59–98 ((2009))
Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. Adv. Cryptog. EUROCRYPT ’99, pp. 223–238. Prague, Czech Republic (1999)
Rivest, R., Adleman, L., Dertouzos, M.: On data banks and privacy homomorphism’s. In: R.A. De Milloetal (ed.) Foundations of Secure Computation, pp. 169–179. Academic Press (2000)
Qiong, G., Xiao-hui, C.: A privacy preserving distributed for mining association rules. Int. Conf. Artif. Intell. Comput. Intell. 294–297 (2009)
Koblitz, N.: A Course in Number Theory and Cryptography, 2nd edn. Springer (1994)
Stallings, W.: Cryptography and network security, 3rd edn. Pearson Education
Yao, A.C.: Protocol for secure computations. In: Proceedings of the 23rd Annual IEEE Symposium on Foundation of Computer Science, pp. 160–164 (1982)
Gold Reich, O., Micali, S., Wigderson, A.: How to play any mental game. In: Proceedings of the 19th Annual ACM Symposium on Theory of Computation, pp. 218–229 (1987)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer India
About this paper
Cite this paper
Kumar, R., Pattnaik, P.K., Sharma, Y. (2016). Privacy Preservation in Distributed Environment Using RSA-CRT. In: Satapathy, S., Raju, K., Mandal, J., Bhateja, V. (eds) Proceedings of the Second International Conference on Computer and Communication Technologies. Advances in Intelligent Systems and Computing, vol 379. Springer, New Delhi. https://doi.org/10.1007/978-81-322-2517-1_4
Download citation
DOI: https://doi.org/10.1007/978-81-322-2517-1_4
Published:
Publisher Name: Springer, New Delhi
Print ISBN: 978-81-322-2516-4
Online ISBN: 978-81-322-2517-1
eBook Packages: EngineeringEngineering (R0)