The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Concealed Data Aggregation for Reverse Multicast Traffic in Sensor Networks: Encryption, Key Distribution, and Routing Adaptation
Abstract
Routing in wireless sensor networks is different from that in commonsense mobile ad-hoc networks. It mainly needs to support reverse multicast traffic to one particular destination in a multihop manner. For such a communication pattern, end-to-end encryption is a challenging problem. To save the overall energy resources of the network, sensed data needs to be consolidated and aggregated on its way to the final destination. We present an approach that 1) conceals sensed data end-to-end by 2) still providing efficient and flexible in-network data aggregation. The aggregating intermediate nodes are not required to operate on the sensed plaintext data. We apply a particular class of encryption transformations and discuss techniques for computing the aggregation functions "average" and "movement detection." We show that the approach is feasible for the class of "going down" routing protocols. We consider the risk of corrupted sensor nodes by proposing a key predistribution algorithm that limits an attacker's gain and show how key predistribution and a key-ID sensitive "going down" routing protocol help increase the robustness and reliability of the connected backbone
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
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357
Cited by
Order-Preserving Symmetric Encryption
Boldyreva, A., Chenette, N., Lee, Y., & O’Neill, A. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-01001-9_13 · Cited by 887
EPPA: An Efficient and Privacy-Preserving Aggregation Scheme for Secure Smart Grid Communications
Lu, R., Liang, X., Li, X., Lin, X., & Shen, X. (2012) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2012.86 · Cited by 772
Secure data aggregation in wireless sensor networks: A comprehensive overview
Ozdemir, S., & Xiao, Y. (2009) · Computer Networks · doi:10.1016/j.comnet.2009.02.023 · Cited by 422
Efficient and provably secure aggregation of encrypted data in wireless sensor networks
Castelluccia, C., Chan, A. C.-F., Mykletun, E., & Tsudik, G. (2009) · ACM Transactions on Sensor Networks · doi:10.1145/1525856.1525858 · Cited by 331
PADP: Efficient Privacy-Preserving Data Aggregation and Dynamic Pricing for Vehicle-to-Grid Networks
Chen, L., Zhou, J., Chen, Y., Cao, Z., Dong, X., & Choo, K.-K. R. (2021) · IEEE Internet of Things Journal · doi:10.1109/jiot.2020.3041117 · Cited by 44
Metadata
- Authors
- Westhoff, D., Girao, J., & Acharya, M.
- Venue
- IEEE Transactions on Mobile Computing
- Published
- 2006-10
- Volume
- 5
- Issue
- 10
- Pages
- 1417-1431
- ISSN
- 1536-1233 (ISSN-L)
- OpenAlex
- W2132362924
- Cited by
- 233
- References
- 1
- FWCI
- 18.80
- 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
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.