The DOI matches its Crossref record; 33 of the 33 references it cites were found in a registry or an index.
Differentially private iterative synchronous consensus
Open accessAbstract
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Consensus and Cooperation in Networked Multi-Agent Systems
Olfati-Saber, R., Fax, J. A., & Murray, R. M. (2007) · Proceedings of the IEEE · doi:10.1109/jproc.2006.887293 · Cited by 10,522 · cited 1×
“More general necessary and sufficient conditions for achieving consensus with synchronous mechanisms, including cases where the matrix P is timevarying, have been studied in [28, 23] (see the book for a complete overview [20]).”
BackgroundCoordination of groups of mobile autonomous agents using nearest neighbor rules
Jadbabaie, A., Lin, J., & Morse, A. S. (2003) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2003.812781 · Cited by 8,339
Calibrating Noise to Sensitivity in Private Data Analysis
Dwork, C., McSherry, F., Nissim, K., & Smith, A. (2006) · Lecture Notes in Computer Science · doi:10.1007/11681878_14 · Cited by 7,272
Parallel and Distributed Computation: Numerical Methods
Bertsekas, D. P., & Tsitsiklis, J. N. (1989) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 5,293
Dwork, C. (2006) · Lecture Notes in Computer Science · doi:10.1007/11787006_1 · Cited by 5,291
Differential Privacy: A Survey of Results
Dwork, C. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-79228-4_1 · Cited by 3,542 · cited 1×
“The notion of privacy used in this paper is derived from the idea of differential privacy introduced in the context of “one-shot” computations on statistical databases [9] (see [10] for a survey).”
BackgroundGraph Theoretic Methods in Multiagent Networks
Mesbahi, M., & Egerstedt, M. (2010) · Princeton University Press eBooks · doi:10.1515/9781400835355 · Cited by 2,897 · cited 1×
“ry and sucient conditions for achieving consensus with synchronous mechanisms, including cases where the matrix P is time-varying, have been studied in [21, 17] (see the book for a complete overview [14]). Sucient conditions for achieving consensus with message delays and losses has been developed in [22, 3] and more…”
BackgroundFlocking in Fixed and Switching Networks
Tanner, H. G., Jadbabaie, A., & Pappas, G. J. (2007) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2007.895948 · Cited by 1,431
PROBLEMS IN DECENTRALIZED DECISION MAKING AND COMPUTATION
Τσιτσικλής, Ι. (2014) · doi:10.12681/eadd/3778 · Cited by 1,278
A scheme for robust distributed sensor fusion based on average consensus
Xiao, L., Boyd, S., & Lall, S. (2005) · doi:10.5555/1147685.1147698 · Cited by 1,170
Distributed average consensus with least-mean-square deviation
Xiao, L., Boyd, S., & Kim, S.-J. (2007) · Journal of Parallel and Distributed Computing · doi:10.1016/j.jpdc.2006.08.010 · Cited by 1,107
Dynamic load balancing for distributed memory multiprocessors
Cybenko, G. (1989) · Journal of Parallel and Distributed Computing · doi:10.1016/0743-7315(89)90021-x · Cited by 997
Convergence in Multiagent Coordination, Consensus, and Flocking
Blondel, V. D., Hendrickx, J. M., Olshevsky, A., & Tsitsiklis, J. N. (2006) · Proceedings of the 44th IEEE Conference on Decision and Control · doi:10.1109/cdc.2005.1582620 · Cited by 859
Differential privacy under continual observation
Dwork, C., Naor, M., Pitassi, T., & Rothblum, G. N. (2010) · Proceedings of the forty-second ACM symposium on Theory of computing · doi:10.1145/1806689.1806787 · Cited by 583
Huang, M., & Manton, J. H. (2009) · SIAM Journal on Control and Optimization · doi:10.1137/06067359x · Cited by 401
Differentially Private Filtering
Le Ny, J., & Pappas, G. J. (2014) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2013.2283096 · Cited by 341
On the geometry of differential privacy
Hardt, M., & Talwar, K. (2010) · Proceedings of the forty-second ACM symposium on Theory of computing · doi:10.1145/1806689.1806786 · Cited by 314
Flocking with obstacle avoidance: cooperation with limited communication in mobile networks
Saber, R. O., & Murray, R. M. (2004) · 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475) · doi:10.1109/cdc.2003.1272912 · Cited by 310
Problems in Decentralized Decision making and Computation.
Tsitsiklis, J. N. (1984) · Defense Technical Information Center (DTIC) · Cited by 288
Distance makes the types grow stronger: a calculus for differential privacy
Reed, J., & Pierce, B. C. (2010) · Proceedings of the 15th ACM SIGPLAN international conference on Functional programming · doi:10.1145/1863543.1863568 · Cited by 214
Differentially private filtering
Le Ny, J., & Pappas, G. J. (2012) · 2012 IEEE 51st IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2012.6426355 · Cited by 188
PoolView: stream privacy for grassroots participatory sensing
Ganti, R. K., Pham, N., Tsai, Y.-E., & Abdelzaher, T. F. (2008) · Proceedings of the 6th ACM conference on Embedded network sensor systems · doi:10.1145/1460412.1460440 · Cited by 171
Probabilistic relational reasoning for differential privacy
Barthe, G., Köpf, B., Olmedo, F., & Zanella-Béguelin, S. (2012) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/2103656.2103670 · Cited by 131
Privacy-Preserving Methods for Sharing Financial Risk Exposures
Abbe, E. A., Khandani, A. E., & Lo, A. W. (2012) · American Economic Review · doi:10.1257/aer.102.3.65 · Cited by 111
Distributed Kalman Filtering and Sensor Fusion in Sensor Networks
Olfati‐Saber, R. (2006) · Springer eBooks · doi:10.1007/11533382_10 · Cited by 78
P4P: practical large-scale privacy-preserving distributed computation robust against malicious users
Duan, Y., Canny, J., & Zhan, J. (2010) · Cited by 57
Formal Verification of Differential Privacy for Interactive Systems (Extended Abstract)
Tschantz, M. C., Kaynar, D., & Datta, A. (2011) · Electronic Notes in Theoretical Computer Science · doi:10.1016/j.entcs.2011.09.015 · Cited by 55
Preserving data privacy in outsourcing data aggregation services
Xiong, L., Chitti, S., & Liu, L. (2007) · ACM Transactions on Internet Technology · doi:10.1145/1275505.1275510 · Cited by 55
On the stability of asynchronous iterative processes
Tsitsiklis, J. N. (1987) · Theory of Computing Systems · doi:10.1007/bf01692062 · Cited by 44
Flocking with Obstacle Avoidance
Saber, R. O. (2003) · doi:10.21236/ada465112 · Cited by 37
Differentially private Kalman filtering
Ny, J. L., & Pappas, G. J. (2012) · Allerton Conference on Communication, Control, and Computing · doi:10.1109/allerton.2012.6483414 · Cited by 27
Convergence Verification: From Shared Memory to Partially Synchronous Systems
Chandy, K. M., Mitra, S., & Pilotto, C. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-85778-5_16 · Cited by 13
Self-citationSafe Flocking in Spite of Actuator Faults using Directional Failure Detectors
Johnson, T. T., & Mitra, S. (2011) · Cited by 10
Self-citation
Cited by
Privacy Preserving Average Consensus
Mo, Y., & Murray, R. M. (2017) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2016.2564339 · Cited by 521
Secure and Privacy-Preserving Consensus
Ruan, M., Gao, H., & Wang, Y. (2019) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2019.2890887 · Cited by 347
Differentially Private Filtering
Le Ny, J., & Pappas, G. J. (2014) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2013.2283096 · Cited by 341
Differentially private average consensus: Obstructions, trade-offs, and optimal algorithm design
Nozari, E., Tallapragada, P., & Cortés, J. (2017) · Automatica · doi:10.1016/j.automatica.2017.03.016 · Cited by 334
Privacy-Preserving Average Consensus via State Decomposition
Wang, Y. (2019) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2019.2902731 · Cited by 334
Metadata
- Authors
- Huang, Z., Mitra, S., & Dullerud, G.
- Venue
- Proceedings of the 2012 ACM workshop on Privacy in the electronic society
- Publisher
- ACM
- Published
- 2012-10-15
- Pages
- 81-90
- OpenAlex
- W2096241946
- Cited by
- 280
- References
- 33
- FWCI
- 3.77
- Type
- conference paper
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.