The Impact of Data Aggregation in Wireless Sensor Networks
ICDCSW '02 Proceedings of the 22nd International Conference on Distributed Computing Systems
A Provably Secure Additive and Multiplicative Privacy Homomorphism
ISC '02 Proceedings of the 5th International Conference on Information Security
E.cient Aggregation of encrypted data in Wireless Sensor Networks
MOBIQUITOUS '05 Proceedings of the The Second Annual International Conference on Mobile and Ubiquitous Systems: Networking and Services
IEEE Transactions on Mobile Computing
A survey of homomorphic encryption for nonspecialists
EURASIP Journal on Information Security
Secure data aggregation in wireless sensor networks: A comprehensive overview
Computer Networks: The International Journal of Computer and Telecommunications Networking
Practical ID-based encryption for wireless sensor network
ASIACCS '10 Proceedings of the 5th ACM Symposium on Information, Computer and Communications Security
A New Sensitive Data Aggregation Scheme for Protecting Integrity in Wireless Sensor Networks
CIT '10 Proceedings of the 2010 10th IEEE International Conference on Computer and Information Technology
Identity-Based aggregate signatures
PKC'06 Proceedings of the 9th international conference on Theory and Practice of Public-Key Cryptography
| Hi-index | 0.00 |
Lossy data aggregation assumes that when an aggregation node collects data from other nodes, some or all sensed data of a node may be missed. Thus the final data received by the base station are fragmented. We assume that the measurements of different nodes have different weights for their contributions to aggregated data. In this paper, we propose a secure identity-based lossy data aggregation integrity scheme based on homomorphic hashing and identity-based aggregate signature. The scheme enables the base station to share a distinct key with every sensor node, such that all aggregation nodes besides the base station can verify the authenticity of aggregated data. In our scheme, both the aggregation nodes and the base station can compute the weights of sensor nodes, neither via an established agreement nor from explicit indications attached to data. Furthermore, through theoretical analysis and experimental results, the proposed algorithm is demonstrated to have efficient performance.