Abstract
Today Innovative Technology is used to analyze and manipulate huge amount of data in the cloud computing environment. It is very challenging task because the privacy and security are the main issue. Because the scenario of the cloud environment is given, then the distributed database comes in the picture as well as privacy. In this paper, we used the concept of pseudo random number, and for finding the strong Association rule in the database, we used the Inverted hashing and pruning as well as distributing the database into the different number of cloud nodes, and finding the global result, we used Distributed secure sum protocol in the homogenous cloud environments, where the number of attributes will be same, the number of transactions wearies from node to node.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Yao, A.C.: Protocol for secure computations. In: Proceedings of the 23rd annual IEEE symposium on foundation of computer science, pp. 160–164. IEEE Press, Chicago, USA, 1982
Yao, A.C.C.: How to generate and exchange secrets (extended abstract). In: Proceedings of the 27th IEEE Symposium on Foundations of Computer Science (FOCS). IEEE Press USA (1986)
Agrawal, R. et al.: Mining association rules between sets of items in large database. In: Proceedings of ACM SIGMOD’93, pp. 207–216. D.C. ACM Press, Washington (1993)
Li, D.Y., Li, D.R.: Mining association rule with Linuistic cloud model [J]. J. Softw. 2, 143–158 (2000)
Clifton, C., Lin, D.: Tool for privacy preserving distributed data mining [J]. SIGKDD Explorations 2, 28–34 (2002)
Lindell, Y.: Privacy preserving data mining [J]. J. Cryptog. 3, 177–206 (2002)
Chen, X., Orlowska, M.: A new framework for privacy preserving data sharing. In: Proceedings of the 4th IEEE ICDM Workshop: Privacy and Security Aspects of Data Mining, pp. 47–56. IEEE Computer Society (2004)
Mielikainen, T.: On inverse frequent set mining. In: Proceedings 3rd IEEE ICDM Workshop on Privacy Preserving Data Mining, pp. 18–23. IEEE Computer Society (2003)
Du, W., Atallah, M.: Secure Multi-party Computation: A Review and Open Problems. CERIAS Tech. Report 2001-51, Purdue University (2001)
Srikant, R., Agrawal, R.: Mining generalized association rules. In: VLDB’95, pp. 479–488 Zurich, Switzerland, 1994
Agrawal, R., Srikant, R.: Privacy-preserving data mining. In: Proceedings of the 2000 ACM SIGMOD on management of data, pp. 439–450. ACM Press, Dallas, TX USA (2000)
Lindell, Y., Pinkas, B.: Privacy preserving data mining. In: Proceedings of 20th Annual International Cryptology Conference (CRYPTO), Santa Barbara, California, USA (2000)
Clifton, C., Kantarcioglou, M., Xiadong, L., Michaed, Y.Z.: Tools for privacy preserving distributed data mining. SIGKDD Explorations 4(2), 43–48 (2002)
Vaidya, J., Clifton, C.: Privacy-Preserving Decision Trees over vertically partitioned data. Lecture Notes in Computer Science, vol. 3654 (2005)
Ioannidis, I., Grama, A., Atallah, M.: A secure protocol for computing dot-products in clustered and distributed environments. In: Proceedings of International Conference on Parallel Processing, pp. 379–384, 18–21 Aug 2002
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). Hash-Based Rule Mining Algorithm in Data-Intensive Homogeneous Cloud Environment. 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_3
Download citation
DOI: https://doi.org/10.1007/978-81-322-2517-1_3
Published:
Publisher Name: Springer, New Delhi
Print ISBN: 978-81-322-2516-4
Online ISBN: 978-81-322-2517-1
eBook Packages: EngineeringEngineering (R0)