Design of Communication Networks for Distributed Computation with Privacy Guarantees

• Type: Article in International Conference Proceedings Book
• Date: 2014

Authors

Pequito, S (Author) Other; Kar, S (Author) Other; Sundaram, S (Author) Other; Aguiar, AP (Author) FEUP

Conference proceedings International

Title: Proceedings of the IEEE Conference on Decision and Control

Pages: 1370-1376

2014 53rd IEEE Annual Conference on Decision and Control, CDC 2014

15 December 2014 through 17 December 2014

Indexing

ISI Web of Knowledge - 13 Citations

Scopus - 19 Citations

Other information

Authenticus ID: P-00G-BX4

DOI: 10.1109/cdc.2014.7039593

Abstract (EN): In this paper we address a communication network design problem for distributed computation with privacy guarantees. More precisely, given a possible communication graph between different agents in a network, the objective is to design a protocol, by proper selection of the weights in the dynamics induced by the communication graph, such that 1) weighted average consensus of the initial states of all the agents will be reached; and 2) there are privacy guarantees, where each agent is not able to retrieve the initial states of non-neighbor agents, with the exception of a small subset of agents ( that will be precisely characterized). In this paper, we assume that the network is cooperative, i.e., each agent is passive in the sense that it executes the protocol correctly and does not provide incorrect information to its neighbors, but may try to retrieve the initial states of non-neighbor agents. Furthermore, we assume that each agent knows the communication protocol.

Language: English

Type (Professor's evaluation): Scientific

No. of pages: 7