6 citations · 18 across the 6 of their papers we have counts for
6 papers
Differentially Private Distributed Computation via Public-Private Communication Networks
Lei Wang, Yang Liu, Ian Manchester +1
This paper studies the problem of multi-agent computation under the differential privacy requirement of the agents' local datasets against eavesdroppers having node-to-node communi…
Dynamical Privacy in Distributed Computing -- Part I: Privacy Loss and PPSC Mechanism
Yang Liu, Junfeng Wu, Ian R. Manchester +1
A distributed computing protocol consists of three components: (i) Data Localization: a network-wide dataset is decomposed into local datasets separately preserved at a network of…
Network Flows that Solve Least Squares for Linear Equations
Yang Liu, Youcheng Lou, Brian D. O. Anderson +1
This paper presents a first-order {distributed continuous-time algorithm} for computing the least-squares solution to a linear equation over networks. Given the uniqueness of the s…
Dynamical Privacy in Distributed Computing -- Part II: PPSC Gossip Algorithms
Yang Liu, Junfeng Wu, Ian Manchester +1
In the first part of the paper, we have studied the computational privacy risks in distributed computing protocols against local or global dynamics eavesdroppers, and proposed a Pr…
Clique Gossiping
Yang Liu, Bo Li, Brian Anderson +1
This paper proposes and investigates a framework for clique gossip protocols. As complete subnetworks, the existence of cliques is ubiquitous in various social, computer, and engin…
An Arrow-Hurwicz-Uzawa Type Flow as Least Squares Solver for Network Linear Equations
Yang Liu, Christian Lageman, Brian D. O. Anderson +1
We study the approach to obtaining least squares solutions to systems of linear algebraic equations over networks by using distributed algorithms. Each node has access to one of th…