Please use this identifier to cite or link to this item:
https://hdl.handle.net/10356/146327
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Wang, Chong Xiao | en_US |
dc.contributor.author | Song, Yang | en_US |
dc.contributor.author | Tay, Wee Peng | en_US |
dc.date.accessioned | 2021-02-09T07:09:00Z | - |
dc.date.available | 2021-02-09T07:09:00Z | - |
dc.date.issued | 2020 | - |
dc.identifier.citation | Wang, C. X., Song, Y., & Tay, W. P. (2020). Arbitrarily strong utility-privacy tradeoff in multi-agent systems. IEEE Transactions on Information Forensics and Security, 16, 671-684. doi:10.1109/TIFS.2020.3016835 | en_US |
dc.identifier.issn | 1556-6013 | en_US |
dc.identifier.uri | https://hdl.handle.net/10356/146327 | - |
dc.description.abstract | Each agent in a network makes a local observation that is linearly related to a set of public and private parameters. The agents send their observations to a fusion center to allow it to estimate the public parameters. To prevent leakage of the private parameters, each agent first sanitizes its local observation using a local privacy mechanism before transmitting it to the fusion center. We investigate the utility privacy tradeoff in terms of the Cramér-Rao lower bounds for estimating the public and private parameters. We study the class of privacy mechanisms given by linear compression and noise perturbation, and derive necessary and sufficient conditions for achieving arbitrarily strong utility privacy tradeoff in a multi-agent system for both the cases where prior information is available and unavailable, respectively. We also provide a method to find the maximum estimation privacy achievable without compromising the utility and propose an alternating algorithm to optimize the utility-privacy tradeoff in the case where arbitrarily strong utility-privacy tradeoff is not achievable. | en_US |
dc.description.sponsorship | Agency for Science, Technology and Research (A*STAR) | en_US |
dc.description.sponsorship | Ministry of Education (MOE) | en_US |
dc.description.sponsorship | National Supercomputing Centre (NSCC) Singapore | en_US |
dc.language.iso | en | en_US |
dc.relation.ispartof | IEEE Transactions on Information Forensics and Security | en_US |
dc.rights | © 2020 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. The published version is available at: https://doi.org/10.1109/TIFS.2020.3016835 | en_US |
dc.subject | Engineering | en_US |
dc.title | Arbitrarily strong utility-privacy tradeoff in multi-agent systems | en_US |
dc.type | Journal Article | en |
dc.contributor.school | School of Electrical and Electronic Engineering | en_US |
dc.contributor.research | Centre for Information Sciences and Systems | en_US |
dc.identifier.doi | 10.1109/TIFS.2020.3016835 | - |
dc.description.version | Accepted version | en_US |
dc.identifier.volume | 16 | en_US |
dc.identifier.spage | 671 | en_US |
dc.identifier.epage | 684 | en_US |
dc.subject.keywords | Inference Privacy | en_US |
dc.subject.keywords | Cramér-Rao Lower Bound | en_US |
dc.description.acknowledgement | This work was supported in part by the Singapore Ministry of Education Academic Research Fund Tier 2 grant MOE2018-T2-2-019 and by A*STAR under its RIE2020 Advanced Manufacturing and Engineering (AME) Industry Alignment Fund – Pre Positioning (IAF-PP) (Grant No. A19D6a0053). The computational work for this article was partially performed on resources of the National Supercomputing Centre, Singapore (https://www.nscc.sg). | en_US |
item.fulltext | With Fulltext | - |
item.grantfulltext | open | - |
Appears in Collections: | EEE Journal Articles |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
ASUP_V18.pdf | 1.26 MB | Adobe PDF | View/Open |
SCOPUSTM
Citations
50
8
Updated on Mar 27, 2024
Web of ScienceTM
Citations
20
7
Updated on Oct 30, 2023
Page view(s)
263
Updated on Mar 27, 2024
Download(s) 50
156
Updated on Mar 27, 2024
Google ScholarTM
Check
Altmetric
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.