A Survey on Data Anonymization Using Mapreduce on Cloud with Scalable Two-Phase Top-Down Approach
-
2018-04-18 https://doi.org/10.14419/ijet.v7i2.20.14773 -
Data anonymization, top-down specialization, MapReduce, cloud, security conservation. -
Abstract
Endless forces anticipate that customers can cut non-public information like electronic prosperity records for information examination or mining, transferral security issues. Anonymizing instructional accumulations by ways for hypothesis to satisfy bound assurance necessities, parenthetically, k-anonymity may be a for the foremost half used arrangement of security shielding frameworks. At appear, the live of information in varied cloud applications augments massively consistent with the massive information slant, on these lines creating it a take a look at for habitually used programming instruments to confine, supervise, and method such large scale information within an appropriate snuck hobby. during this manner, it's a take a look at for existing anonymization approaches to manage accomplish security preservation on insurance sensitive monumental scale instructive files as a results of their insufficiency of skillfulness. during this paper, we have a tendency to propose a versatile 2 part top-down specialization (TDS) to anonymize broad scale instructive accumulations victimisation the MapReduce structure on cloud. In mboth times of our approach, we have a tendency to advisedly layout a affair of innovative MapReduce occupations to determinedly accomplish the specialization reckoning in an awfully versatile means. wildcat assessment happens demonstrate that with our approach, the flexibleness and adequacy of TDS may be basically redesigned over existing philosophies.
Â
Â
-
References
[1] Chaudhuri S, “What Next?: A Half-Dozen Data Management Research Goals for Big Data and the Cloudâ€, Proc. 31st Symp. Principles of Database Systems, (2012), pp.1-4.
[2] Armbrust M, Fox A, Griffith R, Joseph AD, Katz R, Konwinski A, Lee G, Patterson D, Rabkin A, Stoica I & Zaharia M, “A view of cloud computingâ€, Communications of the ACM, Vol.53, No.4, (2010), pp.50-58.
[3] Wang L, Zhan J, Shi W & Liang Y, “In Cloud, Can Scientific Communities Benefit from the Economies of Scale?â€, IEEE Trans. Parallel and Distributed Systems, Vol.23, No.2, (2012), pp.296-303.
[4] Takabi H, Joshi JBD & Ahn G, “Security and Privacy Challenges in Cloud Computing Environmentsâ€, IEEE Security and Privacy, Vol.8, No.6, (2010), pp.24-31.
[5] Zissis D & Lekkas D, “Addressing Cloud Computing Security Issuesâ€, Future Generation Computer Systems, Vol.28, No.3, (2011), pp.583-592.
[6] Zhang X, Liu C, Nepal S, Pandey S & Chen J, “A Privacy Leakage Upper-Bound Constraint Based Approach for Cost-Effective Privacy Preserving of Intermediate Data Sets in Cloudâ€, IEEE Trans. Parallel and Distributed Systems, (2012).
[7] Hsiao-Ying L & Tzeng WG, “A Secure Erasure Code-Based Cloud Storage System with Secure Data Forwardingâ€, IEEE Trans. Parallel and Distributed Systems, Vol.23, No.6, (2012), pp.995- 1003.
[8] Cao N, Wang C, Li M, Ren K & Lou W, “Privacy-Preserving Multi-Keyword Ranked Search over Encrypted Cloud Dataâ€, Proc. IEEE INFOCOM, (2011), pp.829-837.
[9] Mohan P, Thakurta A, Shi E, Song D & Culler D, “Gupt: Privacy Preserving Data Analysis Made Easyâ€, Proc. ACM SIGMOD Int‟l Conf. Management of Data, (2012), pp.349- 360.
[10] Microsoft Health Vault, http://www.microsoft.com/health/ww/ products/Pages/healthvault.aspx, 2013.
[11] Fung BCM, Wang K, Chen R & Yu PS, “Privacy-Preserving Data Publishing: A Survey of Recent Developmentsâ€, ACM Computing Surveys, Vol.42, No.4, (2010), pp.1-53.
[12] Fung BCM, Wang K & Yu PS, “Anonymizing Classification Data for Privacy Preservationâ€, IEEE Trans. Knowledge and Data Eng., Vol.19, No.5, (2007), pp.711-725.
[13] Xiao X & Tao Y, “Anatomy: Simple and Effective Privacy Preservationâ€, Proc. 32nd Int‟l Conf. Very Large Data Bases, (2006), pp.139-150.
[14] LeFevre K, DeWitt DJ & Ramakrishnan R, “Incognito: Efficient Full-Domain K-Anonymityâ€, Proc. ACM SIGMOD Int‟l Conf. Management of Data, (2005), pp.49-60.
[15] LeFevre K, DeWitt DJ & Ramakrishnan R, “Mondrian Multidimensional K-Anonymityâ€, Proc. 22nd Int‟l Conf. Data Eng., (2006).
[16] Borkar V, Carey MJ & Li C, “Inside „Big Data Management‟: Ogres, Onions, or Parfaits?â€, Proc. 15th Int‟l Conf. Extending Database Technology, (2012), pp.3-14.
[17] LeFevre K, DeWitt DJ & Ramakrishnan R, “Workload-Aware Anonymization Techniques for Large-Scale Data Setsâ€, ACM Trans. Database Systems, Vol.33, No.3, (2008), pp.1-47.
[18] Iwuchukwu T & Naughton JF, “K-Anonymization as Spatial Indexing: Toward Scalable and Incremental Anonymizationâ€, Proc. 33rd Int‟l Conf. Very Large Data Bases, (2007), pp.746- 757.
[19] Dean J & Ghemawat S, “Mapreduce: Simplified Data rocessing on Large Clustersâ€, Comm. ACM, Vol.51, No.1, (2008), pp.107-113.
[20] Mohammed N, Fung B, Hung PCK & Lee CK, “Centralized and Distributed Anonymization for High-Dimensional Healthcare Dataâ€, ACM Trans. Knowledge Discovery from Data, Vol.4, No.4 (2010).
[21] Fung B, Wang K, Wang L & Hung PCK, “Privacy- Preserving Data Publishing for Cluster Analysisâ€, Data and Knowledge Eng., Vol.68, No.6, (2009), pp.552-575.
[22] Mohammed N, Fung BC & Debbabi M, “Anonymity Meets Game Theory: Secure Data Integration with Malicious Participantsâ€, VLDB J., Vol.20, No.4, (2011), pp.567-588.
[23] Sweeney L, “k-Anonymity: A Model for Protecting Privacyâ€, Int‟l J. Uncertainty, Fuzziness and Knowledge-Based Systems, Vol.10, No.5, (2002), pp.557-570.
[24] Jiang W & Clifton C, “A Secure Distributed Framework for Achieving k-Anonymityâ€, VLDB J., Vol.15, No.4, (2006), pp.316-333.
-
Downloads
-
How to Cite
Dhasaratham, M., & P. Singh, R. (2018). A Survey on Data Anonymization Using Mapreduce on Cloud with Scalable Two-Phase Top-Down Approach. International Journal of Engineering & Technology, 7(2.20), 254-259. https://doi.org/10.14419/ijet.v7i2.20.14773Received date: 2018-06-29
Accepted date: 2018-06-29
Published date: 2018-04-18