Ensuring privacy with constrained additive noise by minimizing Fisher information

被引:36
作者
Farokhi, Farhad [1 ,2 ]
Sandberg, Henrik [3 ]
机构
[1] CSIROs Data61, Canberra, ACT, Australia
[2] Univ Melbourne, Dept Elect & Elect Engn, Melbourne, Vic, Australia
[3] KTH Royal Inst Technol, Dept Automat Control, Stockholm, Sweden
关键词
Privacy; Additive constrained noise; Fisher information; DIFFERENTIAL PRIVACY; CONVEX-OPTIMIZATION; MECHANISM; SECURITY; TRADEOFF;
D O I
10.1016/j.automatica.2018.10.012
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The problem of preserving the privacy of individual entries of a database when responding to linear or nonlinear queries with constrained additive noise is considered. For privacy protection, the response to the query is systematically corrupted with an additive random noise whose support is a subset or equal to a pre-defined constraint set. A measure of privacy using the inverse of the trace of the Fisher information matrix is developed. The Cramer-Rao bound relates the variance of any estimator of the database entries to the introduced privacy measure. The probability density that minimizes the trace of the Fisher information (as a proxy for maximizing the measure of privacy) is computed. An extension to dynamic problems is also presented. Finally, the results are compared to the differential privacy methodology. Crown Copyright (C) 2018 Published by Elsevier Ltd. All rights reserved.
引用
收藏
页码:275 / 288
页数:14
相关论文
共 62 条
[1]  
Akyol E, 2015, IEEE DECIS CONTR P, P4511, DOI 10.1109/CDC.2015.7402924
[2]  
Alvim M. S., 2011, INT WORKSH FORM ASP, P39
[3]  
ANDERSON H, 1977, SCAND J STAT, V4, P11
[4]  
[Anonymous], MATH SCI ENG
[5]  
[Anonymous], 2015, IEEE DECIS CONTR P
[6]  
[Anonymous], ARXIV180809565MATHOC
[7]  
[Anonymous], 2011, ENCY CRYPTOGRAPHY SE
[8]  
[Anonymous], TEXTS APPL MATH MATH
[9]  
[Anonymous], 2005, APPL ANAL
[10]  
[Anonymous], 1997, PRINCETON LANDMARKS