The DOI matches its Crossref record; 32 of the 32 references it cites were found in a registry or an index.
SIA: secure information aggregation in sensor networks
Abstract
Sensor networks promise viable solutions to many monitoring problems. However, the practical deployment of sensor networks faces many challenges imposed by real-world demands. Sensor nodes often have limited computation and communication resources and battery power. Moreover, in many applications sensors are deployed in open environments, and hence are vulnerable to physical attacks, potentially compromising the sensor's cryptographic keys.One of the basic and indispensable functionalities of sensor networks is the ability to answer queries over the data acquired by the sensors. The resource constraints and security issues make designing mechanisms for information aggregation in large sensor networks particularly challenging.In this paper, we propose a novel framework for secure information aggregation in large sensor networks. In our framework certain nodes in the sensor network, called aggregators, help aggregating information requested by a query, which substantially reduces the communication overhead. By constructing efficient random sampling mechanisms and interactive proofs, we enable the user 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 the average of the measurements, for the estimation of the network size, and for finding the minimum and maximum sensor reading. Our protocols require only sublinear communication between the aggregator and the user. To the best of our knowledge, this paper is the first on secure information aggregation in sensor networks that can handle a malicious aggregator and sensor nodes.
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 Byzantine generals problem
Lamport, L., Shostak, R., & Pease, M. (1982) · ACM Transactions on Programming Languages and Systems · doi:10.1145/357172.357176 · Cited by 6,023
TAG: a Tiny AGgregation service for ad-hoc sensor networks
Madden, S., Franklin, M. J., Hellerstein, J. M., & Hong, W. (2002) · ACM SIGOPS Operating Systems Review · doi:10.1145/844128.844142 · Cited by 2,719
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., Wen, V., Culler, D., & Tygar, J. D. (2001) · Proceedings of the 7th annual international conference on Mobile computing and networking · doi:10.1145/381677.381696 · Cited by 2,532
Self-citationSPINS: 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
Keying Hash Functions for Message Authentication
Bellare, M., Canetti, R., & Krawczyk, H. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-68697-5_1 · Cited by 1,580
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 · cited 1×
“For example in the Merkle-treeconstruction [30, 31] all the collected data is placed at the leaves of the tree, and the committing party then compu tes a binary hash tree starting from the leaf nodes: each internal node in the hash tree is computed as the hash value of th concatenation of the two child nodes.”
MethodNew 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 knowledge complexity of interactive proof-systems
Goldwasser, S., Micali, S., & Rackoff, C. (1985) · Proceedings of the seventeenth annual ACM symposium on Theory of computing - STOC '85 · doi:10.1145/22145.22178 · Cited by 1,302
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
Impact of network density on data aggregation in wireless sensor networks
Intanagonwiwat, C., Estrin, D., Govindan, R., & Heidemann, J. (2003) · Proceedings 22nd International Conference on Distributed Computing Systems · doi:10.1109/icdcs.2002.1022289 · Cited by 696
Checking computations in polylogarithmic time
Babai, L., Fortnow, L., Levin, L. A., & Szegedy, M. (1991) · Proceedings of the twenty-third annual ACM symposium on Theory of computing - STOC '91 · doi:10.1145/103418.103428 · Cited by 616
A note on efficient zero-knowledge proofs and arguments (extended abstract)
Kilian, J. (1992) · Proceedings of the twenty-fourth annual ACM symposium on Theory of computing - STOC '92 · doi:10.1145/129712.129782 · Cited by 606
Computationally Private Information Retrieval with Polylogarithmic Communication
Cachin, C., Micali, S., & Stadler, M. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48910-x_28 · Cited by 579
Counting Distinct Elements in a Data Stream
Bar-Yossef, Z., Jayram, T. S., Kumar, R., Sivakumar, D., & Trevisan, L. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45726-7_1 · Cited by 460
Secure aggregation for wireless networks
Hu, L., & Evans, D. (2003) · Symposium on Applications and the Internet Workshops (SAINT Workshops) · doi:10.1109/saintw.2003.1210191 · Cited by 453
Resilient aggregation in sensor networks
Wagner, D. (2004) · Proceedings of the 2nd ACM workshop on Security of ad hoc and sensor networks · doi:10.1145/1029102.1029116 · Cited by 378
Computing aggregates for monitoring wireless sensor networks
Zhao, J., Govindan, R., & Estrin, D. L. (2003) · doi:10.1109/snpa.2003.1203364 · Cited by 339
Forward-Security in Private-Key Cryptography
Bellare, M., & Yee, B. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-36563-x_1 · Cited by 275
An Oblivious Transfer Protocol with Log-Squared Communication
Lipmaa, H. (2005) · Lecture Notes in Computer Science · doi:10.1007/11556992_23 · Cited by 271
A witness-based approach for data fusion assurance in wireless sensor networks
Du, W., Deng, J., Han, Y. S., & Varshney, P. K. (2004) · GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489) · doi:10.1109/glocom.2003.1258475 · Cited by 198
Flajolet, P., & Martin, G. N. (1983) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1983.46 · Cited by 155
Advances in Cryptology — CRYPTO '97
Kaliski, B. S. (1997) · Lecture notes in computer science · doi:10.1007/bfb0052223 · Cited by 154
SecureDAV: a secure data aggregation and verification protocol for sensor networks
Mahimkar, A. A., & Rappaport, T. S. (2005) · IEEE Global Telecommunications Conference (GLOBECOM) · doi:10.1109/glocom.2004.1378395 · Cited by 130
Ergün, F., Kannan, S., Kumar, S. R. V., Rubinfeld, R., & Viswanathan, M. (2000) · Journal of Computer and System Sciences · doi:10.1006/jcss.1999.1692 · Cited by 120
Bar-Yossef, Z., Kumar, R., & Sivakumar, D. (2001) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/380752.380810 · Cited by 111
Efficient Secure Aggregation in Sensor Networks
Jadia, P., & Mathuria, A. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-30474-6_10 · Cited by 52
Secure Games with Polynomial Expressions
Kiayias, A., & Yung, M. M. (2001) · Lecture notes in computer science · doi:10.1007/3-540-48224-5_76 · Cited by 36
Ergün, F., Kumar, R., & Rubinfeld, R. (1999) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/301250.301267 · Cited by 22
Cited by
Internet of things: Vision, applications and research challenges
Miorandi, D., Sicari, S., De Pellegrini, F., & Chlamtac, I. (2012) · Ad Hoc Networks · doi:10.1016/j.adhoc.2012.02.016 · Cited by 3,578
Security in wireless sensor networks
Perrig, A., Stankovic, J., & Wagner, D. (2004) · Communications of the ACM · doi:10.1145/990680.990707 · Cited by 1,452
Self-citationLEAP: efficient security mechanisms for large-scale distributed sensor networks
Zhu, S., Setia, S., & Jajodia, S. (2003) · Proceedings of the 10th ACM conference on Computer and communications security · doi:10.1145/948109.948120 · Cited by 1,117
Data-aggregation techniques in sensor networks: A survey
Rajagopalan, R., & Varshney, P. K. (2006) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2006.283821 · Cited by 900
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
Metadata
- Authors
- Przydatek, B., Song, D., & Perrig, A.
- Venue
- Proceedings of the 1st international conference on Embedded networked sensor systems
- Publisher
- ACM
- Published
- 2003-11-05
- Pages
- 255-265
- OpenAlex
- W2019396864
- Cited by
- 789
- References
- 32
- FWCI
- 23.97
- Type
- conference paper
- 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.