On Binary Decomposition Based Privacy-Preserving Aggregation Schemes in Real-Time Monitoring Systems
The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Abstract
In real-time monitoring systems, fine-grained measurements would pose great privacy threats to the participants as real-time measurements could disclose accurate people-centric activities. Differential privacy has been proposed to formalize and guide the design of privacy-preserving schemes. Nonetheless, due to the correlations and high fluctuations in time-series data, it is hard to achieve an effective privacy and utility tradeoff by differential privacy mechanisms. To address this issue, in this paper, we first proposed novel multi-dimensional decomposition based schemes to compress the noise and enhance the utility in differential privacy. The key idea is to decompose the measurements into multi-dimensional records and to achieve differential privacy in bounded dimensions so that the error caused by unbounded measurements can be significantly reduced. We then extended our developed scheme and developed a binary decomposition scheme for privacy-preserving time-series aggregation in real-time monitoring systems. Through a combination of extensive theoretical analysis and experiments, our data shows that our proposed schemes can effectively improve usability while achieving the same level of differential privacy than existing schemes.
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
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×
“Dwork [57] proposed a cascading counter algorithm, which adaptively updates the output according to the frequency of 10s in the stream of 0; 1 .”
Robust De-anonymization of Large Sparse Datasets
Narayanan, A., & Shmatikov, V. (2008) · 2008 IEEE Symposium on Security and Privacy (sp 2008) · doi:10.1109/sp.2008.33 · Cited by 2,372 · cited 1×
“Nonetheless, without careful design, anonymity schemes may suffer from linkage attacks [28].”
A survey of mobile phone sensing
Lane, N., Miluzzo, E., Lu, H., Peebles, D., Choudhury, T., & Campbell, A. (2010) · IEEE Communications Magazine · doi:10.1109/mcom.2010.5560598 · Cited by 2,292
RAPPOR: Randomized Aggregatable Privacy-Preserving Ordinal Response
Erlingsson, Ú., Pihur, V., & Korolova, A. (2014) · Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/2660267.2660348 · Cited by 1,838
The composition theorem for differential privacy
Kairouz, P., Oh, S., & Viswanath, P. (2017) · IEEE Transactions on Information Theory · doi:10.1109/tit.2017.2685505 · Cited by 408 · cited 2×
“Although Kairouz [53] gave amuch tighter bound on the privacy bugdet, their work still showed the overall degradation is inevitable with the increase of query number.”
Cited by
Lin, J., Yu, W., Zhang, N., Yang, X., Zhang, H., & Zhao, W. (2017) · IEEE Internet of Things Journal · doi:10.1109/jiot.2017.2683200 · Cited by 2,793
Self-citationA Survey on the Edge Computing for the Internet of Things
Yu, W., Liang, F., He, X., Hatcher, W. G., Lu, C., Lin, J., & Yang, X. (2018) · IEEE Access · doi:10.1109/access.2017.2778504 · Cited by 1,520
Self-citationA Survey of Deep Learning: Platforms, Applications and Emerging Research Trends
Hatcher, W. G., & Yu, W. (2018) · IEEE Access · doi:10.1109/access.2018.2830661 · Cited by 654
“, network congestion and latency are only going to increase without a diverse array of complementary solutions [80], [82], [125], [127], [143], [147], [148], [161].”
BackgroundSelf-citationDifferential Privacy Techniques for Cyber Physical Systems: A Survey
Hassan, M. U., Rehmani, M. H., & Chen, J. (2020) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2019.2944748 · Cited by 564
A Survey on Big Data Market: Pricing, Trading and Protection
Liang, F., Yu, W., An, D., Yang, Q., Fu, X., & Zhao, W. (2018) · IEEE Access · doi:10.1109/access.2018.2806881 · Cited by 356
Self-citation
Metadata
- Authors
- Yang, X., Ren, X., Lin, J., & Yu, W.
- Venue
- IEEE Transactions on Parallel and Distributed Systems
- Published
- 2016-10-01
- Volume
- 27
- Issue
- 10
- Pages
- 2967-2983
- ISSN
- 1045-9219 (ISSN-L)
- OpenAlex
- W2344594340
- Cited by
- 28
- References
- 5
- FWCI
- 4.43
- Type
- journal article
- Language
- en
- Open access
- closed
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: On Binary Decomposition Based Privacy-Preserving Aggregation Schemes in Real-Time Monitoring Systems. https://app.cochat.ai/papers/10.1109/tpds.2016.2516983
- The paper
- Yang, X., Ren, X., Lin, J., & Yu, W. (2016). On Binary Decomposition Based Privacy-Preserving Aggregation Schemes in Real-Time Monitoring Systems. IEEE Transactions on Parallel and Distributed Systems. https://doi.org/10.1109/tpds.2016.2516983
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.