scholarly journals Non-Global Privacy Protection Facing Sensitive Areas in Face Images

2021 ◽  
Vol 38 (6) ◽  
pp. 1677-1687
Author(s):  
Chao Liu ◽  
Jing Yang ◽  
Yining Zhang ◽  
Xuan Zhang ◽  
Weinan Zhao ◽  
...  
Keyword(s):  
Privacy Protection ◽  
Differential Privacy ◽  
Total Error ◽  
Regional Growth ◽  
Sensitive Area ◽  
Image Size ◽  
Personal Privacy ◽  
Sensitive Areas ◽  
Face Images ◽  
Protection Method

Face images, as an information carrier, are naturally weak in privacy. If they are collected and analyzed by malicious third parties, personal privacy will leak, and many other unmeasurable losses will occur. Differential privacy protection of face images is mainly being studied under non-interactive frameworks. However, the ε-effect impacts the entire image under these frameworks. Besides, the noise influence is uniform across the protected image, during the realization of the Laplace mechanism. The differential privacy of face images under interactive mechanisms can protect the privacy of different areas to different degrees, but the total error is still constrained by the image size. To solve the problem, this paper proposes a non-global privacy protection method for sensitive areas in face images, known as differential privacy of landmark positioning (DPLP). The proposed algorithm is realized as follows: Firstly, the active shape model (ASM) algorithm was adopted to position the area of each face landmark. If the landmark overlaps a subgraph of the original image, then the subgraph would be taken as a sensitive area. Then, the sensitive area was treated as the seed for regional growth, following the fusion similarity measurement mechanism (FSMM). In our method, the privacy budget is only allocated to the seed; whether any other insensitive area would be protected depends on whether the area exists in a growing region. In addition, when a subgraph meets the criterion for merging with multiple seeds, the most reasonable seed to be merged would be selected by the exponential mechanism. Experimental results show that the DPLP algorithm satisfies ε-differential privacy, its total error does not change with image size, and the noisy image remains highly available.

Personalized Trajectory Privacy Protection Method Based on User-Requirement

2018 ◽  
Vol 27 (03) ◽  
pp. 1850006 ◽  
Author(s):  
Zhaowei Hu ◽  
Jing Yang ◽  
Jianpei Zhang
Keyword(s):  
Privacy Protection ◽  
Real Life ◽  
Manhattan Distance ◽  
Protective Effects ◽  
Personal Privacy ◽  
Trajectory Data ◽  
Data Utilization ◽  
Time Intervals ◽  
User Requirement ◽  
Protection Method

Trajectory data often provides useful information that can be utilized in real-life applications, such as traffic planning and location-based advertising. Because people’s trajectory information can result in serious personal privacy leakage, trajectory privacy protection methods are employed. However, existing methods assume and use the same privacy requirements for all trajectories, which affect privacy protection efficiency and data utilization. This paper proposes a trajectory privacy protection method based on user requirement. By dividing different time intervals, it sets different privacy protection parameters for different trajectories to provide more detailed privacy protection. The proposed method utilizes the divided time intervals and privacy protection requirements to form a privacy requirement matrix, to construct an anonymous trajectory equivalence class and undirected graph. Then, trajectories are processed to form anonymous sets. Euclidean distance is also replaced with Manhattan distance in calculating the distance of the trajectories, which would improve the privacy protection and data utility and narrow the gap between the theoretical privacy protection and the actual protective effects. Comparative experiments demonstrate that the proposed method outperforms other similar methods in regards to both privacy protection and data utilization.

scholarly journals A trajectory data publishing algorithm satisfying local suppression

2021 ◽  
Vol 17 (2) ◽  
pp. 155014772199340
Author(s):  
Xiaohui Li ◽  
Yuliang Bai ◽  
Yajun Wang ◽  
Bo Li
Keyword(s):  
Privacy Protection ◽  
Loss Rate ◽  
Differential Privacy ◽  
Classification Tree ◽  
Data Availability ◽  
Trajectory Data ◽  
User Privacy ◽  
Data Set ◽  
Privacy Leakage ◽  
Protection Method

Suppressing the trajectory data to be released can effectively reduce the risk of user privacy leakage. However, the global suppression of the data set to meet the traditional privacy model method reduces the availability of trajectory data. Therefore, we propose a trajectory data differential privacy protection algorithm based on local suppression Trajectory privacy protection based on local suppression (TPLS) to provide the user with the ability and flexibility of protecting data through local suppression. The main contributions of this article include as follows: (1) introducing privacy protection method in trajectory data release, (2) performing effective local suppression judgment on the points in the minimum violation sequence of the trajectory data set, and (3) proposing a differential privacy protection algorithm based on local suppression. In the algorithm, we achieve the purpose Maximal frequent sequence (MFS) sequence loss rate in the trajectory data set by effective local inhibition judgment and updating the minimum violation sequence set, and then establish a classification tree and add noise to the leaf nodes to improve the security of the data to be published. Simulation results show that the proposed algorithm is effective, which can reduce the data loss rate and improve data availability while reducing the risk of user privacy leakage.

scholarly journals Location recommendation privacy protection method based on location sensitivity division

2019 ◽  
Vol 2019 (1) ◽  
Author(s):  
Chunyong Yin ◽  
Xiaokang Ju ◽  
Zhichao Yin ◽  
Jin Wang
Keyword(s):  
Service Quality ◽  
Privacy Protection ◽  
Location Privacy ◽  
Differential Privacy ◽  
Experimental Results ◽  
Location Information ◽  
Location Recommendation ◽  
Protection Method ◽  
Privacy Budget ◽  
The Impact

AbstractLocation-based recommendation services can provide users with convenient services, but this requires monitoring and collecting a large amount of location information. In order to prevent location information from being leaked after monitoring and collection, location privacy must be effectively protected. Therefore, this paper proposes a privacy protection method based on location sensitivity for location recommendation. This method uses location trajectories and check-in frequencies to set a threshold so as to classify location sensitivity levels. The corresponding privacy budget is then assigned based on the sensitivity to add Laplace noise that satisfies the differential privacy. Experimental results show that this method can effectively protect the user’s location privacy and reduce the impact of differential privacy noise on service quality.

scholarly journals Noise-added selection method for location-based service using differential privacy in Internet of Things

2019 ◽  
Vol 11 (1) ◽  
pp. 168781401882239 ◽  
Author(s):  
Zhimin Li ◽  
Haoze Lv ◽  
Zhaobin Liu
Keyword(s):  
Big Data ◽  
Internet Of Things ◽  
Privacy Protection ◽  
Location Privacy ◽  
Differential Privacy ◽  
Poor Performance ◽  
Data Availability ◽  
Location Information ◽  
Location Based Service ◽  
Protection Method

With the development of Internet of Things, many applications need to use people’s location information, resulting in a large amount of data need to be processed, called big data. In recent years, people propose many methods to protect privacy in the location-based service aspect. However, existing technologies have poor performance in big data area. For instance, sensor equipments such as smart phones with location record function may submit location information anytime and anywhere which may lead to privacy disclosure. Attackers can leverage huge data to achieve useful information. In this article, we propose noise-added selection algorithm, a location privacy protection method that satisfies differential privacy to prevent the data from privacy disclosure by attacker with arbitrary background knowledge. In view of Internet of Things, we maximize the availability of data and algorithm when protecting the information. In detail, we filter real-time location distribution information, use our selection mechanism for comparison and analysis to determine privacy-protected regions, and then perform differential privacy on them. As shown in the theoretical analysis and the experimental results, the proposed method can achieve significant improvements in security, privacy, and complete a perfect balance between privacy protection level and data availability.

scholarly journals A Trajectory Privacy Protection Method Based on Random Sampling Differential Privacy

2021 ◽  
Vol 10 (7) ◽  
pp. 454
Author(s):  
Tinghuai Ma ◽  
Fagen Song
Keyword(s):  
Random Sampling ◽  
Privacy Protection ◽  
Differential Privacy ◽  
Traffic Monitoring ◽  
City Management ◽  
Trajectory Data ◽  
Privacy Concerns ◽  
Protection Method ◽  
Real World Datasets ◽  
Parameter Values

With the popularity of location-aware devices (e.g., smart phones), a large number of trajectory data were collected. The trajectory dataset can be used in many fields including traffic monitoring, market analysis, city management, etc. The collection and release of trajectory data will raise serious privacy concerns for users. If users’ privacy is not protected enough, they will refuse to share their trajectory data. In this paper, a new trajectory privacy protection method based on random sampling differential privacy (TPRSDP), which can provide more security protection, is proposed. Compared with other methods, it takes less time to run this method. Experiments are conducted on two real world datasets to validate the proposed scheme, and the results are compared with others in terms of running time and information loss. The performance of the scheme with different parameter values is verified. The setting of the new scheme parameters is discussed in detail, and some valuable suggestions are given.

Data privacy protection technology of wearable-devices

2020 ◽  
pp. 1-8
Author(s):  
Shuangxia Tang ◽  
Kunquan Shi
Keyword(s):  
Privacy Protection ◽  
Data Privacy ◽  
Differential Privacy ◽  
Information Leakage ◽  
Wearable Devices ◽  
Security And Privacy ◽  
Information Distortion ◽  
Protection Method ◽  
User Data ◽  
Property Losses

Wearable-devices have developed rapidly. Meanwhile, the security and privacy protection of user data has also occurred frequently. Aiming at the process of privacy protection of wearable-device data release, based on the conventional V-MDAV algorithm, this paper proposes a WSV-MDAV micro accumulation method based on weight W and susceptible attribute value sensitivity parameter S and introduces differential-privacy after micro accumulation operating. By simulating the Starlog dataset and the Adult dataset, the results show that, compared with the conventional multi-variable variable-length algorithm, the privacy protection method proposed in this paper has improved the privacy protection level of related devices, and the information distortion has been properly resolved. The construction of the release model can prevent susceptible data with identity tags from being tampered with, stolen, and leaked by criminals. It can avoid causing great spiritual and property losses to individuals, and avoid harming public safety caused by information leakage.

scholarly journals Differential Privacy Protection of Face Images Based on Region Growing

2021 ◽  
Vol 38 (5) ◽  
pp. 1385-1401
Author(s):  
Chao Liu ◽  
Jing Yang ◽  
Weinan Zhao ◽  
Yining Zhang ◽  
Cuiping Shi ◽  
...  
Keyword(s):  
Privacy Protection ◽  
Differential Privacy ◽  
Region Growing ◽  
Sensitive Information ◽  
Contrast Structure ◽  
Seed Point ◽  
Face Images ◽  
Measurement Mechanism ◽  
Privacy Budget ◽  
Denoised Image

Face images, as an information carrier, are rich in sensitive information. Direct publication of these images would cause privacy leak, due to their natural weak privacy. Most of the existing privacy protection methods for face images adopt data publication under a non-interactive framework. However, the E-effect under this framework covers the entire image, such that the noise influence is uniform across the image. To solve the problem, this paper proposes region growing publication (RGP), an algorithm for the interactive publication of face images under differential privacy. This innovative algorithm combines the region growing technique with differential privacy technique. The privacy budget E is dynamically allocated, and the Laplace noise is added, according to the similarity between adjacent sub-images. To measure this similarity more effectively, the fusion similarity measurement mechanism (FSMM) was designed, which better adapts to the intrinsic attributes of images. Different from traditional region growing rules, the FSMM fully considers various attributes of images, including brightness, contrast, structure, color, texture, and spatial distribution. To further enhance algorithm feasibility, RGP was extended to atypical region growing publication (ARGP). While RGP limits the region growing direction between adjacent sub-images, ARGP searches for the qualified sub-images across the image, with the aid of the exponential mechanism, thereby expanding the region merging scope of the seed point. The results show that our algorithm can satisfy E-differential privacy, and the denoised image still have a high availability.

scholarly journals Face Image Publication Based on Differential Privacy

2021 ◽  
Vol 2021 ◽  
pp. 1-20
Author(s):  
Chao Liu ◽  
Jing Yang ◽  
Weinan Zhao ◽  
Yining Zhang ◽  
Jingyou Li ◽  
...  
Keyword(s):  
Privacy Protection ◽  
Data Stream ◽  
Differential Privacy ◽  
Sliding Window ◽  
Data Encryption ◽  
Face Image ◽  
Dynamic Allocation ◽  
Face Images ◽  
Privacy Budget ◽  
The Impact

As an information carrier, face images contain abundant sensitive information. Due to its natural weak privacy, direct publishing may divulge privacy. Anonymization Technology and Data Encryption Technology are limited by the background knowledge and attack means of attackers, which cannot completely content the needs of face image privacy protection. Therefore, this paper proposes a face image publishing SWP (sliding window publication) algorithm, which satisfies the differential privacy. Firstly, the SWP translates the image gray matrix into a one-dimensional ordered data stream by using image segmentation technology. The purpose of this step is to transform the image privacy protection problem into the data stream privacy protection problem. Then, the sliding window model is used to model the data flow. By comparing the similarity of data in adjacent sliding windows, the privacy budget is dynamically allocated, and Laplace noise is added. In SWP, the data in the sliding window comes from the image. To present the image features contained in the data more comprehensively and use the privacy budget more reasonably, this paper proposes a fusion similarity measurement EM (exact mechanism) mechanism and a dynamic privacy budget allocation DA (dynamic allocation) mechanism. Also, for further improving the usability of human face images and reducing the impact of noise, a sort-SWP algorithm based on the SWP method is proposed in the paper. Through the analysis, it can be seen that ordered input can further improve the usability of the SWP algorithm, but direct sorting of data will destroy the ε -differential privacy. Therefore, this paper proposes a sorting method-SAS method, which satisfies the ε -differential privacy; SAS obtain an initial sort by using an exponential mechanism firstly. And then an approximate correct sort is obtained by using the Annealing algorithm to optimize the initial sort. Compared with LAP algorithm and SWP algorithm, the average accuracy rate of sort-SWP algorithm in ORL, Yale is increased by 56.63% and 21.55%, the recall rate is increased by 6.85% and 3.32%, and F1-sroce is improved by 55.62% and 16.55%.

Sign in / Sign up

Export Citation Format

Share Document