The DOI matches its Crossref record; 5 of the 5 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.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
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
Graph 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…”
Background
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
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
Differentially Private Distributed Optimization
Huang, Z., Mitra, S., & Vaidya, N. (2015) · Proceedings of the 16th International Conference on Distributed Computing and Networking · doi:10.1145/2684464.2684480 · Cited by 266
Self-citation
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
- 5
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Differentially private iterative synchronous consensus. https://app.cochat.ai/papers/10.1145/2381966.2381978
- The paper
- Huang, Z., Mitra, S., & Dullerud, G. (2012). Differentially private iterative synchronous consensus. Proceedings of the 2012 ACM workshop on Privacy in the electronic society. https://doi.org/10.1145/2381966.2381978
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.
