Abstract
Most large-scale sensor networks are expected to follow a two-tier architecture with resource-poor sensor nodes at the lower tier and resource-rich master nodes at the upper tier. Master nodes collect data from sensor nodes and then answer the queries from the network owner on their behalf. In hostile environments, master nodes may be compromised by the adversary and then instructed to return fake and/or incomplete data in response to data queries. Such application-level attacks are more harmful and difficult to detect than blind DoS attacks on network communications, especially when the query results are the basis for making critical decisions such as military actions. This paper presents three schemes whereby the network owner can verify the authenticity and completeness of fine-grained top-k query results in tired sensor networks, which is the first work of its kind. The proposed schemes are built upon symmetric cryptographic primitives and force compromised master nodes to return both authentic and complete top-k query results to avoid being caught. Detailed theoretical and quantitative results confirm the high efficacy and efficiency of the proposed schemes.
| Original language | English (US) |
|---|---|
| Title of host publication | Proceedings - IEEE INFOCOM |
| DOIs | |
| State | Published - 2010 |
| Externally published | Yes |
| Event | IEEE INFOCOM 2010 - San Diego, CA, United States Duration: Mar 14 2010 → Mar 19 2010 |
Other
| Other | IEEE INFOCOM 2010 |
|---|---|
| Country | United States |
| City | San Diego, CA |
| Period | 3/14/10 → 3/19/10 |
Fingerprint
ASJC Scopus subject areas
- Computer Science(all)
- Electrical and Electronic Engineering
Cite this
Verifiable fine-grained top-k queries in tiered sensor networks. / Zhang, Rui; Shi, Jing; Liu, Yunzhong; Zhang, Yanchao.
Proceedings - IEEE INFOCOM. 2010. 5461927.Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
}
TY - GEN
T1 - Verifiable fine-grained top-k queries in tiered sensor networks
AU - Zhang, Rui
AU - Shi, Jing
AU - Liu, Yunzhong
AU - Zhang, Yanchao
PY - 2010
Y1 - 2010
N2 - Most large-scale sensor networks are expected to follow a two-tier architecture with resource-poor sensor nodes at the lower tier and resource-rich master nodes at the upper tier. Master nodes collect data from sensor nodes and then answer the queries from the network owner on their behalf. In hostile environments, master nodes may be compromised by the adversary and then instructed to return fake and/or incomplete data in response to data queries. Such application-level attacks are more harmful and difficult to detect than blind DoS attacks on network communications, especially when the query results are the basis for making critical decisions such as military actions. This paper presents three schemes whereby the network owner can verify the authenticity and completeness of fine-grained top-k query results in tired sensor networks, which is the first work of its kind. The proposed schemes are built upon symmetric cryptographic primitives and force compromised master nodes to return both authentic and complete top-k query results to avoid being caught. Detailed theoretical and quantitative results confirm the high efficacy and efficiency of the proposed schemes.
AB - Most large-scale sensor networks are expected to follow a two-tier architecture with resource-poor sensor nodes at the lower tier and resource-rich master nodes at the upper tier. Master nodes collect data from sensor nodes and then answer the queries from the network owner on their behalf. In hostile environments, master nodes may be compromised by the adversary and then instructed to return fake and/or incomplete data in response to data queries. Such application-level attacks are more harmful and difficult to detect than blind DoS attacks on network communications, especially when the query results are the basis for making critical decisions such as military actions. This paper presents three schemes whereby the network owner can verify the authenticity and completeness of fine-grained top-k query results in tired sensor networks, which is the first work of its kind. The proposed schemes are built upon symmetric cryptographic primitives and force compromised master nodes to return both authentic and complete top-k query results to avoid being caught. Detailed theoretical and quantitative results confirm the high efficacy and efficiency of the proposed schemes.
UR - http://www.scopus.com/inward/record.url?scp=77953304573&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=77953304573&partnerID=8YFLogxK
U2 - 10.1109/INFCOM.2010.5461927
DO - 10.1109/INFCOM.2010.5461927
M3 - Conference contribution
SN - 9781424458363
BT - Proceedings - IEEE INFOCOM
ER -