Privacy-preserving data mining
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
A key-management scheme for distributed sensor networks
Proceedings of the 9th ACM conference on Computer and communications security
An authentication framework for hierarchical ad hoc sensor networks
WiSe '03 Proceedings of the 2nd ACM workshop on Wireless security
Establishing pairwise keys in distributed sensor networks
Proceedings of the 10th ACM conference on Computer and communications security
TinyPK: securing sensor networks with public key technology
Proceedings of the 2nd ACM workshop on Security of ad hoc and sensor networks
Energy Analysis of Public-Key Cryptography for Wireless Sensor Networks
PERCOM '05 Proceedings of the Third IEEE International Conference on Pervasive Computing and Communications
An efficient scheme for authenticating public keys in sensor networks
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
A pairwise key predistribution scheme for wireless sensor networks
ACM Transactions on Information and System Security (TISSEC)
Deriving private information from randomized data
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
A Framework for Evaluating Privacy Preserving Data Mining Algorithms*
Data Mining and Knowledge Discovery
ExScal: Elements of an Extreme Scale Wireless Sensor Network
RTCSA '05 Proceedings of the 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
Trio: enabling sustainable and scalable outdoor wireless sensor network deployments
Proceedings of the 5th international conference on Information processing in sensor networks
SDAP: a secure hop-by-Hop data aggregation protocol for sensor networks
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Secure hierarchical in-network aggregation in sensor networks
Proceedings of the 13th ACM conference on Computer and communications security
Secure Data Aggregation in Wireless Sensor Networks: A Survey
PDCAT '06 Proceedings of the Seventh International Conference on Parallel and Distributed Computing, Applications and Technologies
SIA: Secure information aggregation in sensor networks
Journal of Computer Security - Special Issue on Security of Ad-hoc and Sensor Networks
Deriving private information from arbitrarily projected data
PAKDD'07 Proceedings of the 11th Pacific-Asia conference on Advances in knowledge discovery and data mining
On grid-based key pre-distribution: toward a better connectivity in wireless sensor network
PAKDD'07 Proceedings of the 2007 international conference on Emerging technologies in knowledge discovery and data mining
An attacker's view of distance preserving maps for privacy preserving data mining
PKDD'06 Proceedings of the 10th European conference on Principle and Practice of Knowledge Discovery in Databases
Cooperative public key authentication protocol in wireless sensor network
UIC'06 Proceedings of the Third international conference on Ubiquitous Intelligence and Computing
Hierarchical grid-based pairwise key predistribution scheme for wireless sensor networks
EWSN'06 Proceedings of the Third European conference on Wireless Sensor Networks
Secret key revocation in sensor networks
UIC'07 Proceedings of the 4th international conference on Ubiquitous Intelligence and Computing
| Hi-index | 0.00 |
Data aggregation is one of the main purposes for which sensor networks are developed. However, to secure the data aggregation schemes, several security-related issues have raised including the need for efficient implementations of cryptographic algorithms, secure key management schemes' design and many others. Several works has been introduced in this direction and succeeded to some extent in providing relatively efficient solutions. Yet, one of the questions to be answered is that, can we still aggregate the sensed data with less security-related computation while maintaining a marginal level of security and accuracy? In this paper, we consider data randomization as a possible approach for data aggregation. Since the individual single sensed record is not of a big concern when using data for aggregation, we show how data randomization can explicitly hide the exact single data records to securely exchange them between nodes. To improve the security and accuracy of this approach, we introduce a hybrid scheme that uses the cryptographic approach for a fraction of nodes. We study the efficiency of our schemes in terms of the estimate accuracy and the overhead.