Privacy-Preserving Distributed Average Consensus in Finite Time using Random Gossip
In this paper, we develop and analyze a gossip-based average consensus algorithm that enables all of the components of a distributed system, each with some initial value, to reach (approximate) average consensus on their initial values after executing a finite number of iterations, and without having to reveal the specific value they contribute to the average calculation. We consider a fully-connected (undirected) network in which each pair of components (nodes) can be randomly selected to perform pairwise standard gossip averaging of their values, and propose an enhancement that can be followed by each node that does not want to reveal its initial value to other (curious) nodes. We assume that curious nodes try to identify the initial values of other nodes but do not interfere in the computation in any other way; however, as a worst-case assumption, curious nodes are allowed to collaborate arbitrarily and are assumed to know the privacy-preserving strategy (but not the actual parameters chosen by the nodes that want to preserve their privacy). We characterize precisely conditions on the information exchange that guarantee privacy-preservation for a specific node. The protocol also provides a criterion that allows the nodes to determine, in a distributed manner (while running the enhanced gossip protocol), when to terminate their operation because approximate average consensus has been reached, i.e., all nodes have obtained values that are within a small distance from the exact average of their initial values.
Code (0)
등록된 구현이 없습니다.
Tasks
Privacy PreservingSimilar Papers 제목 키워드 기반
Distributed Optimal Allocation with Quantized Communication and Privacy-Preserving Guarantees
In this paper, we analyze the problem of optimally allocating resources in a distributed and privacy-preserving manner. We propose a novel distributed optimal resource allocation algorithm with privacy-preserving guarant…
Privacy PreservingVector-valued Privacy-Preserving Average Consensus
Achieving average consensus without disclosing sensitive information can be a critical concern for multi-agent coordination. This paper examines privacy-preserving average consensus (PPAC) for vector-valued multi-agent n…
Privacy PreservingPrivacy-Preserving Push-sum Average Consensus via State Decomposition
Average consensus is extensively used in distributed networks for computation and control, where all the agents constantly communicate with each other and update their states in order to reach an agreement. Under a gener…
Privacy PreservingA privacy-preserving distributed credible evidence fusion algorithm for collective decision-making
The theory of evidence reasoning has been applied to collective decision-making in recent years. However, existing distributed evidence fusion methods lead to participants' preference leakage and fusion failures as they …
Decision MakingLow-Rank Matrix CompletionMatrix CompletionPrivacy PreservingFinite Time Privacy Preserving Quantized Average Consensus with Transmission Stopping
Due to their flexibility, battery powered or energy-harvesting wireless networks are employed in diverse applications. Securing data transmissions between wireless devises is of critical importance in order to avoid priv…
Privacy Preserving