Parallel and distributed computation: numerical methods
Parallel and distributed computation: numerical methods
Dynamic load balancing for distributed memory multiprocessors
Journal of Parallel and Distributed Computing
An Upper Bound on the Diameter of a Graph from Eigenvalues Associated with its Laplacian
SIAM Journal on Discrete Mathematics
A scheme for robust distributed sensor fusion based on average consensus
IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
Distributed average consensus with least-mean-square deviation
Journal of Parallel and Distributed Computing
Preserving data privacy in outsourcing data aggregation services
ACM Transactions on Internet Technology (TOIT) - Special Issue on the Internet and Outsourcing
Convergence Verification: From Shared Memory to Partially Synchronous Systems
FORMATS '08 Proceedings of the 6th international conference on Formal Modeling and Analysis of Timed Systems
A Formalized Theory for Verifying Stability and Convergence of Automata in PVS
TPHOLs '08 Proceedings of the 21st International Conference on Theorem Proving in Higher Order Logics
PoolView: stream privacy for grassroots participatory sensing
Proceedings of the 6th ACM conference on Embedded network sensor systems
SIAM Journal on Control and Optimization
Differential privacy: a survey of results
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
On the geometry of differential privacy
Proceedings of the forty-second ACM symposium on Theory of computing
Differential privacy under continual observation
Proceedings of the forty-second ACM symposium on Theory of computing
Distance makes the types grow stronger: a calculus for differential privacy
Proceedings of the 15th ACM SIGPLAN international conference on Functional programming
P4P: practical large-scale privacy-preserving distributed computation robust against malicious users
USENIX Security'10 Proceedings of the 19th USENIX conference on Security
Formal Verification of Differential Privacy for Interactive Systems (Extended Abstract)
Electronic Notes in Theoretical Computer Science (ENTCS)
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Probabilistic relational reasoning for differential privacy
POPL '12 Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Calibrating noise to sensitivity in private data analysis
TCC'06 Proceedings of the Third conference on Theory of Cryptography
| Hi-index | 0.00 |
The iterative consensus problem requires a set of processes or agents with different initial values, to interact and update their states to eventually converge to a common value. Protocols solving iterative consensus serve as building blocks in a variety of systems where distributed coordination is required for load balancing, data aggregation, sensor fusion, filtering, and synchronization. In this paper, we introduce the private iterative consensus problem where agents are required to converge while protecting the privacy of their initial values from honest but curious adversaries. Protecting the initial states, in many applications, suffice to protect all subsequent states of the individual participants. We adapt the notion of differential privacy in this setting of iterative computation. Next, we present (i) a server-based and (ii) a completely distributed randomized mechanism for solving differentially private iterative consensus with adversaries who can observe the messages as well as the internal states of the server and a subset of the clients. Our analysis establishes the tradeoff between privacy and the accuracy: for given ε, b 0, the ε-differentially private mechanism for N agents, is guaranteed to convergence to a value within O(⁄1/ε √bN) of the average of the initial values, with probability at least (1-b).