Efficient and provably secure aggregation of encrypted data in wireless sensor networks
The DOI matches its Crossref record; 32 of the 32 references it cites were found in a registry or an index.
Abstract
Wireless sensor networks (WSNs) are composed of tiny devices with limited computation and battery capacities. For such resource-constrained devices, data transmission is a very energy-consuming operation. To maximize WSN lifetime, it is essential to minimize the number of bits sent and received by each device. One natural approach is to aggregate sensor data along the path from sensors to the sink. Aggregation is especially challenging if end-to-end privacy between sensors and the sink (or aggregate integrity) is required. In this article, we propose a simple and provably secure encryption scheme that allows efficient additive aggregation of encrypted data. Only one modular addition is necessary for ciphertext aggregation. The security of the scheme is based on the indistinguishability property of a pseudorandom function (PRF), a standard cryptographic primitive. We show that aggregation based on this scheme can be used to efficiently compute statistical values, such as mean, variance, and standard deviation of sensed data, while achieving significant bandwidth savings. To protect the integrity of the aggregated data, we construct an end-to-end aggregate authentication scheme that is secure against outsider-only attacks, also based on the indistinguishability property of PRFs.
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
A method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1978) · Communications of the ACM · doi:10.1145/359340.359342 · Cited by 13,462
A method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1983) · Communications of the ACM · doi:10.1145/357980.358017 · Cited by 13,012
A key-management scheme for distributed sensor networks
Eschenauer, L., & Gligor, V. D. (2002) · Proceedings of the 9th ACM conference on Computer and communications security · doi:10.1145/586110.586117 · Cited by 3,541
Secure routing in wireless sensor networks: attacks and countermeasures
Karlof, C., & Wagner, D. (2003) · Ad Hoc Networks · doi:10.1016/s1570-8705(03)00008-8 · Cited by 2,937
A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
Goldwasser, S., Micali, S., & Rivest, R. L. (1988) · SIAM Journal on Computing · doi:10.1137/0217017 · Cited by 2,804
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
Goldwasser, S., & Micali, S. (1984) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(84)90070-9 · Cited by 2,603
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
How to construct random functions
Goldreich, O., Goldwasser, S., & Micali, S. (1986) · Journal of the ACM · doi:10.1145/6490.6503 · Cited by 2,115
Aggregate and Verifiably Encrypted Signatures from Bilinear Maps
Boneh, D., Gentry, C., Lynn, B., & Shacham, H. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-39200-9_26 · Cited by 1,821
Denial of service in sensor networks
Wood, A. D., & Stankovic, J. A. (2002) · Computer · doi:10.1109/mc.2002.1039518 · Cited by 1,711
TinySec: a link layer security architecture for wireless sensor networks
Karlof, C., Sastry, N., & Wagner, D. (2004) · Proceedings of the 2nd international conference on Embedded networked sensor systems · doi:10.1145/1031495.1031515 · Cited by 1,612
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
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
Public-key cryptosystems provably secure against chosen ciphertext attacks
Naor, M., & Yung, M. (1990) · Proceedings of the twenty-second annual ACM symposium on Theory of computing - STOC '90 · doi:10.1145/100216.100273 · Cited by 1,088
Rivest, R. L. (1995) · Lecture Notes in Computer Science · doi:10.1007/3-540-60590-8_7 · Cited by 892
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
(2009) · Applied Algebra · doi:10.1201/9781439894699-15 · Cited by 603
Zhu, S., Setia, S., Jajodia, S., & Ning, P. (2004) · IEEE Symposium on Security and Privacy, 2004. Proceedings. 2004 · doi:10.1109/secpri.2004.1301328 · Cited by 556
Efficient aggregation of encrypted data in wireless sensor networks
Castelluccia, C., Mykletun, E., & Tsudik, G. (2005) · The Second Annual International Conference on Mobile and Ubiquitous Systems: Networking and Services · doi:10.1109/mobiquitous.2005.25 · Cited by 525
Self-citationCipher Printing Telegraph Systems For Secret Wire and Radio Telegraphic Communications
Vernam, G. S. (1926) · Transactions of the American Institute of Electrical Engineers · doi:10.1109/t-aiee.1926.5061224 · Cited by 480
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
Proceedings 2002 IEEE Symposium on Security and Privacy
(2002) · doi:10.1109/secpri.2002 · Cited by 374
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
SIA: Secure information aggregation in sensor networks
Chan, H., Perrig, A., Przydatek, B., & Song, D. (2007) · Journal of Computer Security · doi:10.3233/jcs-2007-15104 · Cited by 309
SDAP: a secure hop-by-Hop data aggregation protocol for sensor networks
Yang, Y. X., Wang, X., Zhu, S., & Cao, G. (2006) · ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc) · doi:10.1145/1132905.1132944 · Cited by 287
Westhoff, D., Girao, J., & Acharya, M. (2006) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2006.144 · Cited by 233
CDA: concealed data aggregation for reverse multicast traffic in wireless sensor networks
Girao, J., Westhoff, D., & Schneider, M. (2005) · IEEE International Conference on Communications, 2005. ICC 2005. 2005 · doi:10.1109/icc.2005.1494953 · Cited by 229
Characterization of Security Notions for Probabilistic Private-Key Encryption
Katz, J. I., & Yung, M. M. (2005) · Journal of Cryptology · doi:10.1007/s00145-005-0310-8 · Cited by 68
Buttyán, L., Schaffer, P., & Vajda, I. (2006) · Security of ad hoc and Sensor Networks · doi:10.1145/1180345.1180356 · Cited by 48
On the Privacy of Concealed Data Aggregation
Chan, A. C.-F., & Castelluccia, C. (2007) · Lecture notes in computer science · doi:10.1007/978-3-540-74835-9_26 · Cited by 9
Self-citation
Cited by
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
A Lightweight Privacy-Preserving Data Aggregation Scheme for Fog Computing-Enhanced IoT
Lu, R., Heung, K., Lashkari, A. H., & Ghorbani, A. A. (2017) · IEEE Access · doi:10.1109/access.2017.2677520 · Cited by 478
Trust mechanisms in wireless sensor networks: Attack analysis and countermeasures
Yu, Y., Li, K., Zhou, W., & Li, P. (2012) · Journal of Network and Computer Applications · doi:10.1016/j.jnca.2011.03.005 · Cited by 353
A privacy-preserving sensory data sharing scheme in Internet of Vehicles
Kong, Q., Lu, R., Ma, M., & Bao, H. (2019) · Future Generation Computer Systems · doi:10.1016/j.future.2017.12.003 · Cited by 85
An efficient data aggregation scheme with local differential privacy in smart grid
Gai, N., Xue, K., Zhu, B., Yang, J., Liu, J., & He, D. (2022) · Digital Communications and Networks · doi:10.1016/j.dcan.2022.01.004 · Cited by 78
Metadata
- Authors
- Castelluccia, C., Chan, A. C.-F., Mykletun, E., & Tsudik, G.
- Venue
- ACM Transactions on Sensor Networks
- Published
- 2009-05
- Volume
- 5
- Issue
- 3
- Pages
- 1-36
- ISSN
- 1550-4859 (ISSN-L)
- 1550-4867
- OpenAlex
- W2027423568
- Cited by
- 331
- References
- 32
- FWCI
- 24.83
- 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.