Privacy-utility trade-off under continual observation

被引:0
|
作者
Erdogdu, Murat A. [1 ]
Fawaz, Nadia [2 ]
机构
[1] Stanford Univ, Dept Stat, Stanford, CA 94305 USA
[2] Technicolor, Los Altos, CA 94022 USA
关键词
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
In the online setting, a user continuously releases a time-series that is correlated with his private data, to a service provider to derive some utility. Due to correlations, the continual observation of the time-series puts the user at risk of inference attacks against his private data. To protect the user's privacy, the time-series is randomized prior to its release according to a probabilistic privacy mapping. This mapping should be designed in a way that balances privacy and utility requirements over time. First, we formalize the framework for the design of utility-aware privacy mappings for time-series, under both online and batch models. We introduce two threat models, for which we respectively show that under the log-loss cost function, the information leakage can be modeled by the mutual or directed information between the randomized time-series and the private data. Second, we prove that the design of the privacy mapping can be cast as a convex optimization. We provide a sequential online scheme that allows to design privacy mappings at scale, that accounts for privacy risk from the history of released data and future releases to come. Third, we prove the equivalence of the optimal mappings under the batch and the online models, in the case of a Hidden Markov Model. Evaluations on real-world time-series data show that smart-meter data can be randomized to prevent disaggregation of per-device energy consumption, while maintaining the utility of the randomized series.
引用
收藏
页码:1801 / 1805
页数:5
相关论文
共 50 条
  • [41] Differential Privacy Under Continual Observation
    Dwork, Cynthia
    Naor, Moni
    Pitassi, Toniann
    Rothblum, Guy N.
    STOC 2010: PROCEEDINGS OF THE 2010 ACM SYMPOSIUM ON THEORY OF COMPUTING, 2010, : 715 - 724
  • [42] Privacy protection model considering privacy-utility trade-off for data publishing of weighted social networks based on MST-clustering and sub-graph generalization
    Yang, Zong-Chang
    Kuang, Hong
    Liu, Jian-Xun
    INTERNATIONAL JOURNAL OF MODELING SIMULATION AND SCIENTIFIC COMPUTING, 2023, 14 (04)
  • [43] Personalized Privacy-Preserving Federated Learning: Optimized Trade-off Between Utility and Privacy
    Zhou, Jinhao
    Su, Zhou
    Ni, Jianbing
    Wang, Yuntao
    Pan, Yanghe
    Xing, Rui
    2022 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM 2022), 2022, : 4872 - 4877
  • [44] Unified Expression of Utility-Privacy Trade-off in Privacy-Constrained Source Coding
    Shinohara, Naruki
    Yagi, Hideki
    2022 INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY AND ITS APPLICATIONS, ISITA, 2022, : 184 - 188
  • [45] Robust Privacy-Utility Tradeoffs Under Differential Privacy and Hamming Distortion
    Kalantari, Kousha
    Sankar, Lalitha
    Sarwate, Anand D.
    IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, 2018, 13 (11) : 2816 - 2830
  • [46] Privacy and Utility Trade-Off for Textual Analysis via Calibrated Multivariate Perturbations
    Tang, Jingye
    Zhu, Tianqing
    Xiong, Ping
    Wang, Yu
    Ren, Wei
    NETWORK AND SYSTEM SECURITY, NSS 2020, 2020, 12570 : 342 - 353
  • [47] Exploring Machine Learning Privacy/Utility Trade-Off from a Hyperparameters Lens
    Arous, Ayoub
    Guesmi, Amira
    Hanif, Muhammad Abdullah
    Alouani, Ihsen
    Shafique, Muhammad
    2023 INTERNATIONAL JOINT CONFERENCE ON NEURAL NETWORKS, IJCNN, 2023,
  • [48] Data privacy and utility trade-off based on mutual information neural estimator
    Wu, Qihong
    Tang, Jinchuan
    Dang, Shuping
    Chen, Gaojie
    EXPERT SYSTEMS WITH APPLICATIONS, 2022, 207
  • [49] Determining privacy utility trade-off for Online Social Network data publishing
    Srivastava, Agrima
    Geethakumari, G.
    2015 ANNUAL IEEE INDIA CONFERENCE (INDICON), 2015,
  • [50] UTILITY UNCERTAINTY TRADE-OFF STRUCTURES
    NARENS, L
    JOURNAL OF MATHEMATICAL PSYCHOLOGY, 1976, 13 (03) : 296 - 322