Privacy-Preserving Distributed Processing: Metrics, Bounds and Algorithms

Privacy-preserving distributed processing has recently attracted considerable attention. It aims to design solutions for conducting signal processing tasks over networks in a decentralized fashion without violating privacy. Many existing algorithms can be adopted to solve this problem such as differ...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on information forensics and security Ročník 16; s. 2090 - 2103
Hlavní autoři: Li, Qiongxiu, Gundersen, Jaron Skovsted, Heusdens, Richard, Christensen, Mads Grasboll
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York IEEE 2021
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
Algorithms
consensus
Context
differential privacy
Distributed databases
Distributed processing
Eavesdropping
information-theoretic
Lower bounds
Measurement
Mutual information
Optimization
Perturbation
Privacy
privacy-utility metric
secure multiparty computation
Signal processing
Signal processing algorithms
subspace perturbation
ISSN:1556-6013, 1556-6021
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Privacy-preserving distributed processing has recently attracted considerable attention. It aims to design solutions for conducting signal processing tasks over networks in a decentralized fashion without violating privacy. Many existing algorithms can be adopted to solve this problem such as differential privacy, secure multiparty computation, and the recently proposed distributed optimization based subspace perturbation algorithms. However, since each of them is derived from a different context and has different metrics and assumptions, it is hard to choose or design an appropriate algorithm in the context of distributed processing. In order to address this problem, we first propose general mutual information based information-theoretical metrics that are able to compare and relate these existing algorithms in terms of two key aspects: output utility and individual privacy. We consider two widely-used adversary models, the passive and eavesdropping adversary. Moreover, we derive a lower bound on individual privacy which helps to understand the nature of the problem and provides insights on which algorithm is preferred given different conditions. To validate the above claims, we investigate a concrete example and compare a number of state-of-the-art approaches in terms of the concerned aspects using not only theoretical analysis but also numerical validation. Finally, we discuss and provide principles for designing appropriate algorithms for different applications.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1556-6013
1556-6021
DOI:10.1109/TIFS.2021.3050064