2019
DOI: 10.1109/access.2019.2960283
|View full text |Cite
|
Sign up to set email alerts
|

Optimizing Query Times for Multiple Users Scenario of Differential Privacy

Abstract: Differential privacy is the state-of-the-art for preserving privacy and differential privacy mechanism based on Laplace distribution with mean 0 is common practice. However, privacy budget is exhausted so quick that the number of queries is not enough. In this paper, a differential privacy mechanism is proposed to optimize the number of queries for application scenario of multiple users. We isolate different users by assigning various noise distribution with non-zero mean to different users. First, in terms of… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
3
2
1

Relationship

1
5

Authors

Journals

citations
Cited by 6 publications
(2 citation statements)
references
References 10 publications
(7 reference statements)
0
2
0
Order By: Relevance
“…Li et al [22] focused on the linear query function based on Laplacian mechanism and proposed a method to determine the upper bound of the number of linear queries from the perspective of information theory. Huang and Zhou [23] proposed a differential privacy mechanism to optimize the number of queries in multi-user scenarios and analyzed the distortion of data distribution and the absolute value of noise in terms of utility. Ye and Alexander [15] studied the minimax estimation problem under the restriction of the discrete distribution in the privacy of differential privacy, under the given conditions, considering the structure ε-privacy level of the optimal problem of the privatization program, minimizing expected estimated losses.…”
Section: Research On the Basicmentioning
confidence: 99%
“…Li et al [22] focused on the linear query function based on Laplacian mechanism and proposed a method to determine the upper bound of the number of linear queries from the perspective of information theory. Huang and Zhou [23] proposed a differential privacy mechanism to optimize the number of queries in multi-user scenarios and analyzed the distortion of data distribution and the absolute value of noise in terms of utility. Ye and Alexander [15] studied the minimax estimation problem under the restriction of the discrete distribution in the privacy of differential privacy, under the given conditions, considering the structure ε-privacy level of the optimal problem of the privatization program, minimizing expected estimated losses.…”
Section: Research On the Basicmentioning
confidence: 99%
“…The second line is related to the extensional conception of sensitivity of differential privacy. There is a difficult tradeoff in differential privacy mechanisms, namely trade-off between magnitude of noise and data utility [7] [10]. In order to reduce the magnitude of noise, various alternative conceptions for sensitivity are proposed such as elastic sensitivity [11] and record sensitivity [9].…”
Section: Related Workmentioning
confidence: 99%