The DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.
SIA: Secure information aggregation in sensor networks
Open accessAbstract
In sensor networks, data aggregation is a vital primitive enabling efficient data queries. An on-site aggregator device collects data from sensor nodes and produces a condensed summary which is forwarded to the off-site querier, thus reducing the communication cost of the query. Since the aggregato r is on-site, it is vulnerable to physical compromise attacks. A compromised aggregator may report false aggregation results. Hence, it is essential that techniques are available to allow the querier to verify the integrity of the result returned by the aggregator node. We propose a novel framework for secure information aggregation in sensor networks. By constructing efficient random sampling mechanisms and interactive proofs, we enable the querier to verify that the answer given by the aggregator is a good approximation of the true value, even when the aggregator and a fraction of the sensor nodes are corrupted. In particular, we present efficient protocols for secure computation of the median and average of the measurements, for the estimation of the network size, for finding the minimum and maximum sensor reading, and for random sampling and leader election. Our protocols require only sublinear communication between the aggregator and the user.
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
The knowledge complexity of interactive proof systems
Goldwasser, S., Micali, S., & Rackoff, C. (1989) · SIAM Journal on Computing · doi:10.1137/0218012 · Cited by 3,285
Next century challenges: scalable coordination in sensor networks
Estrin, D., Govindan, R., Heidemann, J., & Kumar, S. (1999) · Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking · doi:10.1145/313451.313556 · Cited by 2,703
SPINS: Security Protocols for Sensor Networks
Perrig, A., Szewczyk, R., Tygar, J. D., Wen, V., & Culler, D. E. (2002) · Wireless Networks · doi:10.1023/a:1016598314198 · Cited by 2,264
Self-citationMerkle, R. C. (2007) · Lecture Notes in Computer Science · doi:10.1007/0-387-34805-0_21 · Cited by 1,691
Next century challenges: mobile networking for “Smart Dust”
Kahn, J. M., Katz, R. H., & Pister, K. S. J. (1999) · Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking · doi:10.1145/313451.313558 · Cited by 1,660
Protocols for Public Key Cryptosystems
Merkle, R. C. (1980) · 1980 IEEE Symposium on Security and Privacy · doi:10.1109/sp.1980.10006 · Cited by 1,418
New hash functions and their use in authentication and set equality
Wegman, M. N., & Carter, J. L. (1981) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(81)90033-7 · Cited by 1,402
The TESLA Broadcast Authentication Protocol
Perrig, A., Canetti, R., Tygar, J. D., & Song, D. X. (2018) · Figshare · doi:10.1184/r1/6073610 · Cited by 842
Self-citationThe space complexity of approximating the frequency moments
Alon, N., Matias, Y., & Szegedy, M. (1996) · Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96 · doi:10.1145/237814.237823 · Cited by 822
SIA: secure information aggregation in sensor networks
Przydatek, B., Song, D., & Perrig, A. (2003) · Proceedings of the 1st international conference on Embedded networked sensor systems · doi:10.1145/958491.958521 · Cited by 789
Self-citation
Cited by
A survey of security issues in wireless sensor networks
Wang, Y., Attebury, G., & Ramamurthy, B. (2006) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2006.315852 · Cited by 898
PDA: Privacy-Preserving Data Aggregation in Wireless Sensor Networks
He, W., Liu, X., Nguyen, H., Nahrstedt, K., & Abdelzaher, T. (2007) · IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications · doi:10.1109/infcom.2007.237 · Cited by 434
Securing wireless sensor networks: a survey
Zhou, Y., Fang, Y., & Zhang, Y. (2008) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2008.4625802 · Cited by 424
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
Secure hierarchical in-network aggregation in sensor networks
Chan, H., Perrig, A., & Song, D. (2006) · Proceedings of the 13th ACM conference on Computer and communications security · doi:10.1145/1180405.1180440 · Cited by 334
Self-citationEfficient 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
Location-based compromise-tolerant security mechanisms for wireless sensor networks
Zhang, Y., Liu, W., Lou, W., & Fang, Y. (2006) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2005.861382 · Cited by 329
A Survey on Wireless Sensor Network Security
Sen, J. (2010) · arXiv (Cornell University) · doi:10.48550/arxiv.1011.1529 · Cited by 273
Metadata
- Authors
- Chan, H., Perrig, A., Przydatek, B., & Song, D.
- Venue
- Journal of Computer Security
- Publisher
- SAGE Publications
- Published
- 2007-01-01
- Volume
- 15
- Issue
- 1
- Pages
- 69-102
- ISSN
- 0926-227X (ISSN-L)
- 1875-8924
- OpenAlex
- W2131924466
- Cited by
- 309
- References
- 27
- FWCI
- 76.57
- Type
- journal article
- 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.