Integrity Protecting and Privacy Preserving Data Aggregation Protocols in Wireless Sensor Networks: A Survey <s> a) PIA <s> The use of cryptographic hash functions like MD5 or SHA-1 for message authentication has become a standard approach in many applications, particularly Internet security protocols. Though very easy to implement, these mechanisms are usually based on ad hoc techniques that lack a sound security analysis. ::: ::: We present new, simple, and practical constructions of message authentication schemes based on a cryptographic hash function. Our schemes, NMAC and HMAC, are proven to be secure as long as the underlying hash function has some reasonable cryptographic strengths. Moreover we show, in a quantitative way, that the schemes retain almost all the security of the underlying hash function. The performance of our schemes is essentially that of the underlying hash function. Moreover they use the hash function (or its compression function) as a black box, so that widely available library code or hardwair can be used to implement them in a simple way, and replaceability of the underlying hash function is easily supported. <s> BIB001 </s> Integrity Protecting and Privacy Preserving Data Aggregation Protocols in Wireless Sensor Networks: A Survey <s> a) PIA <s> Encryption is a well established technology for protecting sensitive data. However, once encrypted, data can no longer be easily queried aside from exact matches. We present an order-preserving encryption scheme for numeric data that allows any comparison operation to be directly applied on encrypted data. Query results produced are sound (no false hits) and complete (no false drops). Our scheme handles updates gracefully and new values can be added without requiring changes in the encryption of other values. It allows standard databse indexes to be built over encrypted tables and can easily be integrated with existing database systems. The proposed scheme has been designed to be deployed in application environments in which the intruder can get access to the encrypted database, but does not have prior domain information such as the distribution of values and annot encrypt or decrypt arbitrary values of his choice. The encryption is robust against estimation of the true value in such environments. <s> BIB002 </s> Integrity Protecting and Privacy Preserving Data Aggregation Protocols in Wireless Sensor Networks: A Survey <s> a) PIA <s> In-network aggregation is an essential primitive for performing queries on sensor network data. However, most aggregation algorithms assume that all intermediate nodes are trusted. In contrast, the standard threat model in sensor network security assumes that an attacker may control a fraction of the nodes, which may misbehave in an arbitrary (Byzantine) manner.We present the first algorithm for provably secure hierarchical in-network data aggregation. Our algorithm is guaranteed to detect any manipulation of the aggregate by the adversary beyond what is achievable through direct injection of data values at compromised nodes. In other words, the adversary can never gain any advantage from misrepresenting intermediate aggregation computations. Our algorithm incurs only O(Δ log2 n) node congestion, supports arbitrary tree-based aggregator topologies and retains its resistance against aggregation manipulation in the presence of arbitrary numbers of malicious nodes. The main algorithm is based on performing the sum aggregation securely by first forcing the adversary to commit to its choice of intermediate aggregation results, and then having the sensor nodes independently verify that their contributions to the aggregate are correctly incorporated. We show how to reduce secure median , count , and average to this primitive. <s> BIB003 </s> Integrity Protecting and Privacy Preserving Data Aggregation Protocols in Wireless Sensor Networks: A Survey <s> a) PIA <s> Data aggregation in sensor network can improve both efficiency and privacy of network traffic.Recent work in integrity-assured data aggregation has considered aggregation as only an efficiency primitive. In this work, we address for the first time the problem of integrity-assured data aggregation with efficiency and privacy as a joint objective. Our solutions show the inherent tension between privacy-preservation and integrity-assurance of data aggregation. <s> BIB004
The PIA (Privacy Preserving Integrity Assured data aggregation) BIB004 addresses the integrity assured data aggregation with efficiency and privacy as joint objective. Two types of Integrity Verification (IV): centralized and distributed. In both types, the integrity of aggregate is verified by re-computing the aggregation function of the raw data. In centralized IV, after receiving data from sensor node, the server checks the integrity. In distributed IV, the sensor node recompute the aggregation function using the data from other sensors. If all the results obtained from sensor node is same, then aggregation is considered as secure. It distributes the communication throughput in the network. The PIA proposed four symmetric key solutions for the single aggregator model. In the first solution, homomorphic encryption scheme hides data during transmission in a centralized IV . combines the homomorphism and MAC BIB001 to construct an authenticated encryption scheme for the aggregator node. The MAC is used to check the integrity of the aggregated result at the sink. It only supports additive aggregation functions such as SUM, average and standard deviation. The second solution uses the Order Preserving Encryption Scheme (OPES) BIB002 to preserve the privacy of distribution of data. OPES uses to verify the integrity of comparison based aggregation function. Sensors encrypt the data by using OPES with master secret key shared by all sensors then aggregator calculates and sends to the user. The user decrypts the aggregated data in centralized IV. The third solution uses a secure hierarchical in networking aggregation (SHIA) BIB003 scheme for adapting distributed IV. This scheme supports any aggregation function because the sensor nodes have the access to all raw data. The communication overhead of each node is O(N). Where N is the total number of sensor node in a network. This scheme preserves privacy without using any additional privacy preservation mechanism such as encryption. A commitment is constructed during the aggregation process. After calculating the aggregate, each sensor node independently reconstructs the commit tree and ensure that the data is not modified or discard the contribution of the node by any adversary. The fourth solution used to improve the privacy and integrity of the third solution by using a logical aggregation tree within the aggregator node. Each sensor node has a communication overhead of O (log N). It only supports decomposable functions such as mean, standard deviation, count, MIN/MAX. It uses distributed IV. III.