An Arithmetic Differential Privacy Budget Allocation Method for the Partitioning and Publishing of Location Information

2020 ◽  
Author(s):  
Yan Yan ◽  
Xin Gao ◽  
Adnan Mahmood ◽  
Yang Zhang ◽  
Shuang Wang ◽  
...  
Keyword(s):  
Differential Privacy ◽  
Budget Allocation ◽  
Location Information ◽  
Allocation Method ◽  
Privacy Budget

scholarly journals Generalized and Multiple-Queries-Oriented Privacy Budget Strategies in Differential Privacy via Convergent Series

2021 ◽  
Vol 2021 ◽  
pp. 1-17
Author(s):  
Yunlu Bai ◽  
Geng Yang ◽  
Yang Xiang ◽  
Xuan Wang
Keyword(s):  
High Performance ◽  
Differential Privacy ◽  
Budget Allocation ◽  
Convergent Series ◽  
Multiple Queries ◽  
Analysis Task ◽  
Different Characteristics ◽  
High Degree ◽  
Privacy Budget ◽  
Allocation Strategies

For data analysis with differential privacy, an analysis task usually requires multiple queries to complete, and the total budget needs to be divided into different parts and allocated to each query. However, at present, the budget allocation in differential privacy lacks efficient and general allocation strategies, and most of the research tends to adopt an average or exclusive allocation method. In this paper, we propose two series strategies for budget allocation: the geometric series and the Taylor series. We show the different characteristics of the two series and provide a calculation method for selecting the key parameters. To better reflect a user’s preference of noise during the allocation, we explored the relationship between sensitivity and noise in detail, and, based on this, we propose an optimization for the series strategies. Finally, to prevent collusion attacks and improve security, we provide three ideas for protecting the budget sequence. Both the theoretical analysis and experimental results show that our methods can support more queries and achieve higher utility. This shows that our series allocation strategies have a high degree of flexibility which can meet the user’s need and allow them to be better applied to differentially private algorithms to achieve high performance while maintaining the security.

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 Enabling Location Privacy Preservation in MANETs Based on Distance, Angle, and Spatial Cloaking

Electronics ◽  
2020 ◽  
Vol 9 (3) ◽  
pp. 458
Author(s):  
Nanlan Jiang ◽  
Sai Yang ◽  
Pingping Xu
Keyword(s):  
Privacy Preservation ◽  
Location Privacy ◽  
Differential Privacy ◽  
Geographic Routing ◽  
Base Station ◽  
Wireless Channel ◽  
Location Based Services ◽  
Location Information ◽  
Communication Overhead ◽  
Spatial Cloaking

Preserving the location privacy of users in Mobile Ad hoc Networks (MANETs) is a significant challenge for location information. Most of the conventional Location Privacy Preservation (LPP) methods protect the privacy of the user while sacrificing the capability of retrieval on the server-side, that is, legitimate devices except the user itself cannot retrieve the location in most cases. On the other hand, applications such as geographic routing and location verification require the retrievability of locations on the access point, the base station, or a trusted server. Besides, with the development of networking technology such as caching technology, it is expected that more and more distributed location-based services will be deployed, which results in the risk of leaking location information in the wireless channel. Therefore, preserving location privacy in wireless channels without losing the retrievability of the real location is essential. In this paper, by focusing on the wireless channel, we propose a novel LPP enabled by distance (ranging result), angle, and the idea of spatial cloaking (DSC-LPP) to preserve location privacy in MANETs. DSC-LPP runs without the trusted third party nor the traditional cryptography tools in the line-of-sight environment, and it is suitable for MANETs such as the Internet of Things, even when the communication and computation capabilities of users are limited. Qualitative evaluation indicates that DSC-LPP can reduce the communication overhead when compared with k-anonymity, and the computation overhead of DSC-LPP is limited when compared with conventional cryptography. Meanwhile, the retrievability of DSC-LPP is higher than that of k-anonymity and differential privacy. Simulation results show that with the proper design of spatial divisions and parameters, other legitimate devices in a MANET can correctly retrieve the location of users with a high probability when adopting DSC-LPP.

Optimal Distribution of Privacy Budget in Differential Privacy

2019 ◽  
pp. 222-236
Author(s):  
Anis Bkakria ◽  
Aimilia Tasidou ◽  
Nora Cuppens-Boulahia ◽  
Frédéric Cuppens ◽  
Fatma Bouattour ◽  
...  
Keyword(s):  
Differential Privacy ◽  
Optimal Distribution ◽  
Privacy Budget

scholarly journals Privacy-Preserving Gradient Boosting Decision Trees

2020 ◽  
Vol 34 (01) ◽  
pp. 784-791 ◽  
Author(s):  
Qinbin Li ◽  
Zhaomin Wu ◽  
Zeyi Wen ◽  
Bingsheng He
Keyword(s):  
Machine Learning ◽  
Differential Privacy ◽  
Training Data ◽  
Gradient Boosting ◽  
Training Algorithm ◽  
Model Accuracy ◽  
Machine Learning Model ◽  
Improve Model ◽  
Privacy Budget ◽  
Privacy Level

The Gradient Boosting Decision Tree (GBDT) is a popular machine learning model for various tasks in recent years. In this paper, we study how to improve model accuracy of GBDT while preserving the strong guarantee of differential privacy. Sensitivity and privacy budget are two key design aspects for the effectiveness of differential private models. Existing solutions for GBDT with differential privacy suffer from the significant accuracy loss due to too loose sensitivity bounds and ineffective privacy budget allocations (especially across different trees in the GBDT model). Loose sensitivity bounds lead to more noise to obtain a fixed privacy level. Ineffective privacy budget allocations worsen the accuracy loss especially when the number of trees is large. Therefore, we propose a new GBDT training algorithm that achieves tighter sensitivity bounds and more effective noise allocations. Specifically, by investigating the property of gradient and the contribution of each tree in GBDTs, we propose to adaptively control the gradients of training data for each iteration and leaf node clipping in order to tighten the sensitivity bounds. Furthermore, we design a novel boosting framework to allocate the privacy budget between trees so that the accuracy loss can be further reduced. Our experiments show that our approach can achieve much better model accuracy than other baselines.

scholarly journals An efficient simulation budget allocation method incorporating regression for partitioned domains

Automatica ◽  
2014 ◽  
Vol 50 (5) ◽  
pp. 1391-1400 ◽  
Author(s):  
Mark W. Brantley ◽  
Loo Hay Lee ◽  
Chun-Hung Chen ◽  
Jie Xu
Keyword(s):  
Budget Allocation ◽  
Efficient Simulation ◽  
Allocation Method
Sign in / Sign up

Export Citation Format

Share Document