Combination of Access Control and De-Identification for Privacy Preserving in Big Data

2016 ◽  
Vol 10 (1) ◽  
pp. 1-27 ◽  
Author(s):  
Amine Rahmani ◽  
Abdelmalek Amine ◽  
Reda Mohamed Hamou

Despite of its emergence and advantages in various domains, big data still suffers from major disadvantages. Timeless, scalability, and privacy are the main problems that hinder the advance of big data. Privacy preserving has become a wide search era within the scientific community. This paper covers the problem of privacy preserving over big data by combining both access control and data de-identification techniques in order to provide a powerful system. The aim of this system is to carry on all big data properties (volume, variety, velocity, veracity, and value) to ensure protection of users' identities. After many experiments and tests, our system shows high efficiency on detecting and hiding personal information while maintaining the utility of useful data. The remainder of this report is addressed in the presentation of some known works over a privacy preserving domain, the introduction of some basic concepts that are used to build our approach, the presentation of our system, and finally the display and discussion of the main results of our experiments.

2019 ◽  
Vol 2019 ◽  
pp. 1-11 ◽  
Author(s):  
Jie Wang ◽  
Hongtao Li ◽  
Feng Guo ◽  
Wenyin Zhang ◽  
Yifeng Cui

As a novel and promising technology for 5G networks, device-to-device (D2D) communication has garnered a significant amount of research interest because of the advantages of rapid sharing and high accuracy on deliveries as well as its variety of applications and services. Big data technology offers unprecedented opportunities and poses a daunting challenge to D2D communication and sharing, where the data often contain private information concerning users or organizations and thus are at risk of being leaked. Privacy preservation is necessary for D2D services but has not been extensively studied. In this paper, we propose an (a, k)-anonymity privacy-preserving framework for D2D big data deployed on MapReduce. Firstly, we provide a framework for the D2D big data sharing and analyze the threat model. Then, we propose an (a, k)-anonymity privacy-preserving framework for D2D big data deployed on MapReduce. In our privacy-preserving framework, we adopt (a, k)-anonymity as privacy-preserving model for D2D big data and use the distributed MapReduce to classify and group data for massive datasets. The results of experiments and theoretical analysis show that our privacy-preserving algorithm deployed on MapReduce is effective for D2D big data privacy protection with less information loss and computing time.


2019 ◽  
Vol 16 (8) ◽  
pp. 3576-3581
Author(s):  
R. Aroul Canessane ◽  
J. Albert Mayan ◽  
R. DhanaLakshmi ◽  
Ragini Singh ◽  
Sushmita Bhowmik

The use of the patient’s information in biomedical research or healthcare research is increasing rapidly. We are using big data to generate and collect a large amount of personal information of patients. The security of patients individual data have turned into an extraordinary threat as it might prompt spillage of delicate data which can put the patient’s protection in danger. There are various measures which have been taken to protect the data from attack. The relevant paper reviews relevant topics in the context of healthcare research. We will discuss the consequences of big data privacy in healthcare research and a better way to improve the data privacy in healthcare research or biomedical research.


Author(s):  
Madhavi Tota

Big Data is very dynamic issues in the current year, enables computing resources as a data to be provided as Information Technology services with high efficiency and effectiveness. The high amount of data in world is growing day by day. Data is growing very rapidly because of use of internet, smart phone and social network. Now size of the data is in Petabyte and Exabyte. Traditional database systems are not able to capture, store and analyze this large amount of data. In the digital and computing world, information is generated and collected at a rate that rapidly exceeds the limits. However, the current scenario the growth rate of such large data creates number of challenges, such as the fast growth of data, access speed, diverse data, and security. This paper shows the fundamental concepts of Big Data. Privacy threats and security methods used in Big Data. With the development of various research application and recourses of Internet/Mobile Internet, social networks, Internet of Things, big data has become the very important topic of research across the world, at the same time, big data has security risks and privacy protection during different stages such as collecting, storing, analyzing and utilizing. This paper introduces security measures of big data, then proposes the technology to solve the security threats.


2018 ◽  
Vol 56 (8) ◽  
pp. 62-67 ◽  
Author(s):  
Miao Du ◽  
Kun Wang ◽  
Yuanfang Chen ◽  
Xiaoyan Wang ◽  
Yanfei Sun

Author(s):  
Shalin Eliabeth S. ◽  
Sarju S.

Big data privacy preservation is one of the most disturbed issues in current industry. Sometimes the data privacy problems never identified when input data is published on cloud environment. Data privacy preservation in hadoop deals in hiding and publishing input dataset to the distributed environment. In this paper investigate the problem of big data anonymization for privacy preservation from the perspectives of scalability and time factor etc. At present, many cloud applications with big data anonymization faces the same kind of problems. For recovering this kind of problems, here introduced a data anonymization algorithm called Two Phase Top-Down Specialization (TPTDS) algorithm that is implemented in hadoop. For the data anonymization-45,222 records of adults information with 15 attribute values was taken as the input big data. With the help of multidimensional anonymization in map reduce framework, here implemented proposed Two-Phase Top-Down Specialization anonymization algorithm in hadoop and it will increases the efficiency on the big data processing system. By conducting experiment in both one dimensional and multidimensional map reduce framework with Two Phase Top-Down Specialization algorithm on hadoop, the better result shown in multidimensional anonymization on input adult dataset. Data sets is generalized in a top-down manner and the better result was shown in multidimensional map reduce framework by the better IGPL values generated by the algorithm. The anonymization was performed with specialization operation on taxonomy tree. The experiment shows that the solutions improves the IGPL values, anonymity parameter and decreases the execution time of big data privacy preservation by compared to the existing algorithm. This experimental result will leads to great application to the distributed environment.


Sign in / Sign up

Export Citation Format

Share Document