A Secure Data Aggregation Scheme for Wireless Sensor Networks

Ren, Shu Qin; Kim, Dong-Seong; Park, Jong Sou

doi:10.1007/978-3-540-74767-3_4

Cited by 7 publications

(11 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…There have been several protocols introduced for preserving the confidentiality of aggregate results [11], [19], [20], [22]- [24]. This issue is different from what our protocol tries to solve and thus is not considered in this paper.…”

Section: Related Workmentioning

confidence: 96%

See 1 more Smart Citation

Efficient and Secure Aggregation of Sensor Data against Multiple Corrupted Nodes

Miyaji

Omote

2011

IEICE Trans. Inf. & Syst.

View full text Add to dashboard Cite

SUMMARYWireless Sensor Networks (WSNs) rely on in-network aggregation for efficiency, that is, readings from sensor nodes are aggregated at intermediate nodes to reduce the communication cost. However, the previous optimally secure in-network aggregation protocols against multiple corrupted nodes require two round-trip communications between each node and the base station, including the result-checking phase whose congestion is O(log n) where n is the total number of sensor nodes. In this paper * * , we propose an efficient and optimally secure sensor network aggregation protocol against multiple corrupted nodes by a random-walk adversary. Our protocol achieves one round-trip communication to satisfy optimal security without the result-checking phase, by conducting aggregation along with the verification, based on the idea of TESLA technique. Furthermore, we show that the congestion complexity, communication complexity and computational cost in our protocol are constant, i.e., O(1).

show abstract

Section: Related Workmentioning

confidence: 96%

“…An adversary is able to replay, modify, delay, drop, and deliver protocol messages out of order as well as inject own messages. However, most aggregation protocols assume that all intermediate nodes are trusted [4]- [15], [17]- [20], [22]- [24] except [2], [3], [16], [21]. A corrupted node can easily modify its own sensor reading.…”

Section: Introductionmentioning

confidence: 99%

Efficient and Secure Aggregation of Sensor Data against Multiple Corrupted Nodes

Miyaji

Omote

2011

IEICE Trans. Inf. & Syst.

View full text Add to dashboard Cite

show abstract

“…There have been several protocols introduced for preserving the confidentiality of aggregate results [18,19,10,[21][22][23]. This issue is orthogonal to our protocol and is not considered in this paper.…”

Section: Related Workmentioning

confidence: 99%

Efficient and Optimally Secure In-Network Aggregation in Wireless Sensor Networks

Miyaji

Omote

2011

Information Security Applications

View full text Add to dashboard Cite

Abstract. In many wireless sensor network applications, the data collection sink (base station) needs to find the aggregated statistics of the network. Readings from sensor nodes are aggregated at intermediate nodes to reduce the communication cost. However, the previous optimally secure in-network aggregation protocols against multiple corrupted nodes require two round-trip communications between each node and the base station, including the result-checking phase whose congestion is O(log n) where n is the total number of sensor nodes. In this paper 1 , we propose an efficient and optimally secure sensor network aggregation protocol against multiple corrupted nodes by a weak adversary. Our protocol achieves one round-trip communication to satisfy optimal security without the result-checking phase, by conducting aggregation along with the verification, based on the idea of TESLA technique. Furthermore, we show that the congestion is constant. This means that our protocol suits large-scale wireless sensor networks.

show abstract

“…Both of these schemes didn't consider about violated data which can easily affect the aggregation result, as mentioned in the talks of Wagner D. [22]. Our previous work [19] added Elliptic Curve Diffie Hellman (ECDH) [1,5,12] based message authentication to a PH encryption for checking the data integrity and dropping the malicious data before aggregation. And all these aggregation schemes did not check the malicious data from compromised node and manipulating environment.…”

mentioning

confidence: 96%

“…For providing a robust data aggregation to tolerate malicious sensing data while preserving the efficient data consolidation, we did further work from both encryption and aggregation based on the previous work [19], and we proposed a new PH encryption combined with density data mining. So the sensing nodes can conceal data privacy while the aggregating node can extract the group data distribution from the concealed data, filter out the possible violated data and consolidate dense data according to the group distribution.…”

mentioning

confidence: 99%

Fault-Tolerance Data Aggregation for Clustering Wireless Sensor Network

Ren

Park

2008

Wireless Pers Commun

Self Cite

View full text Add to dashboard Cite

The hierarchical cluster-based topology is commonly accepted as an optimal structure for sensor network to increase communication scalability, prolong network lifetime, and reduce data redundancy. However, the data privacy and security are challenging the proliferation of clustering wireless sensor network (CWSN) due to its highly constrained resources and violably deployed environments, which make it infeasible to directly apply traditional cryptography and therefore vulnerable to various attacks. This article proposes a scheme that provides efficient privacy-preserving data fusion as well as malicious data tolerance by mining concealed data within groups. And the dynamically organized groups in each cluster improves resilience against large number of node compromise comparing with the existing data aggregation schemes. The simulation results and mathematical comparison show the effectiveness and fitness of our scheme for CWSN in terms of fault tolerance and process efficiency, which costs a little of additional overheads in memory and communication.

show abstract

A Secure Data Aggregation Scheme for Wireless Sensor Networks

Cited by 7 publications

References 7 publications

Efficient and Secure Aggregation of Sensor Data against Multiple Corrupted Nodes

Efficient and Secure Aggregation of Sensor Data against Multiple Corrupted Nodes

Efficient and Optimally Secure In-Network Aggregation in Wireless Sensor Networks

Fault-Tolerance Data Aggregation for Clustering Wireless Sensor Network

Contact Info

Product

Resources

About