Privacy preserving big data publishing: a scalable k‐anonymization approach using MapReduce. Issue 5 (1st October 2017)

• Record Type: Journal Article
• Authors: Mehta, Brijesh B.; Rao, Udai Pratap
• Is Part Of: IET software. Volume 11:Issue 5(2017)
• Page Start: 271
• Page End: 276
• Publication Date: 2017-10-01
• Subjects: Big Data -- data privacy -- parallel processing -- publishing; Big Data -- scalable k-anonymization approach -- MapReduce -- privacy preserving data publishing techniques -- I-diversity -- t-closeness -- data collection -- large crowd effect -- SKA; Computer software -- Periodicals; Software engineering -- Periodicals; 005.1
• DOI: 10.1049/iet-sen.2016.0264
• Languages: English
• ISSNs: 1751-8806

Abstract

Abstract : Big data is collected and processed using different sources and tools that lead to privacy issues. Privacy preserving data publishing techniques such as k ‐anonymity, l ‐diversity, and t ‐closeness are used to de‐identify the data; however, the chances of re‐identification are always remain present since data is collected from multiple sources. Owing to the large volume of data, less generalisation or suppression is required to achieve the same level of privacy, which is also known as 'large crowd effect', although it is always challenging to handle such a large data for anonymization. MapReduce handles large volume of data and distributes the data into the smaller chunks across the multiple nodes; consequently, the full advantage of large volume of data is underachieved. Therefore, scalability of privacy preserving techniques becomes a challenging area of research. The authors explore this area and propose an algorithm named scalable k ‐anonymization (SKA) using MapReduce for privacy preserving big data publishing. The authors also compare the approach with existing approaches that results into a remarkable improvement of the data utility and significantly enhances the performance in terms of running time.