Efficient and Secure Aggregation of Sensor Data against Multiple Corrupted Nodes

Atsuko MIYAJI; Kazumasa OMOTE

doi:10.1587/transinf.E94.D.1955

Efficient and Secure Aggregation of Sensor Data against Multiple Corrupted Nodes

Atsuko MIYAJI, Kazumasa OMOTE

Full Text Views

0

Share
Cite this

Summary :

Wireless 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).

Publication: IEICE TRANSACTIONS on Information Vol.E94-D No.10 pp.1955-1965

Publication Date: 2011/10/01

Publicized

Online ISSN: 1745-1361

DOI: 10.1587/transinf.E94.D.1955

Type of Manuscript: PAPER

Category: Information Network

Cite this

Copy

Atsuko MIYAJI, Kazumasa OMOTE, "Efficient and Secure Aggregation of Sensor Data against Multiple Corrupted Nodes" in IEICE TRANSACTIONS on Information, vol. E94-D, no. 10, pp. 1955-1965, October 2011, doi: 10.1587/transinf.E94.D.1955.
Abstract: Wireless 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).
URL: https://globals.ieice.org/en_transactions/information/10.1587/transinf.E94.D.1955/_p

Copy

@ARTICLE{e94-d_10_1955,
author={Atsuko MIYAJI, Kazumasa OMOTE, },
journal={IEICE TRANSACTIONS on Information},
title={Efficient and Secure Aggregation of Sensor Data against Multiple Corrupted Nodes},
year={2011},
volume={E94-D},
number={10},
pages={1955-1965},
abstract={Wireless 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).},
keywords={},
doi={10.1587/transinf.E94.D.1955},
ISSN={1745-1361},
month={October},}

Copy

TY - JOUR
TI - Efficient and Secure Aggregation of Sensor Data against Multiple Corrupted Nodes
T2 - IEICE TRANSACTIONS on Information
SP - 1955
EP - 1965
AU - Atsuko MIYAJI
AU - Kazumasa OMOTE
PY - 2011
DO - 10.1587/transinf.E94.D.1955
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E94-D
IS - 10
JA - IEICE TRANSACTIONS on Information
Y1 - October 2011
AB - Wireless 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).
ER -